CIS Seminar
Speaker: Brent Waters , Stanford Research Institute
Date: January 18 2008
Time: 10:30AM to 12:00PM
Location: 32-G449 Patil/Kiva, Stata Ctr
Contact: Be Blackburn, 3-6098, imbe@mit.edu
Relevant URL:
In this talk I'll introduce a new general primitive called lossy
trapdoor functions (lossy TDFs). Using lossy TDFs, I'll show new
approaches for constructing many important cryptographic primitives,
including standard trapdoor functions, CCA-secure cryptosystems,
collision-resistant hash functions, and more. All of our
constructions are simple, efficient, and black-box.
In addition, I'll describe how to realize lossy TDFs under number
theoretic assumptions, including hardness of the decisional
Diffie-Hellman (DDH) problem and the worst-case hardness of standard
lattice problems. Taken all together, these results resolve some
long-standing open problems in cryptography. They give the first
known (injective) trapdoor functions based on problems not directly
related to integer factorization, and provide the first known CCA-secure cryptosystem based solely on worst-case lattice assumptions.
Authors: Chris Peikert and Brent Waters
See other events that are part of Cryptography and Information Security Seminars 2007/2008
See other events happening in January 2008
