Program

 

MONDAY 28 MAY

8:15Registration opens
9:15Welcome
9:30Jesper Buus Nielsen: Meet the LEGO Family  
10:20Satrajit Gosh: Maliciously Secure Oblivious Linear Function Evaluation and its Applications  
10:45Coffee
11:15Sophia Yakoubov: A Novel Approach to Dual Execution for Yao’s Garbled Circuits with Applications to Fuzzy Password-Authenticated Key Exchange  
11:40Sanjam Garg: Identity-Based Encryption from the Diffie-Hellman Assumption  
12:30Lunch
14:00Gilad Asharov: Oblivious Computation with Data Locality
14:50Avishay Yanai: Efficient Maliciously Secure Multiparty Computation for RAM
15:15Coffee
15:45Daniel Demmler: Towards Practical Private Internet Routing using MPC
16:10Tore Frederiksen: Fast Distributed RSA Key Generation for Malicious Adversaries
16:35Eysa Lee: Secure Two-Party Threshold ECDSA from ECDSA Assumptions
17:00End of day

TUESDAY 29 MAY

9:30Peter Scholl: Efficient MPC from Syndrome Decoding (or: Honey, I Shrunk the Keys)
10:20Sabine Oechsner: Computer-aided proofs for multiparty computation with active security
10:45Coffee
11:15Arpita Patra: Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic
11:40Ronald Cramer: New Algebraic Gadgets for Information-Theoretically Secure MPC
12:30Lunch
14:00Geoffroy Couteau: On the Communication Complexity of Multiparty Computation in the Correlated Randomness Model
14:50Daniel Escudero: SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority
15:15Coffee
15:45Antigoni Polychroniadou: Round-Optimal Secure Multi-Party Computation
16:10Akshayaram Srinivasan: Two-Round Multiparty Secure Computation from Minimal Assumptions
16:35Eylon Yogev: Distributed Computing Made Secure: A New Cycle Cover Theorem
17:00Break
17:30Rump Session Part I
18:30Workshop Dinner
19:30Rump Session Part II
20:30Dessert and networking

WEDNESDAY 30 MAY

9:30Nigel Smart: SCALE: A new MPC system from Leuven
10:20Niek J. Bouman: Solving Integer-Valued Linear Systems over the Rationals in Secure Multiparty Computation
10:45Coffee
11:15Vladimir Kolesnikov: SWiM: Secure Wildcard Pattern Matching From OT Extension
11:40Payman Mohassel: New MPC Techniques for Machine Learning
12:30Lunch
14:00Jonathan Katz: Optimizing ZK proofs from secure computation
14:50Berry Schoenmakers: MPyC -- Python Package for Secure Multiparty Computation
15:15Coffee
15:45Chiraag Juvekar: Gazelle: A Low Latency Framework for Secure Neural Network Inference
16:10Nikolaj Volgushev: Conclave: Secure Multi-Party Computation on Big Data
16:35Ran Cohen: Applying Modern Crypto to Advance Social Science
17:00End of day

THURSDAY 31 MAY

9:30Benny Applebaum: On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate
10:20Phillipp Schoppmann: Secure Text Classification in Federated Databases
10:45Coffee
11:15Ariel Nof: Fast Large Scale Honest-Majority MPC for Malicious Adversaries
11:40abhi shelat: Title tba!
12:30Lunch
14:00Carmit Hazay: Arithmetic secure computation for two parties
14:50Mark Simkin: Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings
15:15Coffee
15:45Irene Giacomelli: Privacy-Preserving Regression via Homomorphic Encryption
16:10Adi Akavia: Secure Search via Multi Ring Fully Homomorphic Encryption
16:35Peter Rindal: Fast Private Set Intersection from Fully Homomorphic Encryption
17:00End of workshop - See you next year!

 

 

Scientific Organization

PURE error
The PURE server is currently down.

Administrative Organization

PURE error
The PURE server is currently down.