top of page
April 27-29, 2018
Hacienda Forest View Hotel
Ma'alot-Tarshiha, Israel
Program
Session I (Friday, April 27)
14:00
Eli Ben-Sasson (Technion)
Scalable, Transparent and Post-Quantum Secure Computational Integrity
Break
14:45
Jens Groth (University College London)
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability
15:00
15:45
Break
17:00
Moni Naor (Weizmann Institute)
White-Box vs. Black-Box Search Problems: A Cryptographic Perspective
16:45
Break
Yevgeniy Dodis (NYU)
Small-Box Cryptography and the Provable Security of SPNs
16:00
11:30
Rafael Pass (Cornell University & Cornell Tech)
Paradoxes in Computer-Aided Decision Making
Break
11:15
10:30
Yael Kalai (Microsoft Research)
Succinct Proofs for Non-Deterministic Computations
10:15
Break
09:30
Session II (Saturday, April 28)
Ueli Maurer (ETH Zurich)
Reduction-less Cryptography
17:00
Nikolaos Makriyannis (TAU) Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Differentially Private Sampling
Break
17:45
Vinod Vaikuntanathan (MIT)
Secret Sharing and CDS
18:00
Break
16:45
16:00
Eike Kiltz (Ruhr-Universität Bochum)
Memory-Tight Reductions
15:45
Break
15:00
Session III (Saturday, April 28)
Shai Halevi (IBM Research)
Best Possible Information-Theoretic MPC
bottom of page