HTML Export for ITC 2024

Copy to Clipboard Download

<h2>LIPIcs, Volume 304, ITC 2024</h2>
<ul>
<li>
    <span class="authors">Divesh Aggarwal</span>
    <span class="title">LIPIcs, Volume 304, ITC 2024, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024">10.4230/LIPIcs.ITC.2024</a>
</li>
<li>
    <span class="authors">Divesh Aggarwal</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.0">10.4230/LIPIcs.ITC.2024.0</a>
</li>
<li>
    <span class="authors">D&#039;or Banoun, Elette Boyle, and Ran Cohen</span>
    <span class="title">Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.1">10.4230/LIPIcs.ITC.2024.1</a>
</li>
<li>
    <span class="authors">Benny Applebaum, Kaartik Bhushan, and Manoj Prabhakaran</span>
    <span class="title">Communication Complexity vs Randomness Complexity in Interactive Proofs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.2">10.4230/LIPIcs.ITC.2024.2</a>
</li>
<li>
    <span class="authors">Yoav Ben Dov, Liron David, Moni Naor, and Elad Tzalik</span>
    <span class="title">Are Your Keys Protected? Time Will Tell</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.3">10.4230/LIPIcs.ITC.2024.3</a>
</li>
<li>
    <span class="authors">Badih Ghazi, Ravi Kumar, and Pasin Manurangsi</span>
    <span class="title">Pure-DP Aggregation in the Shuffle Model: Error-Optimal and Communication-Efficient</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.4">10.4230/LIPIcs.ITC.2024.4</a>
</li>
<li>
    <span class="authors">Karthik Gajulapalli, Alexander Golovnev, and Samuel King</span>
    <span class="title">On the Power of Adaptivity for Function Inversion</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.5">10.4230/LIPIcs.ITC.2024.5</a>
</li>
<li>
    <span class="authors">Yuval Ishai, Mahimna Kelkar, Daniel Lee, and Yiping Ma</span>
    <span class="title">Information-Theoretic Single-Server PIR in the Shuffle Model</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.6">10.4230/LIPIcs.ITC.2024.6</a>
</li>
<li>
    <span class="authors">Keller Blackwell and Mary Wootters</span>
    <span class="title">Improved Trade-Offs Between Amortization and Download Bandwidth for Linear HSS</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.7">10.4230/LIPIcs.ITC.2024.7</a>
</li>
<li>
    <span class="authors">Dana Dachman-Soled, Julian Loss, and Adam O&#039;Neill</span>
    <span class="title">Breaking RSA Generically Is Equivalent to Factoring, with Preprocessing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.8">10.4230/LIPIcs.ITC.2024.8</a>
</li>
<li>
    <span class="authors"> Akshima</span>
    <span class="title">Time-Space Tradeoffs for Finding Multi-Collisions in Merkle-Damgård Hash Functions</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.9">10.4230/LIPIcs.ITC.2024.9</a>
</li>
<li>
    <span class="authors">Reo Eriguchi</span>
    <span class="title">Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.10">10.4230/LIPIcs.ITC.2024.10</a>
</li>
<li>
    <span class="authors">Pascal Giorgi, Fabien Laguillaumie, Lucas Ottow, and Damien Vergnaud</span>
    <span class="title">Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.ITC.2024.11">10.4230/LIPIcs.ITC.2024.11</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