@Proceedings{aggarwal:LIPIcs.ITC.2024,
title = {{LIPIcs, Volume 304, ITC 2024, Complete Volume}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {1--232},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024},
URN = {urn:nbn:de:0030-drops-205075},
doi = {10.4230/LIPIcs.ITC.2024},
annote = {Keywords: LIPIcs, Volume 304, ITC 2024, Complete Volume}
}
@InProceedings{aggarwal:LIPIcs.ITC.2024.0,
author = {Aggarwal, Divesh},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {0:i--0:xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.0},
URN = {urn:nbn:de:0030-drops-205087},
doi = {10.4230/LIPIcs.ITC.2024.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{banoun_et_al:LIPIcs.ITC.2024.1,
author = {Banoun, D'or and Boyle, Elette and Cohen, Ran},
title = {{Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {1:1--1:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.1},
URN = {urn:nbn:de:0030-drops-205090},
doi = {10.4230/LIPIcs.ITC.2024.1},
annote = {Keywords: broadcast, topology-hiding protocols, information-theoretic security}
}
@InProceedings{applebaum_et_al:LIPIcs.ITC.2024.2,
author = {Applebaum, Benny and Bhushan, Kaartik and Prabhakaran, Manoj},
title = {{Communication Complexity vs Randomness Complexity in Interactive Proofs}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {2:1--2:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.2},
URN = {urn:nbn:de:0030-drops-205103},
doi = {10.4230/LIPIcs.ITC.2024.2},
annote = {Keywords: Interactive Proof Systems, Communication Complexity, Hash Functions, Pseudo-Random Generators, Compression}
}
@InProceedings{bendov_et_al:LIPIcs.ITC.2024.3,
author = {Ben Dov, Yoav and David, Liron and Naor, Moni and Tzalik, Elad},
title = {{Are Your Keys Protected? Time Will Tell}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {3:1--3:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.3},
URN = {urn:nbn:de:0030-drops-205119},
doi = {10.4230/LIPIcs.ITC.2024.3},
annote = {Keywords: Side channel attacks, Timing attacks, Keyed functions, Key oblivious, Noticeable security}
}
@InProceedings{ghazi_et_al:LIPIcs.ITC.2024.4,
author = {Ghazi, Badih and Kumar, Ravi and Manurangsi, Pasin},
title = {{Pure-DP Aggregation in the Shuffle Model: Error-Optimal and Communication-Efficient}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {4:1--4:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.4},
URN = {urn:nbn:de:0030-drops-205127},
doi = {10.4230/LIPIcs.ITC.2024.4},
annote = {Keywords: Differential Privacy, Shuffle Model, Aggregation, Pure Differential Privacy}
}
@InProceedings{gajulapalli_et_al:LIPIcs.ITC.2024.5,
author = {Gajulapalli, Karthik and Golovnev, Alexander and King, Samuel},
title = {{On the Power of Adaptivity for Function Inversion}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {5:1--5:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.5},
URN = {urn:nbn:de:0030-drops-205137},
doi = {10.4230/LIPIcs.ITC.2024.5},
annote = {Keywords: Function Inversion, Non-Adaptive lower bounds, Communication Complexity}
}
@InProceedings{ishai_et_al:LIPIcs.ITC.2024.6,
author = {Ishai, Yuval and Kelkar, Mahimna and Lee, Daniel and Ma, Yiping},
title = {{Information-Theoretic Single-Server PIR in the Shuffle Model}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {6:1--6:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.6},
URN = {urn:nbn:de:0030-drops-205142},
doi = {10.4230/LIPIcs.ITC.2024.6},
annote = {Keywords: Private information retrieval, Shuffle model}
}
@InProceedings{blackwell_et_al:LIPIcs.ITC.2024.7,
author = {Blackwell, Keller and Wootters, Mary},
title = {{Improved Trade-Offs Between Amortization and Download Bandwidth for Linear HSS}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {7:1--7:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.7},
URN = {urn:nbn:de:0030-drops-205156},
doi = {10.4230/LIPIcs.ITC.2024.7},
annote = {Keywords: Error Correcting Codes, Homomorphic Secret Sharing}
}
@InProceedings{dachmansoled_et_al:LIPIcs.ITC.2024.8,
author = {Dachman-Soled, Dana and Loss, Julian and O'Neill, Adam},
title = {{Breaking RSA Generically Is Equivalent to Factoring, with Preprocessing}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {8:1--8:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.8},
URN = {urn:nbn:de:0030-drops-205163},
doi = {10.4230/LIPIcs.ITC.2024.8},
annote = {Keywords: RSA, factoring, generic ring model, preprocessing}
}
@InProceedings{akshima:LIPIcs.ITC.2024.9,
author = {Akshima},
title = {{Time-Space Tradeoffs for Finding Multi-Collisions in Merkle-Damg\r{a}rd Hash Functions}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {9:1--9:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.9},
URN = {urn:nbn:de:0030-drops-205171},
doi = {10.4230/LIPIcs.ITC.2024.9},
annote = {Keywords: Collision, hash functions, multi-collisions, Merkle-Damg\r{a}rd, pre-computation, auxiliary input}
}
@InProceedings{eriguchi:LIPIcs.ITC.2024.10,
author = {Eriguchi, Reo},
title = {{Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {10:1--10:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.10},
URN = {urn:nbn:de:0030-drops-205182},
doi = {10.4230/LIPIcs.ITC.2024.10},
annote = {Keywords: Secure multiparty computation, Bottleneck complexity, Secret sharing}
}
@InProceedings{giorgi_et_al:LIPIcs.ITC.2024.11,
author = {Giorgi, Pascal and Laguillaumie, Fabien and Ottow, Lucas and Vergnaud, Damien},
title = {{Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations}},
booktitle = {5th Conference on Information-Theoretic Cryptography (ITC 2024)},
pages = {11:1--11:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-333-1},
ISSN = {1868-8969},
year = {2024},
volume = {304},
editor = {Aggarwal, Divesh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2024.11},
URN = {urn:nbn:de:0030-drops-205194},
doi = {10.4230/LIPIcs.ITC.2024.11},
annote = {Keywords: Multi-party computation, polynomial operations, privacy-preserving set operations}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing