<h2>LIPIcs, Volume 199, ITC 2021</h2>
<ul>
<li>
<span class="authors">Stefano Tessaro</span>
<span class="title">LIPIcs, Volume 199, ITC 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021">10.4230/LIPIcs.ITC.2021</a>
</li>
<li>
<span class="authors">Stefano Tessaro</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.0">10.4230/LIPIcs.ITC.2021.0</a>
</li>
<li>
<span class="authors">Guru-Vamsi Policharla, Manoj Prabhakaran, Rajeev Raghunath, and Parjanya Vyas</span>
<span class="title">Group Structure in Correlations and Its Applications in Cryptography</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.1">10.4230/LIPIcs.ITC.2021.1</a>
</li>
<li>
<span class="authors">Ivan Bjerre Damgård, Boyang Li, and Nikolaj Ignatieff Schwartzbach</span>
<span class="title">More Communication Lower Bounds for Information-Theoretic MPC</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.2">10.4230/LIPIcs.ITC.2021.2</a>
</li>
<li>
<span class="authors">Gal Arnon and Guy N. Rothblum</span>
<span class="title">On Prover-Efficient Public-Coin Emulation of Interactive Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.3">10.4230/LIPIcs.ITC.2021.3</a>
</li>
<li>
<span class="authors">Benny Applebaum and Eyal Golombek</span>
<span class="title">On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.4">10.4230/LIPIcs.ITC.2021.4</a>
</li>
<li>
<span class="authors">Samuel Dittmer, Yuval Ishai, and Rafail Ostrovsky</span>
<span class="title">Line-Point Zero Knowledge and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.5">10.4230/LIPIcs.ITC.2021.5</a>
</li>
<li>
<span class="authors">Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, and Mor Weiss</span>
<span class="title">ZK-PCPs from Leakage-Resilient Secret Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.6">10.4230/LIPIcs.ITC.2021.6</a>
</li>
<li>
<span class="authors">Brett Hemenway Falk and Rafail Ostrovsky</span>
<span class="title">Secure Merge with O(n log log n) Secure Operations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.7">10.4230/LIPIcs.ITC.2021.7</a>
</li>
<li>
<span class="authors">T-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, and Kartik Nayak</span>
<span class="title">Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.8">10.4230/LIPIcs.ITC.2021.8</a>
</li>
<li>
<span class="authors">Megumi Ando, Anna Lysyanskaya, and Eli Upfal</span>
<span class="title">On the Complexity of Anonymous Communication Through Public Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.9">10.4230/LIPIcs.ITC.2021.9</a>
</li>
<li>
<span class="authors">Ivan Bjerre Damgård, Kasper Green Larsen, and Sophia Yakoubov</span>
<span class="title">Broadcast Secret-Sharing, Bounds and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.10">10.4230/LIPIcs.ITC.2021.10</a>
</li>
<li>
<span class="authors">Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar, and Jenit Tomy</span>
<span class="title">Locally Reconstructable Non-Malleable Secret Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.11">10.4230/LIPIcs.ITC.2021.11</a>
</li>
<li>
<span class="authors">Marshall Ball, Alper Çakan, and Tal Malkin</span>
<span class="title">Linear Threshold Secret-Sharing with Binary Reconstruction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.12">10.4230/LIPIcs.ITC.2021.12</a>
</li>
<li>
<span class="authors">Yevgeniy Dodis and Kevin Yeo</span>
<span class="title">Doubly-Affine Extractors, and Their Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.13">10.4230/LIPIcs.ITC.2021.13</a>
</li>
<li>
<span class="authors">Yevgeniy Dodis, Siyao Guo, Noah Stephens-Davidowitz, and Zhiye Xie</span>
<span class="title">Online Linear Extractors for Independent Sources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.14">10.4230/LIPIcs.ITC.2021.14</a>
</li>
<li>
<span class="authors">Luke Demarest, Benjamin Fuller, and Alexander Russell</span>
<span class="title">Code Offset in the Exponent</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.15">10.4230/LIPIcs.ITC.2021.15</a>
</li>
<li>
<span class="authors">Alexander R. Block, Simina Brânzei, Hemanta K. Maji, Himanshi Mehta, Tamalika Mukherjee, and Hai H. Nguyen</span>
<span class="title">P₄-free Partition and Cover Numbers & Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.16">10.4230/LIPIcs.ITC.2021.16</a>
</li>
<li>
<span class="authors">Kenji Yasunaga</span>
<span class="title">Replacing Probability Distributions in Security Games via Hellinger Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.17">10.4230/LIPIcs.ITC.2021.17</a>
</li>
<li>
<span class="authors">Yue Gao and Or Sheffet</span>
<span class="title">Differentially Private Approximations of a Convex Hull in Low Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.18">10.4230/LIPIcs.ITC.2021.18</a>
</li>
<li>
<span class="authors">Shumo Chu, Danyang Zhuo, Elaine Shi, and T-H. Hubert Chan</span>
<span class="title">Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.19">10.4230/LIPIcs.ITC.2021.19</a>
</li>
<li>
<span class="authors">Akinori Kawachi and Harumichi Nishimura</span>
<span class="title">Communication Complexity of Private Simultaneous Quantum Messages Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.20">10.4230/LIPIcs.ITC.2021.20</a>
</li>
<li>
<span class="authors">Christian Majenz, Chanelle Matadah Manfouo, and Maris Ozols</span>
<span class="title">Quantum-Access Security of the Winternitz One-Time Signature Scheme</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.21">10.4230/LIPIcs.ITC.2021.21</a>
</li>
<li>
<span class="authors">Jeremiah Blocki, Seunghoon Lee, and Samson Zhou</span>
<span class="title">On the Security of Proofs of Sequential Work in a Post-Quantum World</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.22">10.4230/LIPIcs.ITC.2021.22</a>
</li>
<li>
<span class="authors">Xinze Li, Qiang Tang, and Zhenfeng Zhang</span>
<span class="title">Fooling an Unbounded Adversary with a Short Key, Repeatedly: The Honey Encryption Perspective</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.23">10.4230/LIPIcs.ITC.2021.23</a>
</li>
<li>
<span class="authors">Yevgeniy Dodis, Dmitry Khovratovich, Nicky Mouha, and Mridul Nandi</span>
<span class="title">T₅: Hashing Five Inputs with Three Compression Calls</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.24">10.4230/LIPIcs.ITC.2021.24</a>
</li>
<li>
<span class="authors">Gwangbae Choi, F. Betül Durak, and Serge Vaudenay</span>
<span class="title">Post-Compromise Security in Self-Encryption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.25">10.4230/LIPIcs.ITC.2021.25</a>
</li>
<li>
<span class="authors">Gili Schul-Ganz and Gil Segev</span>
<span class="title">Generic-Group Identity-Based Encryption: A Tight Impossibility Result</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2021.26">10.4230/LIPIcs.ITC.2021.26</a>
</li>
</ul>
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