A History of Lattice-Based Encryption Schemes
Event details
| Date | 06.06.2012 |
| Hour | 11:00 › 12:00 |
| Speaker | Dr. Vadim Lyubashevsky, Ecole Normale Superieure, Paris, France |
| Location | |
| Category | Conferences - Seminars |
Abstact:
Lattice-based cryptography can trace its roots back to the early attempts by researchers to create encryption schemes based on the hardness of the knapsack problem. In this talk, I will describe today's various encryption schemes based on lattices and show the way that they "should have" evolved starting from knapsacks. The talk will cover the NTRU cryptosystem (Hoffstein, Pipher, Silverman 1998), Regev's LWE cryptoscheme (Regev 2005), the recent simple scheme based on Subset Sum (Lyubashevsky, Palacio, Segev 2010), the provably-secure and practical Ring-LWE scheme (Lyubashevsky, Peikert, and Regev 2010), and a provably-secure modification of the NTRU scheme (Stehle, Steinfeld 2011).
Bio:
Vadim Lyubashevsky obtained his Ph.D. in Computer Science from the University of California, San Diego in 2008. He is currently an INRIA researcher and a member of the CASCADE cryptography team at ENS Paris. His research mostly focuses on building efficient, provably secure cryptographic schemes based on the hardness of lattice problems. He has co-authored numerous articles in international conferences, among which are the currently most-efficient lattice-based signature and encryption schemes that possess a proof of security.
Lattice-based cryptography can trace its roots back to the early attempts by researchers to create encryption schemes based on the hardness of the knapsack problem. In this talk, I will describe today's various encryption schemes based on lattices and show the way that they "should have" evolved starting from knapsacks. The talk will cover the NTRU cryptosystem (Hoffstein, Pipher, Silverman 1998), Regev's LWE cryptoscheme (Regev 2005), the recent simple scheme based on Subset Sum (Lyubashevsky, Palacio, Segev 2010), the provably-secure and practical Ring-LWE scheme (Lyubashevsky, Peikert, and Regev 2010), and a provably-secure modification of the NTRU scheme (Stehle, Steinfeld 2011).
Bio:
Vadim Lyubashevsky obtained his Ph.D. in Computer Science from the University of California, San Diego in 2008. He is currently an INRIA researcher and a member of the CASCADE cryptography team at ENS Paris. His research mostly focuses on building efficient, provably secure cryptographic schemes based on the hardness of lattice problems. He has co-authored numerous articles in international conferences, among which are the currently most-efficient lattice-based signature and encryption schemes that possess a proof of security.
Links
Practical information
- General public
- Free
Organizer
- SuRI 2012
Contact
- Simone Muller