In Cooperation With
ITC 2022: Accepted Papers
Multi-Server PIR with Full Error Detection and Limited Error Correction
Reo Eriguchi (The University of Tokyo/AIST), Kaoru Kurosawa (Chuo University/AIST) and Koji Nuida (Kyushu University/AIST)
Property-Preserving Hash Functions and Combinatorial Group Testing
Kazuhiko Minematsu (NEC/Yokohama National University)
Protecting Distributed Primitives against Leakage: Equivocal Secret Sharing and More
Carmit Hazay (Bar-Ilan University), Muthuramakrishnan Venkitasubramaniam (Georgetown University) and Mor Weiss (Bar-Ilan University)
Maliciously Circuit-Private FHE from Information-Theoretic Principles
Jesko Dujmovic (CISPA) and Nico Döttling (CISPA)
From Privacy-Only to Simulatable OT: Black-Box,Round-Optimal, Information-theoretic
Varun Madathil (North Carolina State University), Chris Orsini (North Carolina State University), Alessandra Scafuro (North Carolina State University) and Daniele Venturi (Sapienza University of Rome)
On The Distributed Discrete Logarithm Problem with Preprocessing
Pavel Hubáček (Charles University), Ľubica Jančová (Charles University) and Veronika Králová (Charles University)
A Note on the Complexity of Private Simultaneous Messages with Many Parties
Marshall Ball (New York University) and Tim Randolph (Columbia University)
Multiparty Computation with Covert Security and Public Verifiability
Peter Scholl (Aarhus University), Mark Simkin (Ethereum) and Luisa Siniscalchi (Aarhus University)
On Seedless PRNGs and Premature Next
Sandro Coretti (IOHK), Yevgeniy Dodis (New York University), Harish Karthikeyan (New York University), Noah Stephens-Davidowitz (Cornell University) and Stefano Tessaro (University of Washington)
Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC
Saikrishna Badrinarayanan (Snap Inc), Yuval Ishai (Technion), Dakshita Khurana (UIUC), Amit Sahai (UCLA) and Daniel Wichs (Northeastern University)
Revisiting Collision and Local Opening Analysis of ABR Hash
Chandranan Dhar (Indian Statistical Institute), Yevgeniy Dodis (New York University) and Mridul Nandi (Indian Statistical Institute).
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff
Lior Rotem (Hebrew University of Jerusalem) and Gil Segev (Hebrew University of Jerusalem)
Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups
Lior Rotem (Hebrew University of Jerusalem)
Universally Composable Almost-Everywhere Secure Computation
Nishanth Chandran (Microsoft Research), Pouyan Forghani (Texas A&M University), Juan Garay (Texas A&M University), Rafail Ostrovsky (UCLA), Rutvik Patel (Texas A&M University) and Vassilis Zikas (Purdue University)
Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW
Gilad Asharov (Bar-Ilan University), Ran Cohen (Reichman University) and Oren Shochat (Bar-Ilan University)
Tight Estimate of the Local Leakage Resilience of the Additive Secret-sharing Scheme & its Consequences
Hemanta K. Maji (Purdue University), Hai H. Nguyen (Purdue University), Anat Paskin-Cherniavsky (Ariel University), Tom Suad (Ariel University), Mingyuan Wang (University of California, Berkeley), Xiuyu Ye (Purdue University) and Albert Yu (Purdue University)
Information-Theoretic Distributed Point Functions
Elette Boyle (IDC Herzliya), Niv Gilboa (Ben-Gurion University), Yuval Ishai (Technion) and Victor Kolobov (Technion)