2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 1-590, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Proceedings{tessaro:LIPIcs.ITC.2021, title = {{LIPIcs, Volume 199, ITC 2021, Complete Volume}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {1--590}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021}, URN = {urn:nbn:de:0030-drops-143187}, doi = {10.4230/LIPIcs.ITC.2021}, annote = {Keywords: LIPIcs, Volume 199, ITC 2021, Complete Volume} }
2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{tessaro:LIPIcs.ITC.2021.0, author = {Tessaro, Stefano}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.0}, URN = {urn:nbn:de:0030-drops-143195}, doi = {10.4230/LIPIcs.ITC.2021.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Guru-Vamsi Policharla, Manoj Prabhakaran, Rajeev Raghunath, and Parjanya Vyas. Group Structure in Correlations and Its Applications in Cryptography. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 1:1-1:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{policharla_et_al:LIPIcs.ITC.2021.1, author = {Policharla, Guru-Vamsi and Prabhakaran, Manoj and Raghunath, Rajeev and Vyas, Parjanya}, title = {{Group Structure in Correlations and Its Applications in Cryptography}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {1:1--1:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.1}, URN = {urn:nbn:de:0030-drops-143208}, doi = {10.4230/LIPIcs.ITC.2021.1}, annote = {Keywords: Group correlations, bi-affine correlations, secure computation} }
Ivan Bjerre Damgård, Boyang Li, and Nikolaj Ignatieff Schwartzbach. More Communication Lower Bounds for Information-Theoretic MPC. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 2:1-2:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{damgard_et_al:LIPIcs.ITC.2021.2, author = {Damg\r{a}rd, Ivan Bjerre and Li, Boyang and Schwartzbach, Nikolaj Ignatieff}, title = {{More Communication Lower Bounds for Information-Theoretic MPC}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {2:1--2:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.2}, URN = {urn:nbn:de:0030-drops-143211}, doi = {10.4230/LIPIcs.ITC.2021.2}, annote = {Keywords: Multiparty Computation, Lower bounds} }
Gal Arnon and Guy N. Rothblum. On Prover-Efficient Public-Coin Emulation of Interactive Proofs. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{arnon_et_al:LIPIcs.ITC.2021.3, author = {Arnon, Gal and Rothblum, Guy N.}, title = {{On Prover-Efficient Public-Coin Emulation of Interactive Proofs}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.3}, URN = {urn:nbn:de:0030-drops-143226}, doi = {10.4230/LIPIcs.ITC.2021.3}, annote = {Keywords: Interactive Proofs, Computational complexity, Cryptography} }
Benny Applebaum and Eyal Golombek. On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 4:1-4:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{applebaum_et_al:LIPIcs.ITC.2021.4, author = {Applebaum, Benny and Golombek, Eyal}, title = {{On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {4:1--4:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.4}, URN = {urn:nbn:de:0030-drops-143238}, doi = {10.4230/LIPIcs.ITC.2021.4}, annote = {Keywords: Interactive proofs, Zero-knowledge proofs, Pseudorandomness} }
Samuel Dittmer, Yuval Ishai, and Rafail Ostrovsky. Line-Point Zero Knowledge and Its Applications. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 5:1-5:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dittmer_et_al:LIPIcs.ITC.2021.5, author = {Dittmer, Samuel and Ishai, Yuval and Ostrovsky, Rafail}, title = {{Line-Point Zero Knowledge and Its Applications}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {5:1--5:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.5}, URN = {urn:nbn:de:0030-drops-143249}, doi = {10.4230/LIPIcs.ITC.2021.5}, annote = {Keywords: Zero-knowledge proofs, NIZK, correlated randomness, vector oblivious linear evaluation, non-interactive secure computation} }
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, and Mor Weiss. ZK-PCPs from Leakage-Resilient Secret Sharing. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 6:1-6:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{hazay_et_al:LIPIcs.ITC.2021.6, author = {Hazay, Carmit and Venkitasubramaniam, Muthuramakrishnan and Weiss, Mor}, title = {{ZK-PCPs from Leakage-Resilient Secret Sharing}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {6:1--6:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.6}, URN = {urn:nbn:de:0030-drops-143250}, doi = {10.4230/LIPIcs.ITC.2021.6}, annote = {Keywords: Zero Knowledge, Probabilisitically Checkable Proofs, PCPs of Proximity, Leakage Resilience, Secret Sharing} }
Brett Hemenway Falk and Rafail Ostrovsky. Secure Merge with O(n log log n) Secure Operations. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 7:1-7:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{falk_et_al:LIPIcs.ITC.2021.7, author = {Falk, Brett Hemenway and Ostrovsky, Rafail}, title = {{Secure Merge with O(n log log n) Secure Operations}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {7:1--7:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.7}, URN = {urn:nbn:de:0030-drops-143265}, doi = {10.4230/LIPIcs.ITC.2021.7}, annote = {Keywords: Secure computation, Data-oblivious algorithms, Sorting, Merging, Shuffling, Compaction} }
T-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, and Kartik Nayak. Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 8:1-8:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chan_et_al:LIPIcs.ITC.2021.8, author = {Chan, T-H. Hubert and Shi, Elaine and Lin, Wei-Kai and Nayak, Kartik}, title = {{Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {8:1--8:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.8}, URN = {urn:nbn:de:0030-drops-143271}, doi = {10.4230/LIPIcs.ITC.2021.8}, annote = {Keywords: perfect oblivious RAM, oblivious PRAM} }
Megumi Ando, Anna Lysyanskaya, and Eli Upfal. On the Complexity of Anonymous Communication Through Public Networks. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 9:1-9:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ando_et_al:LIPIcs.ITC.2021.9, author = {Ando, Megumi and Lysyanskaya, Anna and Upfal, Eli}, title = {{On the Complexity of Anonymous Communication Through Public Networks}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {9:1--9:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.9}, URN = {urn:nbn:de:0030-drops-143282}, doi = {10.4230/LIPIcs.ITC.2021.9}, annote = {Keywords: Anonymity, privacy, onion routing} }
Ivan Bjerre Damgård, Kasper Green Larsen, and Sophia Yakoubov. Broadcast Secret-Sharing, Bounds and Applications. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 10:1-10:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{damgard_et_al:LIPIcs.ITC.2021.10, author = {Damg\r{a}rd, Ivan Bjerre and Larsen, Kasper Green and Yakoubov, Sophia}, title = {{Broadcast Secret-Sharing, Bounds and Applications}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {10:1--10:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.10}, URN = {urn:nbn:de:0030-drops-143299}, doi = {10.4230/LIPIcs.ITC.2021.10}, annote = {Keywords: Secret-Sharing, Ad-hoc Threshold Encryption} }
Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar, and Jenit Tomy. Locally Reconstructable Non-Malleable Secret Sharing. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 11:1-11:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kanukurthi_et_al:LIPIcs.ITC.2021.11, author = {Kanukurthi, Bhavana and Obbattu, Sai Lakshmi Bhavana and Sekar, Sruthi and Tomy, Jenit}, title = {{Locally Reconstructable Non-Malleable Secret Sharing}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {11:1--11:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.11}, URN = {urn:nbn:de:0030-drops-143302}, doi = {10.4230/LIPIcs.ITC.2021.11}, annote = {Keywords: Information Theoretic Cryptography, Secret Sharing, Non-malleability, Local Reconstructability} }
Marshall Ball, Alper Çakan, and Tal Malkin. Linear Threshold Secret-Sharing with Binary Reconstruction. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 12:1-12:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ball_et_al:LIPIcs.ITC.2021.12, author = {Ball, Marshall and \c{C}akan, Alper and Malkin, Tal}, title = {{Linear Threshold Secret-Sharing with Binary Reconstruction}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {12:1--12:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.12}, URN = {urn:nbn:de:0030-drops-143313}, doi = {10.4230/LIPIcs.ITC.2021.12}, annote = {Keywords: Secret sharing, Span programs, Lattice-based cryptography} }
Yevgeniy Dodis and Kevin Yeo. Doubly-Affine Extractors, and Their Applications. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 13:1-13:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dodis_et_al:LIPIcs.ITC.2021.13, author = {Dodis, Yevgeniy and Yeo, Kevin}, title = {{Doubly-Affine Extractors, and Their Applications}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {13:1--13:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.13}, URN = {urn:nbn:de:0030-drops-143320}, doi = {10.4230/LIPIcs.ITC.2021.13}, annote = {Keywords: extractors, information-theoretic privacy, everlasting privacy} }
Yevgeniy Dodis, Siyao Guo, Noah Stephens-Davidowitz, and Zhiye Xie. Online Linear Extractors for Independent Sources. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 14:1-14:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dodis_et_al:LIPIcs.ITC.2021.14, author = {Dodis, Yevgeniy and Guo, Siyao and Stephens-Davidowitz, Noah and Xie, Zhiye}, title = {{Online Linear Extractors for Independent Sources}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {14:1--14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.14}, URN = {urn:nbn:de:0030-drops-143339}, doi = {10.4230/LIPIcs.ITC.2021.14}, annote = {Keywords: feasibility of randomness extraction, randomness condensers, Fourier analysis} }
Luke Demarest, Benjamin Fuller, and Alexander Russell. Code Offset in the Exponent. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 15:1-15:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{demarest_et_al:LIPIcs.ITC.2021.15, author = {Demarest, Luke and Fuller, Benjamin and Russell, Alexander}, title = {{Code Offset in the Exponent}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {15:1--15:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.15}, URN = {urn:nbn:de:0030-drops-143348}, doi = {10.4230/LIPIcs.ITC.2021.15}, annote = {Keywords: fuzzy extractors, code offset, learning with errors, error-correction, generic group model} }
Alexander R. Block, Simina Brânzei, Hemanta K. Maji, Himanshi Mehta, Tamalika Mukherjee, and Hai H. Nguyen. P₄-free Partition and Cover Numbers & Applications. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 16:1-16:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{block_et_al:LIPIcs.ITC.2021.16, author = {Block, Alexander R. and Br\^{a}nzei, Simina and Maji, Hemanta K. and Mehta, Himanshi and Mukherjee, Tamalika and Nguyen, Hai H.}, title = {{P₄-free Partition and Cover Numbers \& Applications}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {16:1--16:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.16}, URN = {urn:nbn:de:0030-drops-143357}, doi = {10.4230/LIPIcs.ITC.2021.16}, annote = {Keywords: Secure keys, Secure private randomness, Gray-Wyner system, Cryptographic complexity, Nondeterministic communication complexity, Leakage-resilience, Combinatorial optimization, Product dimension, Zarankiewicz problem, Algebraic lower-bounding techniques, P₄-free partition number, P₄-free cover number} }
Kenji Yasunaga. Replacing Probability Distributions in Security Games via Hellinger Distance. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{yasunaga:LIPIcs.ITC.2021.17, author = {Yasunaga, Kenji}, title = {{Replacing Probability Distributions in Security Games via Hellinger Distance}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.17}, URN = {urn:nbn:de:0030-drops-143361}, doi = {10.4230/LIPIcs.ITC.2021.17}, annote = {Keywords: Security proof, Hellinger distance, randomness extractor, entropy loss} }
Yue Gao and Or Sheffet. Differentially Private Approximations of a Convex Hull in Low Dimensions. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{gao_et_al:LIPIcs.ITC.2021.18, author = {Gao, Yue and Sheffet, Or}, title = {{Differentially Private Approximations of a Convex Hull in Low Dimensions}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.18}, URN = {urn:nbn:de:0030-drops-143377}, doi = {10.4230/LIPIcs.ITC.2021.18}, annote = {Keywords: Differential Privacy, Computational Geometry, Tukey Depth} }
Shumo Chu, Danyang Zhuo, Elaine Shi, and T-H. Hubert Chan. Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 19:1-19:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chu_et_al:LIPIcs.ITC.2021.19, author = {Chu, Shumo and Zhuo, Danyang and Shi, Elaine and Chan, T-H. Hubert}, title = {{Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {19:1--19:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.19}, URN = {urn:nbn:de:0030-drops-143386}, doi = {10.4230/LIPIcs.ITC.2021.19}, annote = {Keywords: differentially oblivious, database join, instance-specific performance} }
Akinori Kawachi and Harumichi Nishimura. Communication Complexity of Private Simultaneous Quantum Messages Protocols. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kawachi_et_al:LIPIcs.ITC.2021.20, author = {Kawachi, Akinori and Nishimura, Harumichi}, title = {{Communication Complexity of Private Simultaneous Quantum Messages Protocols}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {20:1--20:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.20}, URN = {urn:nbn:de:0030-drops-143393}, doi = {10.4230/LIPIcs.ITC.2021.20}, annote = {Keywords: Communication complexity, private simultaneous messages, quantum protocols, secure multi-party computation} }
Christian Majenz, Chanelle Matadah Manfouo, and Maris Ozols. Quantum-Access Security of the Winternitz One-Time Signature Scheme. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 21:1-21:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{majenz_et_al:LIPIcs.ITC.2021.21, author = {Majenz, Christian and Manfouo, Chanelle Matadah and Ozols, Maris}, title = {{Quantum-Access Security of the Winternitz One-Time Signature Scheme}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {21:1--21:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.21}, URN = {urn:nbn:de:0030-drops-143406}, doi = {10.4230/LIPIcs.ITC.2021.21}, annote = {Keywords: quantum cryptography, one-time signature schemes, quantum random oracle model, post-quantum cryptography, quantum world, hash-based signatures, information-theoretic security} }
Jeremiah Blocki, Seunghoon Lee, and Samson Zhou. On the Security of Proofs of Sequential Work in a Post-Quantum World. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 22:1-22:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{blocki_et_al:LIPIcs.ITC.2021.22, author = {Blocki, Jeremiah and Lee, Seunghoon and Zhou, Samson}, title = {{On the Security of Proofs of Sequential Work in a Post-Quantum World}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {22:1--22:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.22}, URN = {urn:nbn:de:0030-drops-143415}, doi = {10.4230/LIPIcs.ITC.2021.22}, annote = {Keywords: Proof of Sequential Work, Parallel Quantum Random Oracle Model, Lower Bounds} }
Xinze Li, Qiang Tang, and Zhenfeng Zhang. Fooling an Unbounded Adversary with a Short Key, Repeatedly: The Honey Encryption Perspective. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 23:1-23:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{li_et_al:LIPIcs.ITC.2021.23, author = {Li, Xinze and Tang, Qiang and Zhang, Zhenfeng}, title = {{Fooling an Unbounded Adversary with a Short Key, Repeatedly: The Honey Encryption Perspective}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {23:1--23:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.23}, URN = {urn:nbn:de:0030-drops-143425}, doi = {10.4230/LIPIcs.ITC.2021.23}, annote = {Keywords: unconditional security, information theoretic encryption, honey encryption} }
Yevgeniy Dodis, Dmitry Khovratovich, Nicky Mouha, and Mridul Nandi. T₅: Hashing Five Inputs with Three Compression Calls. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 24:1-24:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dodis_et_al:LIPIcs.ITC.2021.24, author = {Dodis, Yevgeniy and Khovratovich, Dmitry and Mouha, Nicky and Nandi, Mridul}, title = {{T₅: Hashing Five Inputs with Three Compression Calls}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {24:1--24:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.24}, URN = {urn:nbn:de:0030-drops-143430}, doi = {10.4230/LIPIcs.ITC.2021.24}, annote = {Keywords: hash functions, Merkle trees, Merkle-Damg\r{a}rd, collision resistance} }
Gwangbae Choi, F. Betül Durak, and Serge Vaudenay. Post-Compromise Security in Self-Encryption. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 25:1-25:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{choi_et_al:LIPIcs.ITC.2021.25, author = {Choi, Gwangbae and Durak, F. Bet\"{u}l and Vaudenay, Serge}, title = {{Post-Compromise Security in Self-Encryption}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {25:1--25:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.25}, URN = {urn:nbn:de:0030-drops-143447}, doi = {10.4230/LIPIcs.ITC.2021.25}, annote = {Keywords: Encryption, Ratchet, Post-Compromise Security, Instant Messaging, Session Resumption, Cloud Storage} }
Gili Schul-Ganz and Gil Segev. Generic-Group Identity-Based Encryption: A Tight Impossibility Result. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 26:1-26:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{schulganz_et_al:LIPIcs.ITC.2021.26, author = {Schul-Ganz, Gili and Segev, Gil}, title = {{Generic-Group Identity-Based Encryption: A Tight Impossibility Result}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {26:1--26:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.26}, URN = {urn:nbn:de:0030-drops-143455}, doi = {10.4230/LIPIcs.ITC.2021.26}, annote = {Keywords: Identity-based encryption, generic-group model} }