Conference on Information-Theoretic Cryptography (ITC)

ITC 2023: Program

(All times are in Central European Summer Time: UTC+2)

Location: All talks are held at the Peter Bøgh Andersen auditorium (building 5335, room 016).

Remote attendance: Zoom link.
Preliminary proceedings: link.

Monday, June 5

19:00 – 21:00Pre-conference Social Dinner: Aarhus Street Food (Google Maps)

Tuesday, June 6

8:45 – 9:00Opening Remarks
9:00 – 10:30Session I: Secret Sharing (Chair: Amos Beimel)
  1. Randomness recoverable secret sharing schemes
    Mohammad Hajiabadi, Shahram Khazaei and Behzad Vahdani
  2. Weighted Secret Sharing from Wiretap Channels
    Fabrice Benhamouda, Shai Halevi and Lev Stambler
  3. Csirmaz’s Duality Conjecture and Threshold Secret Sharing
    Andrej Bogdanov
10:30 – 11:00Break
11:00 – 12:00Spotlight Talk I (Chair: Amos Beimel)
Ivan Damgård (Aarhus University): on the history of information-theoretic MPC
12:00 – 13:00Lunch
13:00 – 14:00Spotlight Talk II (Chair: Ivan Damgård)
Sidharth Jaggi (University of Bristol): Communication in the presence of adversarial jamming: The curious case of the erasure channel
Alice wishes to communicate with Bob, but the malicious jammer James wishes to stop this communication from occurring. What can she do? In this talk I’ll explore recent discoveries/capacity-characterizations in a variety of settings (the role of causality in James’ jamming, the role of myopicity in his observations, the interplay between these two, and the effect of rate-limited feedback). I’ll focus on one of the simplest non-trivial jamming channels—the case of a binary input channel, in which James may erase a constant fraction of transmissions—even here, interesting phenomena occur. Time permitting, I may also briefly describe generalizations to other jamming channels/scenarios.
14:00 - 14:30Break
14:30 – 16:00Session II: Secure communication and MPC (Chair: Sidharth Jaggi)
  1. Secure Communication in Dynamic Incomplete Networks
    Ivan Damgård, Divya Ravi, Daniel Tschudi and Sophia Yakoubov
  2. Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate
    Chen Yuan and Nicolas Resch
  3. Exponential Correlated Randomness is Necessary in Communication-Optimal Perfectly Secure Two-Party Computation
    Keitaro Hiwatashi and Koji Nuida
16:00 –Self-guided visit to ARoS Museum (Google Maps)

Wednesday, June 7

9:00 – 10:30Session III: MPC (Chair: Ron Rothblum)
  1. Asymmetric Multi-Party Computation
    Vipul Goyal, Chen-Da Liu-Zhang and Rafail Ostrovsky
  2. Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks
    Ivan Damgård, Daniel Escudero and Antigoni Polychroniadou
  3. MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More
    Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky and Divya Ravi
10:30 – 11:00Break
11:00 – 12:00Spotlight Talk III (Chair: Kai-Min Chung)
Mohammad Mahmoody (University of Virginia): On Data Poisoning: Connections to Cryptography and Search for Tight Bounds
In this talk, I will present results from a series of works on the power and limitation of data poisoning attacks (mostly in the so-called targeted setting). I will first discuss how to use tools from cryptographic attacks on collective coin flipping to boost an attack's power. I will then discuss methods to provably bound the power of the attacker and achieve tight bounds.

Based on papers from SODA'20, TCC'21, UAI’21, and NeurIPS’22 (with Omid Etesami, Ji Gao, Saeed Mahloujifar, Amin Karbasi, Steve Hanneke, Idan Mehalel, and Shay Moran).
12:00 – 13:00Lunch
13:00 – 14:00Spotlight Talk IV (Chair: Claudio Orlandi)
Geoffroy Couteau (CNRS): on correlated pseudorandomness
14:00 – 14:30Break
14:30 – 16:00Session IV: Quantum, Merger, and Differential Privacy (Chair: Siyao Guo)
  1. Differentially Private Aggregation via Imperfect Shuffling
    Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson and Samson Zhou
  2. Online Mergers and Applications to (Optimal) Accumulators and Registration-Based Encryption
    Mohammad Mahmoody and Wei Qi
  3. Quantum security of subset cover problems
    Samuel Bouaziz-Ermann, Alex Bredariol Grilo and Damien Vergnaud
18:30 – 20:00Drinks and Conference Dinner: Chemistry canteen (Google Maps)

Thursday, June 8

9:00 – 10:30Session V: Lower Bounds (Chair: Anat Paskin-Cherniavsky)
  1. A Lower Bound on the Share Size in Evolving Secret Sharing
    Noam Mazor
  2. Lower-Bounds for Secret-Sharing Schemes for k-Hypergraphs
    Amos Beimel
  3. The Cost of Statistical Security in Proofs for Repeated Squaring
    Cody Freitag and Ilan Komargodski
10:30 – 11:00Break
11:00 – 12:00Spotlight Talk V (Chair: Anat Paskin-Cherniavsky)
Siyao Guo (NYU Shanghai): Time-Space Tradeoffs for Function Inversion
In function inversion, we are given a function from n bits to n bits, and want to prepare some advice of size S, such that we can efficiently invert any image in time T. Function inversion is a central task in cryptography with profound connections to data structures, communication complexity, and circuit lower bounds. In this talk, I will describe recent progress in obtaining tight time-space bounds for function inversion and its related problems.
12:00 – 13:00Lunch
13:00 – 14:00Spotlight Talk VI (Chair: Divesh Aggarwal)
Ron Rothblum (Technion): Proving as Fast as Computing
Succinct arguments allow a prover to convince a verifier that a given statement is true, using an extremely short proof. A major bottleneck that has been the focus of a large body of work is in reducing the overhead incurred by the prover in order to prove correctness of the computation. In the talk I will describe methods which allow one to prove correctness with nearly optimal asymptotic overhead.
14:00 – 14:30Break
14:30 – 16:00Session VI: NM Codes, Shuffler and Learning (Chair: Divesh Aggarwal)
  1. Distributed Shuffling in Adversarial Environments
    Kasper Green Larsen, Maciej Obremski and Mark Simkin
  2. Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting
    Nils Fleischhacker, Suparno Ghoshal and Mark Simkin
  3. Locally Covert Learning of Fourier-Sparse Functions
    Justin Holmgren and Ruta Jawale
16:00 – 20:00TPMPC 2023 Rump Session and Dinner (Registration for TPMPC 2023 required)

Friday, June 9

9:00 – 16:00TPMPC 2023 Workshop: Program (Registration for TPMPC 2023 required)