In Cooperation With
ITC 2020: Accepted Papers
-
Separating Local & Shuffled Differential Privacy via Histograms
Victor Balcer (Harvard), Albert Cheu (Northeastern) d-Multiplicative Secret Sharing for Multipartite Adversary Structures
Reo Eriguchi (The University of Tokyo), Noboru Kunihiro (University of Tsukuba) Efficient MPC with a Mixed Adversary
Martin Hirt, Marta Mularczyk (ETH Zurich) Practical Relativistic Zero-Knowledge for NP
Claude Crépeau (McGill University), Arnaud Massenet (University of Oxford), Louis Salvail (Université de Montréal), Lucas Stinchcombe (Bloomberg L.P.), Nan Yang (Concordia University) Use your Brain! Arithmetic 3PC For Any Modulus with Active Security
Hendrik Eerikson (Cybernetica AS), Marcel Keller (CSIRO's Data61), Claudio Orlandi (Aarhus University), Pille Pullonen (Cybernetica AS), Joonas Puura (University of Tartu), Mark Simkin (Aarhus University) Expander Graphs are Non-Malleable Codes
Peter M. R. Rasmussen (University of Copenhagen), Amit Sahai (UCLA) Leakage-Resilient Secret Sharing in Non-compartmentalized Models
Fuchun Lin (Imperial College London), Mahdi Cheraghchi (University of Michigan), Venkatesan Guruswami (Carnegie Mellon University), Reihaneh Safavi-Naini (University of Calgary), Huaxiong Wang (Nanyang Technological University) Lower Bounds for Function Inversion with Quantum Advice
Kai-Min Chung (Academia Sinica), Tai-Ning Liao (National Taiwan University), Luowen Qian (Boston University) Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery
Moni Naor (Weizmann Institute of Science), Lior Rotem (Hebrew University of Jerusalem), Gil Segev (Hebrew University of Jerusalem) Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective
Gil Segev, Ido Shahaf (Hebrew University of Jerusalem) Oblivious Parallel Tight Compaction
Gilad Asharov (Bar-Ilan University), Ilan Komargodski (NTT Research), Wei-Kai Lin (Cornell University), Enoch Peserico (Università degli Studi di Padova), Elaine Shi (Cornell University) On Polynomial Secret Sharing Schemes
Anat Paskin-Cherniavsky (Ariel University), Artiom Radune (The Open University and Ariel University) One-One Constrained Pseudorandom Functions
Naty Peter (Ben-Gurion University of the Negev), Rotem Tsabary (Weizmann Institute of Science), Hoeteck Wee (CNRS, ENS and PSL) The power of synergy in differential privacy: Combining a small curator with local randomizers
Amos Beimel (Ben-Gurion University), Aleksandra Korolova (University of Southern California); Kobbi Nissim (Georgetown University), Or Sheffet (Bar-Ilan University); Uri Stemmer (Ben-Gurion University and Google Research) Pure Differentially Private Summation from Anonymous Messages
Badih Ghazi(Google Research), Noah Golowich (MIT & Google Research), Ravi Kumar (Google Research), Pasin Manurangsi (Google Research), Rasmus Pagh (BARC, IT University of Copenhagen & Google Research), Ameya Velingke (Google Research) On Locally Decodable Codes in Resource Bounded Channels
Jeremiah Blocki, Shubhang Kulkarni and Samson Zhou (Purdue).