Program

Tuesday, March 18

19:00-21:00 Welcome reception

Location: 13th floor of Warren Weaver Hall

Wednesday, March 19

8:00-9:00 Registration

9:00-9:50 Session 1 (Chair: Ran Canetti)

Incrementally Verifiable Computation or Knowledge Implies Time/Space Efficiency
Paul Valiant (MIT)

On Seed-Incompressible Functions
Shai Halevi (IBM Research), Steven Myers (Indiana U), and Charles Rackoff (U. of Toronto)

9:50-10:40 Session 2 (Chair: Ueli Maurer)

Asymptotically Efficient Lattice-Based Digital Signatures
Vadim Lyubashevsky (UCSD) and Daniele Micciancio (UCSD)

Basing weak public-key cryptography on strong one-way functions
Eli Biham (Technion), Yaron Goren (Technion) and Yuval Ishai (Technion)

10:40-11:10 Coffee Break

11:10-12:25 Session 3 (Chair: Boaz Barak)

Which Languages have 4-Round Zero-Knowledge Proofs?
Jonathan Katz (U Maryland)

How to Achieve Perfect Simulation
Lior Malka (U Victoria)

General Properties of Quantum Zero-Knowledge Proofsa
Hirotada Kobayashi (Nat'l. Inst. Informatics)

12:25-2:15 Lunch

2:15-3:55 Session 4 (Chair: Jens Groth)

Layered Specifications, Design and Analysis of Security Protocols
Amir Herzberg (Bar Ilan) and Igal Yoffe (Bar Ilan)

Universally Composable Multi-Party Computation with an Unreliable Common Reference String
Vipul Goyal (UCLA) and Jonathan Katz (U Maryland)

Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
Carmit Hazay (Bar Ilan) and Yehuda Lindell (Bar Ilan)

Fast Private Norm Estimation and Heavy Hitters
Joe Kilian (Rutgers), Andre Madeira (Rutgers), Martin J. Strauss (U Michigan) and Xuan Zheng (U Michigan)

3:55-4:25 Coffee Break

4:25-5:40 Session 5 (Chair: Eyal Kushilevitz)

Matroids Can Be Far From Ideal Secret Sharing
Amos Beimel (Ben Gurion), Noam Livne (Weizmann) and Carles Padro (U Catalunya)

Perfectly-Secure MPC with Linear Communication Complexity
Zuzana Beerliova-Trubiniova (ETH) and Martin Hirt (ETH)

MPC vs. SFE: Perfect Security in a Unified Corruption Model
Zuzana Beerliova-Trubiniova (ETH),Matthias Fitzi (ETH), Martin Hirt (ETH), Ueli Maurer (ETH) and Vassilis Zikas (ETH)

---

Thursday, March 20

9:00-10:00 Invited Talk 1 (Chair: Moni Naor)

A Survey of Game-Theoretic Approaches for the Design and Analysis of Protocols
Jonathan Katz (U Maryland)

10:00-10:30 Coffee Break

10:30-11:45 Session 6 (Chair: abhi shelat)

Verifiably Secure Devices
Sergei Izmalkov (MIT), Matt Lepinski (BBN) and Silvio Micali (MIT)

Lower Bounds on Implementing Robust and Resilient Mediators
Ittai Abraham (Hebrew U), Danny Dolev (Hebrew U) and Joe Halpern (Cornell)

Cryptography and Game Theory: Designing Protocols for Exchanging Information
Gillat Kol (Weizmann) and Moni Naor (Weizmann)

11:50-12:50 Position Statements (Moderator: Tal Rabin)

Game Theory and Cryptography --- Towards a Joint Point of View?
Panlists: Jonathan Katz (U Maryland), Silvio Micali (MIT), Moni Naor (Weizmann)

12:50-2:30 Lunch

2:30-3:20 Session 7 (Chair: Adriana Palacio)

Equivocal Blind Signatures and Adaptive UC-Security
Aggelos Kiayias (U Conneticut) and Hong-Sheng Zhou (U Conneticut)

Non-interactive anonymous credentials
Mira Belenkiy (Brown), Melissa Chase (Brown) and Markulf Kohlweiss (Brown) and Anna Lysyanskaya (Brown)

3:20-3:50 Coffee Break

3:50-5:30 Session 8 (Chair: Chris Peikert)

Multi-Property Preserving Combiners for Hash Functions
Marc Fischlin (Darmstadt U. Tech.) and Anja Lehmann (Darmstadt U. Tech.)

OT-Combiners via Secure Computation
Danny Harnik (IBM Research), Yuval Ishai (Technion), Eyal Kushilevitz (Technion) and Jesper Buus (Aarhus U) Nielsen

Semi-Honest to Malicious Oblivious Transfer - The Black-Box Way
Iftach Haitner (Weizmann)

Black-box Construction of a Non-Malleable Encryption Scheme from Any Semantically Secure One
Seung Geol Choi (Columbia), Dana Dachman-Soled (Columbia), Tal Malkin (Columbia) and Hoeteck Wee (Columbia)

8:00-10:00 Business Meeting and Rump Session (Chair: Anna Lysyanskaya)

For details check here.

---

Friday, March 21

9:00-10:30 Invited Talk 2 (Chair: Tatsuaki Okamoto)

Randomness Extractors and their Cryptographic Applications
Salil Vadhan (Harvard)

10:30-11:00 Coffee Break

11:00-11:50 Session 9 (Chair: Hoeteck Wee)

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Iftach Haitner (Weizmann), Jonathan J. Hoch (Weizmann) and Gil Segev (Weizmann)

Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker
Serge Fehr (CWI) and Christian Schaffner (CWI)

11:50-12:40 Session 10 (Chair: Hoeteck Wee)

An Equivalence between Zero Knowledge and Commitments
Shien Jin Ong (Harvard) and Salil Vadhan (Harvard)

Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
Andre Chailloux (LRI), Dragos Florin Ciocan (Harvard), Iordanis Kerenidis (U Paris-Sud) and Salil Vadhan (Harvard)

12:40-2:30 Lunch

2:30-3:20 Session 11 (Chair: Marc Fischlin)

The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
Daniele Micciancio (UCSD) and Scott Yilek (UCSD)

On Constant-Round Concurrent Zero-Knowledge
Rafael Pass (Cornell) and Muthuramakrishnan Venkitasubramaniam (Cornell)

3:20-3:50 Coffee Break

3:50-4:40 Session 12 (Chair: Yevgeniy Dodis)

Concurrent Non-Malleable Commitments from One-way Functions
Huijia Lin (Cornell), Rafael Pass (Cornell) and Muthuramakrishnan Venkitasubramaniam (Cornell)

Faster and Shorter Password-Authenticated Key Exchange
Rosario Gennaro (IBM Research)

4:40-5:30 Session 13 (Chair: Russell Impagliazzo)

Saving Private Randomness in One-Way Functions and Pseudorandom Generators
Nenad Dedic (BU), Danny Harnik (IBM Research) and Leonid Reyzin (BU)

Degradation and Amplification of Computational Hardness
Shai Halevi (IBM Research) and Tal Rabin (IBM Research)