LIPIcs, Volume 304, ITC 2024

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