<h2>LIPIcs, Volume 267, ITC 2023</h2>
<ul>
<li>
<span class="authors">Kai-Min Chung</span>
<span class="title">LIPIcs, Volume 267, ITC 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023">10.4230/LIPIcs.ITC.2023</a>
</li>
<li>
<span class="authors">Kai-Min Chung</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.0">10.4230/LIPIcs.ITC.2023.0</a>
</li>
<li>
<span class="authors">Nicolas Resch and Chen Yuan</span>
<span class="title">Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.1">10.4230/LIPIcs.ITC.2023.1</a>
</li>
<li>
<span class="authors">Noam Mazor</span>
<span class="title">A Lower Bound on the Share Size in Evolving Secret Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.2">10.4230/LIPIcs.ITC.2023.2</a>
</li>
<li>
<span class="authors">Andrej Bogdanov</span>
<span class="title">Csirmaz’s Duality Conjecture and Threshold Secret Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.3">10.4230/LIPIcs.ITC.2023.3</a>
</li>
<li>
<span class="authors">Cody Freitag and Ilan Komargodski</span>
<span class="title">The Cost of Statistical Security in Proofs for Repeated Squaring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.4">10.4230/LIPIcs.ITC.2023.4</a>
</li>
<li>
<span class="authors">Nils Fleischhacker, Suparno Ghoshal, and Mark Simkin</span>
<span class="title">Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.5">10.4230/LIPIcs.ITC.2023.5</a>
</li>
<li>
<span class="authors">Vipul Goyal, Chen-Da Liu-Zhang, and Rafail Ostrovsky</span>
<span class="title">Asymmetric Multi-Party Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.6">10.4230/LIPIcs.ITC.2023.6</a>
</li>
<li>
<span class="authors">Ivan Damgård, Daniel Escudero, and Antigoni Polychroniadou</span>
<span class="title">Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.7">10.4230/LIPIcs.ITC.2023.7</a>
</li>
<li>
<span class="authors">Fabrice Benhamouda, Shai Halevi, and Lev Stambler</span>
<span class="title">Weighted Secret Sharing from Wiretap Channels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.8">10.4230/LIPIcs.ITC.2023.8</a>
</li>
<li>
<span class="authors">Samuel Bouaziz-Ermann, Alex B. Grilo, and Damien Vergnaud</span>
<span class="title">Quantum Security of Subset Cover Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.9">10.4230/LIPIcs.ITC.2023.9</a>
</li>
<li>
<span class="authors">Kasper Green Larsen, Maciej Obremski, and Mark Simkin</span>
<span class="title">Distributed Shuffling in Adversarial Environments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.10">10.4230/LIPIcs.ITC.2023.10</a>
</li>
<li>
<span class="authors">Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, and Divya Ravi</span>
<span class="title">MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.11">10.4230/LIPIcs.ITC.2023.11</a>
</li>
<li>
<span class="authors">Mohammad Hajiabadi, Shahram Khazaei, and Behzad Vahdani</span>
<span class="title">Randomness Recoverable Secret Sharing Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.12">10.4230/LIPIcs.ITC.2023.12</a>
</li>
<li>
<span class="authors">Ivan Damgård, Divya Ravi, Daniel Tschudi, and Sophia Yakoubov</span>
<span class="title">Secure Communication in Dynamic Incomplete Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.13">10.4230/LIPIcs.ITC.2023.13</a>
</li>
<li>
<span class="authors">Justin Holmgren and Ruta Jawale</span>
<span class="title">Locally Covert Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.14">10.4230/LIPIcs.ITC.2023.14</a>
</li>
<li>
<span class="authors">Mohammad Mahmoody and Wei Qi</span>
<span class="title">Online Mergers and Applications to Registration-Based Encryption and Accumulators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.15">10.4230/LIPIcs.ITC.2023.15</a>
</li>
<li>
<span class="authors">Amos Beimel</span>
<span class="title">Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.16">10.4230/LIPIcs.ITC.2023.16</a>
</li>
<li>
<span class="authors">Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson, and Samson Zhou</span>
<span class="title">Differentially Private Aggregation via Imperfect Shuffling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.17">10.4230/LIPIcs.ITC.2023.17</a>
</li>
<li>
<span class="authors">Keitaro Hiwatashi and Koji Nuida</span>
<span class="title">Exponential Correlated Randomness Is Necessary in Communication-Optimal Perfectly Secure Two-Party Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2023.18">10.4230/LIPIcs.ITC.2023.18</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