In Cooperation With
ITC 2021: Accepted Papers
-
Broadcast Secret-Sharing, Bounds and Applications
Ivan Damgård (Aarhus University), Kasper Green Larsen (Aarhus University), and Sophia Yakoubov (Aarhus University) Code Offset in the Exponent
Luke Demarest (University of Connecticut), Benjamin Fuller (University of Connecticut), and Alexander Russell (University of Connecticut) Communication Complexity of Private Simultaneous Quantum Messages Protocols
Akinori Kawachi (Mie University) and Harumichi Nishimura (Nagoya University) Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms
Shumo Chu (UCSB), Danyang Zhuo (Duke), Elaine Shi (CMU), and T-H. Hubert Chan (HKU) Differentially Private Approximations of a Convex Hull in Low Dimensions
Yue Gao (University of Alberta) and Or Sheffet (Bar-Ilan University) Doubly-Affine Extractors, and their Applications
Yevgeniy Dodis (New York University) and Kevin Yeo (Google and Columbia University) Fooling an Unbounded Adversary with a Short Key, Repeatedly: the Honey Encryption Perspective
Xinze Li (Tsinghua University), Qiang Tang (The University of Sydney), and Zhenfeng Zhang (Institute of Software, Chinese Academy of Sciences) Generic-Group Identity-Based Encryption: A Tight Impossibility Result
Gili Schul-Ganz (Hebrew University of Jerusalem) and Gil Segev (Hebrew University of Jerusalem) Group Structure in Correlations and its Applications in Cryptography
Guru-Vamsi Policharla (Indian Institute of Technology, Bombay), Manoj Prabhakaran (Indian Institute of Technology, Bombay), Rajeev Raghunath (Indian Institute of Technology, Bombay), and Parjanya Vyas (Indian Institute of Technology, Bombay) Linear Threshold Secret-Sharing with Binary Reconstruction
Marshall Ball (University of Washington), Alper Çakan (Bogazici University), and Tal Malkin (Columbia University) Line-Point Zero Knowledge and Its Applications
Samuel Dittmer (Stealth Software Technologies, Inc), Yuval Ishai (Technion), and Rafail Ostrovsky (University of California, Los Angeles) Locally Reconstructable Non-malleable Secret Sharing
Bhavana Kanukurthi (Indian Institute of Science, Bangalore), Sai Lakshmi Bhavana Obbattu (Microsoft Research, Bangalore), Sruthi Sekar (Indian Institute of Science, Bangalore), and Jenit Tomy (Indian Institute of Science, Bangalore) More Communication Lower Bounds for Information-Theoretic MPC
Ivan Bjerre Damgård (Aarhus University), Boyang Li, and Nikolaj Ignatieff Schwartzbach (Aarhus University) On Prover-Efficient Public-Coin Emulation of Interactive Proofs
Gal Arnon (Weizmann Institute of Science) and Guy N. Rothblum (Weizmann Institute of Science) On the Complexity of Anonymous Communication Through Public Networks
Megumi Ando (MITRE), Anna Lysyanskaya (Brown University), and Eli Upfal (Brown University) On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs
Benny Applebaum (Tel Aviv University) and Eyal Golombek (Tel Aviv University) On the Security of Proofs of Sequential Work in a Post-Quantum World
Jeremiah Blocki (Purdue), Seunghoon Lee (Purdue), and Samson Zhou (Carnegie Mellon University) Online Linear Extractors for Independent Sources
Yevgeniy Dodis (New York University), Siyao Guo (New York University Shanghai), Noah Stephens-Davidowitz (Cornell University), and Zhiye Xie (New York University Shanghai) P4 Partition and Cover Numbers & Applications
Alexander R. Block (Purdue University), Simina Branzei (Purdue University), Hemanta K. Maji (Purdue University), Himanshi Mehta (Purdue University), Tamalika Mukherjee (Purdue University), and Hai H. Nguyen (Purdue University) Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions
T-H. Hubert Chan (HKU), Elaine Shi (CMU), Wei-Kai Lin (Cornell), and Kartik Nayak (Duke) Post-compromise Security in Self-Encryption
Gwangbae Choi (Fasoo), F. Betül Durak (Robert Bosch LLC), and Serge Vaudenay (EPFL) Quantum-Access Security of the Winternitz One-Time Signature Scheme
Christian Majenz (CWI & QuSoft), Chanelle Matadah Manfouo (AIMS & Quantum Leap Africa), and Maris Ozols (University of Amsterdam & QuSoft) Replacing Probability Distributions in Security Games via Hellinger Distance
Kenji Yasunaga (Osaka University) Secure Merge with O(n log log n) Secure Operations
Brett Falk (UPenn) and Rafail Ostrovsky (UCLA) T5: Hashing Five Inputs with Three Compression Calls
Yevgeniy Dodis (New York University), Dmitry Khovratovich (Ethereum Foundation and Dusk Network), Nicky Mouha (Strativia), and Mridul Nandi (Indian Statistical Institute) ZK-PCPs from Leakage-Resilient Secret Sharing
Carmit Hazay (Bar-Ilan University), Muthuramakrishnan Venkitasubramaniam (University of Rochester), and Mor Weiss (Bar-Ilan University)