• Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

–
Coffee and Check-In
–
Opening Remarks
–
Fully Homomorphic Encryption and Signatures

Daniel Wichs, Northeastern University,
Zvika Brakerski, Weizmann Institute
Video
–
Fully Homomorphic Encryption and Signatures

Daniel Wichs, Northeastern University,
Zvika Brakerski, Weizmann Institute
Video
–
Break
–
Attribute-Based and Predicate Encryption

Vinod Vaikuntanathan, Massachusetts Institute of Technology,
Hoeteck Wee, École Normale Supérieure Paris
Video
–
Attribute-Based and Predicate Encryption

Vinod Vaikuntanathan, Massachusetts Institute of Technology,
Hoeteck Wee, École Normale Supérieure Paris
Video
–
Lunch
–
Historical Talk on Lattice-Based Cryptography

Daniele Micciancio, UC San Diego
Video
–
Reception
–
Coffee and Check-In
–
Cryptography from Ideal Lattices [and Discussion]

Damien Stehlé, École Normale Supérieure de Lyon
Video
–
Break
–
Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling

Noah Stephens-Davidowitz, New York University,
Daniel ,
Dadush, CWI, Amsterdam
Video
–
Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling

Noah Stephens-Davidowitz, New York University,
Daniel ,
Dadush, CWI, Amsterdam
Video
–
Lunch
–
Algebraic Algorithms for LWE

Ludovic Perret, Université Pierre et Marie Curie
Video
–
Attacks on Ring-LWE

Kristin Lauter, ,
Microsoft Research Redmond
Video
–
Break
–
How Diffie-Hellman Fails in Practice

Nadia Heninger, University of Pennsylvania 
Video
–
Coffee and Check-In
–
Arithmetic Cryptography

Benny Applebaum, Tel Aviv University
Video
–
Break
–
Time-Lock Puzzles from Randomized Encodings

Nir Bitansky (Massachusetts Institute of Technology)
Video
–
Output-Compressing Randomized Encodings and Applications

Huijia Lin (University of Washington)
Video
–
Lunch
–
Somewhat Homomorphic Encryption via Number Fields and Finite Fields

Jeff Hoffstein, Brown University
–
Efficient RKA-Secure KEM Scheme Against Invertible Functions

Keita Xagawa,
, NTT Secure Platform Laboratories
–
Break
–
TESLA: Tightly Secure, Efficient Signature Scheme from Standard Lattices

Nina Bindel, Technische Universität Darmstadt
–
An Improved BKW Algorithm for LWE

Paul Kirchner, École Normale Supérieure Paris and UC San Diego
–
The Preprocessing of Lattice Point Enumeration

Michael Walter, UC San Diego
–
Coffee and Check-In
–
Noisy Connections: A Survey of Interactive Coding and Its Borders with Other Topics

Allison Bishop, Columbia University
Video
–
Break
–
Non-Malleable Codes in the Split-State Model

Yevgeniy Dodis, New York University
Video
–
Lunch
–
Finding Short Generators of Principal Ideals

Chris Peikert (Georgia Institute of Technology),
Georgia Institute of Technology
Video
–
Lattices with Symmetry

Alice Silverberg, ,
University of California, Irvine
Video
–
Coffee and Check-In
–
Graph-Induced Multilinear Maps from Lattices

Shai Halevi, IBM T.J. Watson Research Center
Video
–
Break
–
Multilinear Maps Over the Integers: From Design to Security

Tancrède Lepoint, CryptoExperts
Video
–
Discussion on Multilinear Maps, Assumptions and Attacks
–
Lunch
–
Cryptography via Burnside Groups

Antonio Nicolosi, Stevens Institute of Technology,
Nelly Fazio, City University of New York
Video