IACR logo

Eighth IACR Theory of Cryptography Conference

TCC 2011

March 28-30, 2011, Brown University
Providence, Rhode Island, USA


Preliminary Program

(All the talks will be held at MacMillan Hall)

Sunday, March 27

19:00-20:30 Welcome Reception and Registration at Hampton Inn

Monday, March 28

8:00-9:15 Registration

9:15-9:20 Opening Remarks

9:20-10:30 Hardness Amplification (Chair: Shai Halevi)

Input Locality and Hardness Amplification
Andrej Bogdanov; Alon Rosen
General Hardness Amplification of Predicates and Puzzles
Thomas Holenstein; Grant Schoenebeck
Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
Stefano Tessaro

10:30-11:00 Break

11:00-12:00 Invited Talk 1 (Chair: Chris Peikert)

Dense Model Theorems and Their Applications
Luca Trevisan (Stanford University)

12:00-2:00 Lunch at Faculty Club

2:00-3:35 Leakage Resilience (Chair: Melissa Chase)

Parallel Repetition for Leakage Resilience Amplification Revisited
Abhishek Jain; Krzysztof Pietrzak
Achieving Leakage Resilience Through Dual System Encryption
Allison Lewko; Yannis Rouselakis; Brent Waters
Signatures Resilient to Continual Leakage on Memory and Computation
Tal Malkin; Isamu Teranishi; Yevgeniy Vahlis; Moti Yung
After-the-Fact Leakage in Public-Key Encryption
Shai Halevi; Huijia Rachel Lin

3:35-4:05 Break

4:05-5:40 Tamper Resilience (Chair: Guy Rothblum)

One-time Computable Self-Erasing Functions
Stefan Dziembowski; Tomasz Kazana; Daniel Wichs
Perfectly Secure Oblivious RAM Without Random Oracles
Ivan Damgård; Sigurd Meldgaard; Jesper Buus Nielsen
Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
Nico Döttling; Daniel Kraschewski; Jörn Müller-Quade
Correlated-Input Secure Hash Functions
Vipul Goyal; Adam O'Neill; Vanishree Rao

Tuesday, March 29

9:00-10:35 Encryption (Chair: Vadim Lyubashevsky)

Black-Box Circular-Secure Encryption Beyond Affine Functions
Zvika Brakerski; Shafi Goldwasser; Yael Tauman Kalai
Homomorphic Encryption: from Private-Key to Public-Key
Ron Rothblum
Identity-Based Encryption Secure Against Selective Opening Attack
Mihir Bellare; Brent Waters; Scott Yilek
Functional Encryption: Definitions and Challenges
Dan Boneh; Amit Sahai; Brent Waters

10:35-11:05 Break

11:05-12:15 Composable Security (Chair: Boaz Barak)

Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs
Huijia Rachel Lin; Rafael Pass
Round-Optimal Password-Based Authenticated Key Exchange
Jonathan Katz; Vinod Vaikuntanathan
Bringing People of Different Beliefs Together to do UC
Sanjam Garg; Vipul Goyal; Abhishek Jain; Amit Sahai

12:15-2:15 Lunch at Faculty Club

2:15-3:50 Secure Computation (Chair: Manoj Prabhakaran)

Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
Yehuda Lindell; Benny Pinkas
Practical Adaptive Oblivious Transfer from Simple Assumptions
Matthew Green; Susan Hohenberger
Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
Daniel Kraschewski; Jörn Müller-Quade
A Zero-One Law for Secure Multi-Party Computation with Ternary Outputs
Gunnar Kreitz

3:50-4:20 Break

4:20-5:30 Privacy (Chair: Yuval Ishai)

PCPs and the Hardness of Generating Private Synthetic Data
Jonathan Ullman; Salil Vadhan
Limits of Computational Differential Privacy in the Client/Server Setting
Adam Groce; Jonathan Katz; Arkady Yerukhimovich
Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy
Johannes Gehrke; Edward Lui; Rafael Pass

8:00 Business Meeting and Rump Session

Location: MacMillan Hall

Wednesday, March 30

9:00-10:35 Coin Tossing and Pseudorandomness (Chair: Anna Lysyanskaya)

On the Black-Box Complexity of Optimally-Fair Coin Tossing
Dana Dachman-Soled; Yehuda Lindell; Mohammad Mahmoody; Tal Malkin
Tight Bounds for Classical and Quantum Coin Flipping
Esther Hänggi; Jürg Wullschleger
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols
Hemanta K. Maji; Pichayoot Ouppaphan; Manoj Prabhakaran; Mike Rosulek
On Non-Adaptive Pseudo-Random Generator Constructions: Complexity versus Stretch
Joint presentation of: "Limits on the Stretch of Non-Adaptive Constructions of Pseudo-Random Generators," by Josh Bronson, Ali Juma, and Periklis A. Papakonstantinou, and "On the Complexity of Non-Adaptively Increasing the Stretch of Pseudorandom Generators" by Eric Miles and Emanuele Viola

10:35-11:05 Break

11:05-12:05 Invited Talk 2 (Chair: Juan Garay)

Concurrent Security and Non-Malleability
Rafael Pass (Cornell University)

12:05-2:05 Lunch at Faculty Club

2:05-3:15 Black-Box Constructions and Separations (Chair: Vipul Goyal)

(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure Against Selective Opening Attacks
David Xiao
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
Zvika Brakerski; Jonathan Katz; Gil Segev; Arkady Yerukhimovich
Towards Non-Black-Box Lower Bounds in Cryptography
Rafael Pass; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam

3:15-3:35 Break

3:35-4:20 Black-Box Separations (Chair: Mohammad Mahmoody)

On Black-Box Separations among Injective One-Way Functions
Takahiro Matsuda; Kanta Matsuura
Impossibility of Blind Signatures From One-Way Permutations
Jonathan Katz; Dominique Schröder; Arkady Yerukhimovich

4:20 Farewell