Program

 

 

MONDAY 28 MAY

8:15Registration opens
9:15Welcome
9:30Jesper Buus Nielsen: Meet the LEGO Family  
10:20 Ariel Nof: Fast Large Scale Honest-Majority MPC for Malicious Adversaries   
Revisit talk 1 & 2 by Jesper Buus Nielsen & Ariel Nof
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  
Revisit talk 3 & 4 by Sophia Yakoubov & Sanjam Garg
12:30Lunch
14:00Gilad Asharov: Oblivious Computation with Data Locality
14:50Avishay Yanai: Efficient Maliciously Secure Multiparty Computation for RAM
Revisit talk 5 & 6 by Glad Asharov & Avishay Yanai
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

Revisit talk 7, 8 & 9 by Daniel Demmler, Tore Frederiksen & Eysa Lee

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
Revisit talk 1 & 2 by Peter Scholl & Sabine Oechsner
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
Revisit talk 3 & 4 by Arpita Patra & Ronald Cramer
12:30Lunch
14:00

Muthuramakrishnan Venkitasubramaniam: Ligero: Lightweight Zero Knowledge Argument

14:25Carmit Hazay:  Arithmetic secure computation for two parties
Revisit talk 5 & 6 by Muthuramakrishnan Venkitasubramaniam & Carmit Hazay
15:15Coffee
15:45Antigoni Polychroniadou: Round-Optimal Secure Multi-Party Computation
16:10

Daniel Escudero: SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority

16:35Dragos Rotaru: MPC across the wire: There is something you require
Revisit talk 7, 8 & 9 by Antigoni Polychroniadou, Daniel Escudero & Dragos Rotaru
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 (via Skype)
10:20Niek J. Bouman: Solving Integer-Valued Linear Systems over the Rationals in Secure Multiparty Computation
Revisit talk 1 & 2 by Nigel Smart & Nick J. Bouman (Talk by Nigel Smart to appear later)
10:45Coffee
11:15Vladimir Kolesnikov: SWiM: Secure Wildcard Pattern Matching From OT Extension
11:40Payman Mohassel: New MPC Techniques for Machine Learning
Revisit talk 3 & 4 by Vladimir Kolesnikov & Peyman Mohassel
12:30Lunch
14:00Jonathan Katz: Optimizing ZK proofs from secure computation
14:50Berry Schoenmakers: MPyC -- Python Package for Secure Multiparty Computation
Revisit talk 5 & 6 by Jonathan Katz & Berry Schoenmakers
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
Revisit talk 7, 8 & 9 by Ciraag Juvekar, Nikolaj Volgushev & Ran Cohen
17:00End of day

 

THURSDAY 31 MAY

9:30Benny Applebaum: Perfect Secure Computation in Two Rounds
10:20Phillipp Schoppmann: Secure Text Classification in Federated Databases
Revisit talk 1 & 2 by Benny Applebaum & Phillipp Schoppmann
10:45Coffee
11:15 Satrajit Ghosh: Maliciously Secure Oblivious Linear Function Evaluation and its Applications 
11:40abhi shelat: Doubly efficient ZKSNARK without setup assumptions    
Revisit talk 3 & 4 by Satrajit Ghosh & abhi shelat
12:30Lunch
14:00 Geoffroy Couteau: On the Communication Complexity of Multiparty Computation in the Correlated Randomness Model
14:50Mark Simkin: Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings
Revisit talk 5 & 6 by Geoffroy Couteau & Mark Simkin
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
Revisit talk 7, 8 & 9 by Irene Giacomelli, Adi Akavia & Peter Rindal
17:00End of workshop - See you next year!

 

 

Scientific Organization

Ivan Bjerre Damgård

Professor
M
H bldg. 5335, 277
P +4587156258
P +4520837137

Claudio Orlandi

Associate professor
M
H bldg. 5335, 282
P +4587156193
P +4521433249

Administrative Organization