<h2>LIPIcs, Volume 230, ITC 2022</h2>
<ul>
<li>
<span class="authors">Dana Dachman-Soled</span>
<span class="title">LIPIcs, Volume 230, ITC 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022">10.4230/LIPIcs.ITC.2022</a>
</li>
<li>
<span class="authors">Dana Dachman-Soled</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.0">10.4230/LIPIcs.ITC.2022.0</a>
</li>
<li>
<span class="authors">Reo Eriguchi, Kaoru Kurosawa, and Koji Nuida</span>
<span class="title">Multi-Server PIR with Full Error Detection and Limited Error Correction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.1">10.4230/LIPIcs.ITC.2022.1</a>
</li>
<li>
<span class="authors">Kazuhiko Minematsu</span>
<span class="title">Property-Preserving Hash Functions and Combinatorial Group Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.2">10.4230/LIPIcs.ITC.2022.2</a>
</li>
<li>
<span class="authors">Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, and Mor Weiss</span>
<span class="title">Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and More</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.3">10.4230/LIPIcs.ITC.2022.3</a>
</li>
<li>
<span class="authors">Nico Döttling and Jesko Dujmovic</span>
<span class="title">Maliciously Circuit-Private FHE from Information-Theoretic Principles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.4">10.4230/LIPIcs.ITC.2022.4</a>
</li>
<li>
<span class="authors">Varun Madathil, Chris Orsini, Alessandra Scafuro, and Daniele Venturi</span>
<span class="title">From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-Theoretic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.5">10.4230/LIPIcs.ITC.2022.5</a>
</li>
<li>
<span class="authors">Pavel Hubáček, Ľubica Jančová, and Veronika Králová</span>
<span class="title">On the Distributed Discrete Logarithm Problem with Preprocessing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.6">10.4230/LIPIcs.ITC.2022.6</a>
</li>
<li>
<span class="authors">Marshall Ball and Tim Randolph</span>
<span class="title">A Note on the Complexity of Private Simultaneous Messages with Many Parties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.7">10.4230/LIPIcs.ITC.2022.7</a>
</li>
<li>
<span class="authors">Peter Scholl, Mark Simkin, and Luisa Siniscalchi</span>
<span class="title">Multiparty Computation with Covert Security and Public Verifiability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.8">10.4230/LIPIcs.ITC.2022.8</a>
</li>
<li>
<span class="authors">Sandro Coretti, Yevgeniy Dodis, Harish Karthikeyan, Noah Stephens-Davidowitz, and Stefano Tessaro</span>
<span class="title">On Seedless PRNGs and Premature Next</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.9">10.4230/LIPIcs.ITC.2022.9</a>
</li>
<li>
<span class="authors">Saikrishna Badrinarayanan, Yuval Ishai, Dakshita Khurana, Amit Sahai, and Daniel Wichs</span>
<span class="title">Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.10">10.4230/LIPIcs.ITC.2022.10</a>
</li>
<li>
<span class="authors">Chandranan Dhar, Yevgeniy Dodis, and Mridul Nandi</span>
<span class="title">Revisiting Collision and Local Opening Analysis of ABR Hash</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.11">10.4230/LIPIcs.ITC.2022.11</a>
</li>
<li>
<span class="authors">Lior Rotem and Gil Segev</span>
<span class="title">A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.12">10.4230/LIPIcs.ITC.2022.12</a>
</li>
<li>
<span class="authors">Lior Rotem</span>
<span class="title">Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.13">10.4230/LIPIcs.ITC.2022.13</a>
</li>
<li>
<span class="authors">Nishanth Chandran, Pouyan Forghani, Juan Garay, Rafail Ostrovsky, Rutvik Patel, and Vassilis Zikas</span>
<span class="title">Universally Composable Almost-Everywhere Secure Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.14">10.4230/LIPIcs.ITC.2022.14</a>
</li>
<li>
<span class="authors">Gilad Asharov, Ran Cohen, and Oren Shochat</span>
<span class="title">Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.15">10.4230/LIPIcs.ITC.2022.15</a>
</li>
<li>
<span class="authors">Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang, Xiuyu Ye, and Albert Yu</span>
<span class="title">Tight Estimate of the Local Leakage Resilience of the Additive Secret-Sharing Scheme & Its Consequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.16">10.4230/LIPIcs.ITC.2022.16</a>
</li>
<li>
<span class="authors">Elette Boyle, Niv Gilboa, Yuval Ishai, and Victor I. Kolobov</span>
<span class="title">Information-Theoretic Distributed Point Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2022.17">10.4230/LIPIcs.ITC.2022.17</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