BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:A History of Lattice-Based Encryption Schemes
DTSTART:20120606T110000
DTEND:20120606T120000
DTSTAMP:20260924T095028Z
UID:303eeaf54b903977322e0a63751bfb8a57b9810ee4a9d9e01083de41
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dr. Vadim Lyubashevsky\, Ecole Normale Superieure\, Paris\, Fr
 ance\nAbstact:\nLattice-based cryptography can trace its roots back to the
  early attempts by researchers to create encryption schemes based on the h
 ardness of the knapsack problem. In this talk\, I will describe today's v
 arious encryption schemes based on lattices and show the way that they "sh
 ould have" evolved starting from knapsacks. The talk will cover the NTRU 
 cryptosystem (Hoffstein\, Pipher\, Silverman 1998)\, Regev's LWE cryptosch
 eme (Regev 2005)\, the recent simple scheme based on Subset Sum (Lyubashev
 sky\, Palacio\, Segev 2010)\, the provably-secure and practical Ring-LWE s
 cheme (Lyubashevsky\, Peikert\, and Regev 2010)\, and a provably-secure mo
 dification of the NTRU scheme (Stehle\, Steinfeld 2011).\n\nBio:\nVadim Ly
 ubashevsky obtained his Ph.D. in Computer Science from the University of C
 alifornia\, San Diego in 2008. He is currently an INRIA researcher and a m
 ember of the CASCADE cryptography team at ENS Paris. His research mostly f
 ocuses on building efficient\, provably secure cryptographic schemes based
  on the hardness of lattice problems. He has co-authored numerous article
 s in international conferences\, among which are the currently most-effici
 ent lattice-based signature and encryption schemes that possess a proof of
  security. 
LOCATION:BC 01 https://plan.epfl.ch/?room==BC%2001
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR