Pre-Workshop Tutorials
1:00pm-2:30pm: Vinod Vaikuntanathan (IBM):Basic tools in lattice-based cryptography
2:30pm-2:45pm: Refreshments
2:45pm-4:15pm: Vinod Vaikuntanathan (IBM):Basic tools in lattice-based cryptography (Continued)
4:1pm-5:15pm: Shai Halevi (IBM): Cryptosystems from unique-shortest-vector lattices: Techniques from the Ajtai-Dwork'97 and the Regev'03 cryptosystems. slides
5:3pm-6:30pm: Vadim Lyubashevsky(TAU): An ideal version of Vinod and Shai slides
9:00am-9:45am: Craig Gentry (IBM): Developments in Homomorphic Encryption
9:45am-10:30am: Shai Halevi (IBM): Circular-Secure Encryption from Decisional Diffie-Hellman slides
10:30am-11:00am: Refreshments
11:00am-11:45am: Benny Apple baum (Princeton): Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems slides
11:45am-12:15pm: Vadim Lubashevsky (TAU): On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem slides
12:15pm-1:45pm: Catered Lunch in 32-G882 (for invited participants)
1:45pm-2:30pm: Brent Waters (Austin): Functional Encryption: An Overview and Survey slides
2:30pm-3:00pm: Melissa Chase (MSR): Patient Privacy in Electronic Medical Records
3:00pm-3:30pm: Seny Kamara (MSR): Private Data Stuctures
3:30pm-4:00pm: Refreshments
4:00pm-4:30pm Susan Hohenberger (JHU): Short and Stateless Signatures from the RSA Assumption slides
4:30pm-5:30pm: Salil Vadhan (Harvard): Extractors and their cryptographic applications slides
9:00am-9:45am: Krzysztof Pietrzak (CWI): Survey on Different Leakage Models, Krzysztof Pietrzak slides
9:45am-10:30am: Moni Naor (Weizmann): Public-Key Encryption Resilient to Key Leakage slides
10:30am-11:00am: Refreshments
11:00am-11:45am: Vinod Vaikunatanathan (IBM): Signature Schemes with Bounded Leakage Resilience slides
11:45am-12:30pm: Yevgeniy Dodis (NYU): Leakage in the Bounded Retrieval Model slides
12:30pm-2:00pm: Catered Lunch in 32-G882 (for invited participants)
2:00pm-2:20pm: Krzysztof Pietrzak (CWI): On leakage-resilient pseudorandom functions slides
2:20pm-2:45pm: Yael Kalai (MSR): Encryption Secure Against Auxiliary Input
2:45pm-3:30pm: Eran Tromer (MIT): Protecting Circuits from Computationally-Bounded Leakage slides
3:30pm-3:55pm: Iftach Haitner (MSR) On the Impossibility of Key-Dependent Encryption slides
3:55pm-4:15pm: Refreshments
4:15pm-5:00pm: Amit Sahai (UCLA): Extracting Correlations
5:00pm-5:30pm: Rafael Pass (Cornell): Non-Malleability Amplification
Ron Rivest: The "Taint" Leakage Model slides
Guy Rothblum
Yael Kalai: Two Source Extractors
Daniel Wichs: Leakage in the Bounded Retrieval Model slides
Tal Malkin: Efficient and Robust Private Set Intersection and multipary multivariate polynomials slides
Mike Rosulek: Reconciling Non-malleability & Homomorphic Encryption slides
Vipul Goyal: On the Round Complexity of Covert Computation slides
Iftach Haitner: Parallel repetition for any Interactive Argument
Zvika Brakerski
Mayank Varia: Obfuscating Hyperplanes
9:00am-9:45am: Guy Rothblum (IAS): Delegating Computation
9:45am-10:05am: Bryan Parno (CMU): Non-Interactive Verifiable Computation slides
10:05am-10:35am: Refreshments
10:35am-10:55am: Alina Oprea (RSA): HAIL: A High-Availability and Integrity Layer for Cloud Storage slides
10:55am-11:35am: Adi Akavia (IAS): Solving Hidden Number Problem with One Bit Oracle and Advice
11:35am-12:20pm Vipul Goyal (UCLA): Unconditional One Time Programs and beyond slides
12:20pm-12:30pm: Christopher J. Raney (ONR): Cloud Computing Security Challenges for the Navy
12:30pm-2:00pm: Lunch (on your own)
2:00pm-2:45pm: Eran Tromer (MIT): Architectural Side Channels in Cloud Computing slides
2:45pm-3:30pm: Moni Naor (Weizmann): On Recycling Encryption Schemes or Achieving Resistance to Cache Attacks via Low Bandwidth Encryption slides
3:30pm-4:00pm: Refreshments
4:00pm-4:15pm: Hoetek Wee (CUNY): Trapdoor Permutations Revisited
4:15pm-4:45pm: Brett Hemenway (UCLA): Lossy Encryption from General Assumptions slides
4:45pm-5:15pm: Nishanth Chandran (UCLA): Position Based Cryptography slides