In Cooperation With
ITC 2024: Accepted Papers
Information-Theoretic Topology-Hiding Broadcast: Wheels, Stars, Friendship, and Beyond
D. Banoun, E. Boyle, R. Cohen
Communication Complexity vs Randomness Complexity in Interactive Proofs
B. Applebaum, K. Bhushan, M. Prabhakaran
Are Your Keys Protected? Time will Tell
M. Naor, E. Tzailk, L. David, Y. Ben-Dov
Pure-DP Aggregation in the Shuffle Model: Error-Optimal and Communication-Efficient
B. Ghazi, R. Kumar, P. Manurangsi
On the Power of Adaptivity for Function Inversion
K. Gajulapalli, A. Golovnev, S. King
Information-Theoretic Single-Server PIR in the Shuffle Model
Y. Ishai, M. Kelkar, D. Lee, Y. Ma
Improved Trade-offs Between Amortization and Download Bandwidth for Linear HSS
K. Blackwell, M. Wootters
Breaking RSA Generically is Equivalent to Factoring, with Preprocessing
D. Dachman-Soled, J. Loss, A. O'Neill
Time-Space Tradeoffs for Finding Multi-collisions in Merkle-Damgård Hash Functions
Akshima
Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness
R. Eriguchi
Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations
L. Ottow, P. Giorgi, D. Vergnaud, F. Laguillaumie
Highlights Track Talks
SAT reduces to the Minimum Circuit Size Problem with a Random Oracle
Rahul Ilango
Speaker: Rahul Ilango
Quantum Cryptography in Algorithmica
William Kretschmer; Luowen Qian; Makrand Sinha; Avishay Tal
Speaker: William Kretschmer
Extracting Randomness from Samplable Distributions, Revisited
Marshall Ball; Dana Dachman-Soled; Eli Goldin; Saachi Mutreja
Speaker: Eli Goldin
On Pseudolinear Codes for Correcting Adversarial Errors
Eric Ruzomberka, Homa Nikbakht, Christopher G. Brinton; H. Vincent Poor
Speaker: Eric Ruzomberka
Hard Languages in NP cap coNP and NIZK Proofs from Unstructured Hardness
Riddhi Ghosal, Yuval Ishai, Alexis Korb, Eyal Kushilevitz, Paul Lou, Amit Sahai
Speaker: Riddhi Ghosal
IOPs with Inverse Polynomial Soundness Error
Gal Arnon; Alessandro Chiesa; Eylon Yogev
Speaker: Gal Arnon
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation
Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar
Speaker: Peter Manohar
Computational Wiretap Coding from Indistinguishability Obfuscation
Yuval Ishai, Aayush Jain, Paul Lou, Amit Sahai, Mark Zhandry
Speaker: Paul Lou
Approximate Lower Bound Arguments
Pyrros Chaidos, Aggelos Kiayias, Leonid Reyzin, Anatoliy Zinovyev
Speaker: Anatoliy Zinovyev
Perfect Zero-Knowledge PCPs for #P
Nick Spooner, Jack O'Connor, Tom Gur
Speaker: Jack O'Connor
Explicit Codes for Poly-Size Circuits and Functions that are Hard to Sample on Low Entropy Distributions
Ronen Shaltiel, Jad Silbak
Speaker: Jad Silbak
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement
Yanyi Liu, Marshall Ball, Noam Mazor, Rafael Pass
Speaker: Yanyi Liu
From Random Probing to Noisy Leakages Without Field-Size Dependence
Gianluca Brian, Stefan Dziembowski, Sebastian Faust
Speaker: Gianluca Brian
Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel
Meghal Gupta, Rachel Yun Zhang
Speaker: Meghal Gupta
Multi-Instance Randomness Extraction and Security against Bounded-Storage Mass Surveillance
Jiaxin Guan, Daniel Wichs, Mark Zhandry
Speaker: Jiaxin Guan