Conference on Information-Theoretic Cryptography (ITC)

ITC 2020

June 17-19, 2020

Due to Covid19, the conference will be entirely virtual

The first Information-Theoretic Cryptography (ITC) conference will take place on June 17-19, 2020. ITC is a new conference dedicated to all information-theoretic aspects of cryptography, broadly defined. See the charter for more information.

Covid19 Update: Due to COVID-19, ITC 2020 is moving online to an entirely virtual format. There will be a live program as well as longer pre-recorded talks for the accepted papers. Details below:

  • The live online program will take place via a Zoom webinar and will consist of:
    • Accepted paper sessions: Authors of accepted papers give brief (5-8 minute) presentations of their work followed by a moderated discussion with questions from the virtual audience.
    • Invited talks: We have 6 invited talks representing some of the greatest hits results in information-theoretic cryptography from the last few years.
  • Pre-recorded talks for each accepted paper will be made available online prior to the conference start. The talks will contain a 20-25 minute self-contained overview of the main results, optionally followed by a longer technical deep dive.
  • Registration is free but required for virtual attendance and only registered participants will receive a link to the zoom webinar. Thanks to generous sponsorship from Microsoft, registration is entirely free!
We look forward to seeing you online in June


Fill this form to register. We will send out information about the logistics of attendance (Zoom links and so on) by Monday, June 15. You must register to receive the Zoom links!

If you have any questions, please contact Katherine D’Angelo at


The open-access proceedings are published by LIPiCS, and available here.


We are deeply grateful to a donation from Microsoft Research that covered the entire cost of the virtual ITC event, including the publication fees.

Social Media

Talking about ITC 2020 on social media? Tag your post with #itcrypto2020 .


ITC 2020 will take place virtually on Zoom on June 17-19, 2020. All times below are in Eastern Daylight Time (i.e. Boston / Montreal time).

Talk Recordings

Talks from ITC, both precorded and live, will be made available in the playlist 2020 Information-Theoretic Cryptography on the Youtube page for BU's Hariri Institute for Computing. Prerecorded talks are linked below; sessions will be streamed live, and videos will be linked below as they become available.

Wednesday, June 17

9:00 - 9:10Opening Remarks
9:10 - 10:00Session 1: Privacy (session chairs: Jon Ullman and Hemanta Maji) [Live Recording]
  1. Separating Local and Shuffled Differential Privacy via Histograms
    Victor Balcer (Harvard), Albert Cheu (Northeastern) [Talk]
  2. 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) [Talk]
  3. 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) [Talk]
10:00 - 10:15Break
10:15 - 11:30Invited Talk (chair: Stefano Tessaro) [Live Recording]
Learning Fast Requires Good Memory: Time-Space Tradeoff Lower Bounds for Learning and Applications to Bounded Storage Cryptography
Ran Raz (Princeton)
11:30 - 11:45Break
11:45 - 12:45Session 2: Foundations (chairs: Iftach Haitner and Mohammad Hajiabadi) [Live Recording]
  1. Lower Bounds for Function Inversion with Quantum Advice
    Kai-Min Chung (Academia Sinica), Tai-Ning Liao (National Taiwan University), Luowen Qian (Boston University) [Talk]
  2. 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) [Talk]
  3. 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) [Talk]
  4. 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) [Talk]
12:45 - 13:00Break
13:00 - 14:15Invited Talk (chair: Mary Wootters) [Live Recording]
Exploring Interference Alignment through the lens of Private Information Retrieval
Syed A. Jafar (UC Irvine)

Thursday, June 18

9:00 - 10:15Session 3: Secret Sharing and Codes (chairs: Siyao Guo and Mahdi Cheraghchi) [Live Recording]
  1. d-Multiplicative Secret Sharing for Multipartite Adversary Structures
    Reo Eriguchi (The University of Tokyo), Noboru Kunihiro (University of Tsukuba) [Talk]
  2. 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) [Talk]
  3. On Polynomial Secret Sharing Schemes
    Anat Paskin-Cherniavsky (Ariel University), Artiom Radune (The Open University and Ariel University) [Talk]
  4. On Locally Decodable Codes in Resource Bounded Channels
    Jeremiah Blocki, Shubhang Kulkarni and Samson Zhou (Purdue) [Talk]
  5. Expander Graphs are Non-Malleable Codes
    Peter M. R. Rasmussen (University of Copenhagen), Amit Sahai (UCLA) [Talk]
10:15 - 10:30Break
10:30 - 11:45Invited Talk (chair: Amos Beimel)
Breaking Barriers in Secret Sharing
Vinod Vaikuntanathan (MIT)
[Live Recording]
11:45 - 12:00Break
12 - 13:15Invited Talk (chair: Stefan Dziembowski) [Live Recording]
Non-Malleable Codes: From Split-State to Local to AC0
Dana Dachman-Soled (University of Maryland)

Friday, June 19

9:00 - 10:15Invited Talk (chair: Shweta Agrawal)
Interactive Error Correcting Codes and the Surprising Power of Adaptivity
Gillat Kol (Princeton)
[Live Recording]
10:15 - 10:30Break
10:30 - 11:30Session 4: Multiparty Computation and Interactive Proofs (chairs: Serge Fehr and Jesper Buus Nielsen)
[Live Recording]
  1. Efficient MPC with a Mixed Adversary
    Martin Hirt, Marta Mularczyk (ETH Zurich) [Talk]
  2. 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) [Talk]
  3. 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) [Talk]
  4. Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective
    Gil Segev, Ido Shahaf (Hebrew University of Jerusalem) [Talk]
11:30 - 11:45Break
11:45 - 13:00Invited Talk (chair: Yael Kalai)
Anand Natarajan (Caltech)
[Live Recording]


The ITC 2020 team is tremendously grateful to Microsoft for a donation that covered the costs of making ITC2020 virtual as well as to Katherine D'Angelo, Erica Seymour and Marika Swanberg of BU's Hariri Institute for their help.