HTML Export for ITC 2020

Copy to Clipboard Download

<h2>LIPIcs, Volume 163, ITC 2020</h2>
<ul>
<li>
    <span class="authors">Yael Tauman Kalai, Adam D. Smith, and Daniel Wichs</span>
    <span class="title">LIPIcs, Volume 163, ITC 2020, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020">10.4230/LIPIcs.ITC.2020</a>
</li>
<li>
    <span class="authors">Yael Tauman Kalai, Adam D. Smith, and Daniel Wichs</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.0">10.4230/LIPIcs.ITC.2020.0</a>
</li>
<li>
    <span class="authors">Victor Balcer and Albert Cheu</span>
    <span class="title">Separating Local &amp; Shuffled Differential Privacy via Histograms</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.1">10.4230/LIPIcs.ITC.2020.1</a>
</li>
<li>
    <span class="authors">Reo Eriguchi and Noboru Kunihiro</span>
    <span class="title">d-Multiplicative Secret Sharing for Multipartite Adversary Structures</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.2">10.4230/LIPIcs.ITC.2020.2</a>
</li>
<li>
    <span class="authors">Martin Hirt and Marta Mularczyk</span>
    <span class="title">Efficient MPC with a Mixed Adversary</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.3">10.4230/LIPIcs.ITC.2020.3</a>
</li>
<li>
    <span class="authors">Claude Crépeau, Arnaud Y. Massenet, Louis Salvail, Lucas Shigeru Stinchcombe, and Nan Yang</span>
    <span class="title">Practical Relativistic Zero-Knowledge for NP</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.4">10.4230/LIPIcs.ITC.2020.4</a>
</li>
<li>
    <span class="authors">Hendrik Eerikson, Marcel Keller, Claudio Orlandi, Pille Pullonen, Joonas Puura, and Mark Simkin</span>
    <span class="title">Use Your Brain! Arithmetic 3PC for Any Modulus with Active Security</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.5">10.4230/LIPIcs.ITC.2020.5</a>
</li>
<li>
    <span class="authors">Peter Michael Reichstein Rasmussen and Amit Sahai</span>
    <span class="title">Expander Graphs Are Non-Malleable Codes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.6">10.4230/LIPIcs.ITC.2020.6</a>
</li>
<li>
    <span class="authors">Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, and Huaxiong Wang</span>
    <span class="title">Leakage-Resilient Secret Sharing in Non-Compartmentalized Models</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.7">10.4230/LIPIcs.ITC.2020.7</a>
</li>
<li>
    <span class="authors">Kai-Min Chung, Tai-Ning Liao, and Luowen Qian</span>
    <span class="title">Lower Bounds for Function Inversion with Quantum Advice</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.8">10.4230/LIPIcs.ITC.2020.8</a>
</li>
<li>
    <span class="authors">Moni Naor, Lior Rotem, and Gil Segev</span>
    <span class="title">Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.9">10.4230/LIPIcs.ITC.2020.9</a>
</li>
<li>
    <span class="authors">Gil Segev and Ido Shahaf</span>
    <span class="title">Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.10">10.4230/LIPIcs.ITC.2020.10</a>
</li>
<li>
    <span class="authors">Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, and Elaine Shi</span>
    <span class="title">Oblivious Parallel Tight Compaction</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.11">10.4230/LIPIcs.ITC.2020.11</a>
</li>
<li>
    <span class="authors">Anat Paskin-Cherniavsky and Radune Artiom</span>
    <span class="title">On Polynomial Secret Sharing Schemes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.12">10.4230/LIPIcs.ITC.2020.12</a>
</li>
<li>
    <span class="authors">Naty Peter, Rotem Tsabary, and Hoeteck Wee</span>
    <span class="title">One-One Constrained Pseudorandom Functions</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.13">10.4230/LIPIcs.ITC.2020.13</a>
</li>
<li>
    <span class="authors">Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, and Uri Stemmer</span>
    <span class="title">The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.14">10.4230/LIPIcs.ITC.2020.14</a>
</li>
<li>
    <span class="authors">Badih Ghazi, Noah Golowich, Ravi Kumar, Pasin Manurangsi, Rasmus Pagh, and Ameya Velingker</span>
    <span class="title">Pure Differentially Private Summation from Anonymous Messages</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.15">10.4230/LIPIcs.ITC.2020.15</a>
</li>
<li>
    <span class="authors">Jeremiah Blocki, Shubhang Kulkarni, and Samson Zhou</span>
    <span class="title">On Locally Decodable Codes in Resource Bounded Channels</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2020.16">10.4230/LIPIcs.ITC.2020.16</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