Program
Saturday, March 14
18:00-21:00 Registration
19:00-21:00 Welcome reception, Crystal room
Sunday, March 15
8:00-9:00 Registration
9:00-10:40 Session 1 (Chair: Omer Reingold)
|
|
An Optimally Fair Coin Toss
|
Tal Moran; Moni Naor; Gil Segev
|
|
Complete Fairness in Multi-Party Computation Without an Honest Majority
|
S. Dov Gordon; Jonathan Katz
|
|
Fairness with an Honest Minority and a Rational Majority
|
Shien Jin Ong; David Parkes; Alon Rosen; Salil Vadhan
|
|
Purely Rational Secret Sharing
|
Silvio Micali; abhi shelat
10:40-11:10 Coffee Break
11:10-12:10 Invited Talk 1 (Chair: Daniele Micciancio)
|
|
Some Recent Progress in Lattice-Based
Cryptography
[abstract] |
Chris Peikert (SRI
International)
12:10-2:15 Lunch
2:15-3:30 Session 2 (Chair: Daniele Micciancio)
|
|
Non-Malleable Obfuscation
|
Ran Canetti; Mayank Varia
|
|
Simulation-Based Concurrent Non-Malleable Commitments and Decommitments
|
Rafail Ostrovsky; Giuseppe Persiano; Ivan Visconti
|
|
Proofs of Retrievability via Hardness Amplification
|
Yevgeniy Dodis; Salil Vadhan; Daniel Wichs
3:30-4:00 Coffee Break
4:00-5:15 Session 3 (Chair: Omer Reingold)
|
|
Security amplification for interactive cryptographic primitives
|
Yevgeniy Dodis; Russell Impagliazzo; Ragesh Jaiswal; Valentine Kabanets
|
|
Composability and On-Line Deniability of Authentication
|
Yevgeniy Dodis; Jonathan Katz; Adam Smith; Shabsi Walfish
|
|
Authenticated Adversarial Routing
|
Yair Amir; Paul Bunn; Rafail Ostrovsky
Monday, March 16
9:00-10:15 Session 4 (Chair: Manoj M Prabhakaran)
|
|
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
|
Yehuda Lindell; Hila Zarosim
|
|
On the (Im)Possibility of Key Dependent Encryption
|
Iftach Haitner; Thomas Holenstein
|
|
On the (Im)Possibility of Arthur-Merlin Witness Hiding
Protocols
|
Iftach Haitner; Alon Rosen; Ronen Shaltiel
10:15-10:45 Coffee Break
10:45-12:05 Session 5 (Chair: Thomas Holenstein)
|
|
Secure Computability of Functions in the IT setting with Dishonest Majority and Applications to Long-Term Security
|
Robin Kunzler; Jorn Muller-Quade; Dominik Raub
|
|
Complexity of Multi-party Computation Problems: The Case of
2-Party Symmetric Secure Function Evaluation
|
Hemanta Maji; Manoj Prabhakaran; Mike Rosulek
|
|
Realistic Failures in Secure Multi-Party Computation
|
Vassilis Zikas; Sarah Hauser; Ueli Maurer
|
|
Secure Arithmetic Computation with No Honest Majority
|
Yuval Ishai; Manoj Prabhakaran; Amit Sahai
12:05-2:15 Lunch
2:15-3:30 Session 6 (Chair: Matthew Franklin)
|
|
Universally Composable Multiparty Computation with Partially Isolated Parties
|
Ivan Damgard; Jesper Buus Nielsen; Daniel Wichs
|
|
Oblivious Transfer from Weak Noisy Channels
|
Jurg Wullschleger
|
|
Composing Quantum Protocols in a Classical Environment
|
Serge Fehr; Christian Schaffner
3:30-4:00 Coffee Break
4:00-5:15 Session 7 (Chair: Yuval Ishai)
|
|
LEGO for Two Party Secure Computation
|
Jesper Buus Nielsen; Claudio Orlandi
|
|
Simple, Black-Box Constructions of Adaptively Secure Protocols
|
Seung Geol Choi; Dana Dachman-Soled; Tal Malkin; Hoeteck Wee
|
|
Black-Box Constructions of Two-Party Protocols from One-Way Functions
|
Rafael Pass; Hoeteck Wee
8:00 Business Meeting and Rump Session (Chair: Rafael Pass)
Location: Crystal Room (reception starts at 7:30pm)
Tuesday, March 17
9:00-10:40 Session 8 (Chair: Thomas Holenstein)
|
|
Chosen-Ciphertext Security via Correlated Products
|
Alon Rosen; Gil Segev
|
|
Hierarchical Identity Based Encryption with Polynomially Many Levels
|
Craig Gentry; Shai Halevi
|
|
Predicate Privacy in Encryption Systems
|
Emily Shen; Elaine Shi; Brent Waters
|
|
Simultaneous Hardcore Bits and Cryptography Against Memory
Attacks
|
Adi Akavia; Shafi Goldwasser; Vinod Vaikuntanathan
10:40-11:10 Coffee Break
11:10-12:10 Invited Talk 2 (Chair: Ivan Damgard)
|
|
The Differential Privacy Frontier
[abstract] |
Cynthia Dwork
(Microsoft Research)
12:10-2:15 Lunch
2:15-3:30 Session 9 (Chair: Ivan Damgard)
|
|
How Efficient can Memory Checking be?
|
Cynthia Dwork; Moni Naor; Guy N. Rothblum ; Vinod Vaikuntanathan
|
|
Goldreich's One-Way Function Candidate and Myopic
Backtracking Algorithms
|
James Cook; Omid Etesami; Rachel Miller; Luca Trevisan
|
|
Secret Sharing and Non-Shannon Information Inequalities
|
Amos Beimel; Ilan Orlov
3:30-4:00 Coffee Break
4:00-5:15 Session 10 (Chair: Manoj M Prabhakaran)
|
|
Weak Verifiable Random Functions
|
Zvika Brakerski; Shafi Goldwasser; Guy N. Rothblum; Vinod Vaikuntanathan
|
|
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
|
Stanislaw Jarecki; Xiaomin Liu
|
|
Towards a Theory of Extractable Functions
|
Ran Canetti; Ronny Ramzi Dakdouk