Conference on Information-Theoretic Cryptography (ITC)


In Cooperation With

ITC 2021: Program


ITC 2021 will take place virtually on Zoom on July 24-26, 2021. All times below are in Eastern Daylight Time.

Registered attendees will receive links to access the zoom webinar prior to the beginning of the conference. You can register here. You can also access a youtube livestream by clicking on the links next to the session names. However, only use them in case you are not able to use zoom access.

Pre-recorded talks are linked below, as well as the proceedings articles. You can also access all videos as a playlist and the complete proceedings are available here.


Saturday, July 24

9:00 - 9:10Opening Remarks (Daniele Venturi and Stefano Tessaro) [Stream]
9:10 - 9:35Session I: Multiparty Computation (Session chair: Elette Boyle) [Stream]
  1. 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)
    [Paper] [Video]
  2. More Communication Lower Bounds for Information-Theoretic MPC
    Ivan Bjerre Damgård (Aarhus University), Boyang Li, and Nikolaj Ignatieff Schwartzbach (Aarhus University)
    [Paper] [Video]
09:40 - 10:40Spotlight Talk I (Session chair: Elette Boyle) [Stream]
Benny Applebaum (Tel Aviv University)
The Round Complexity of Unconditionally-Secure MPC and Completeness under Non-Interactive Reductions
10:40 - 11:10Break
11:10 - 11:55Session II: Proofs (Session chair: Mohammad Mahmoody) [Stream]
  1. On Prover-Efficient Public-Coin Emulation of Interactive Proofs
    Gal Arnon (Weizmann Institute of Science) and Guy N. Rothblum (Weizmann Institute of Science)
    [Paper] [Video]
  2. On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs
    Benny Applebaum (Tel Aviv University) and Eyal Golombek (Tel Aviv University)
    [Paper] [Video]
  3. Line-Point Zero Knowledge and Its Applications
    Samuel Dittmer (Stealth Software Technologies, Inc), Yuval Ishai (Technion), and Rafail Ostrovsky (University of California, Los Angeles)
    [Paper] [Video]
  4. ZK-PCPs from Leakage-Resilient Secret Sharing
    Carmit Hazay (Bar-Ilan University), Muthuramakrishnan Venkitasubramaniam (University of Rochester), and Mor Weiss (Bar-Ilan University)
    [Paper] [Video]
11:55 - 12:30Session III: Obliviousness and Anonymity (Session chair: Rachel Lin) [Stream]
  1. Secure Merge with O(n log log n) Secure Operations
    Brett Falk (UPenn) and Rafail Ostrovsky (UCLA)
    [Paper] [Video]
  2. Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions
    T-H. Hubert Chan (HKU), Elaine Shi (CMU), Wei-Kai Lin (Cornell), and Kartik Nayak (Duke)
    [Paper] [Video]
  3. On the Complexity of Anonymous Communication Through Public Networks
    Megumi Ando (MITRE), Anna Lysyanskaya (Brown University), and Eli Upfal (Brown University)
    [Paper] [Video]
12:30 - 12:45Break
12:45 - 13:45Spotlight Talk II (Session chair: Rachel Lin) [Stream]
Elaine Shi (CMU)
Sorting Circuits for Small Keys and Optimal Oblivious RAM


Sunday, July 25

9:00 - 9:35Session IV: Secret Sharing (Session chair: Ignacio Cascudo) [Stream]
  1. Broadcast Secret-Sharing, Bounds and Applications
    Ivan Damgård (Aarhus University), Kasper Green Larsen (Aarhus University), and Sophia Yakoubov (Aarhus University)
    [Paper] [Video]
  2. 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)
    [Paper] [Video]
  3. Linear Threshold Secret-Sharing with Binary Reconstruction
    Marshall Ball (University of Washington), Alper Çakan (Bogazici University), and Tal Malkin (Columbia University)
    [Paper]
9:40 - 10:40Spotlight Talk III (Session chair: Eyal Kushilevitz) [Stream]
Irit Dinur (Weizmann Institute of Science)
Expanders and Local Testability
10:40 - 11:10Break
11:10 - 11:45Session V: Randomness Extraction (Session chair: Marshall Ball) [Stream]
  1. Doubly-Affine Extractors, and their Applications
    Yevgeniy Dodis (New York University) and Kevin Yeo (Google and Columbia University)
    [Paper] [Video]
  2. 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)
    [Paper] [Video]
  3. Code Offset in the Exponent
    Luke Demarest (University of Connecticut), Benjamin Fuller (University of Connecticut), and Alexander Russell (University of Connecticut)
    [Paper] [Video]
11:45 - 12:10Session VI: Foundations (Session chair: Mark Bun) [Stream]
  1. 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)
    [Paper] [Video]
  2. Replacing Probability Distributions in Security Games via Hellinger Distance
    Kenji Yasunaga (Osaka University)
    [Paper] [Video]
12:10 - 12:35Session VII: Differential Privacy (Session chair: Uri Stemmer) [Stream]
  1. Differentially Private Approximations of a Convex Hull in Low Dimensions
    Yue Gao (University of Alberta) and Or Sheffet (Bar-Ilan University)
    [Paper] [Video]
  2. 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)
    [Paper] [Video]
12:35 - 12:45Break
12:45 - 13:45Spotlight Talk IV (Session chair: Sidharth Jaggi) [Stream]
Salman Avestimehr (University of Southern California)
Secure Model Aggregation in Federated Learning


Monday, July 26

9:00 - 9:35Session VIII: (Post-)Quantum Cryptography (Session chair: Kai-Min Chung) [Stream]
  1. Communication Complexity of Private Simultaneous Quantum Messages Protocols
    Akinori Kawachi (Mie University) and Harumichi Nishimura (Nagoya University)
    [Paper] [Video]
  2. 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)
    [Paper] [Video]
  3. 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)
    [Paper] [Video]
9:40 - 10:40Spotlight Talk V (Session chair: Mary Wootters) [Stream]
Matthieu Bloch (Georgia Institute of Technology)
Information-Theoretic Covert Communications: Limits and Algorithms
10:40 - 11:10Break
11:10 - 11:55Session IX: Applications & Lower Bounds (Session chair: Stefano Tessaro) [Stream]
  1. 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)
    [Paper] [Video]
  2. 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)
    [Paper] [Video]
  3. Post-compromise Security in Self-Encryption
    Gwangbae Choi (Fasoo), F. Betül Durak (Robert Bosch LLC), and Serge Vaudenay (EPFL)
    [Paper] [Video]
  4. Generic-Group Identity-Based Encryption: A Tight Impossibility Result
    Gili Schul-Ganz (Hebrew University of Jerusalem) and Gil Segev (Hebrew University of Jerusalem)
    [Paper] [Video]
11:55 - 12:15Break
12:15 - 13:15Spotlight Talk VI (Session chair: Fang Song) [Stream]
Mark Zhandry (Princeton University and NTT Research)
How to Record Quantum Queries, and Applications to Quantum Indifferentiability
13:20 - 13:30Concluding Remarks (Daniele Venturi and Stefano Tessaro)