Abstract
We describe a public-key encryption scheme based on lattices - specifically, based on the hardness of the learning with error (LWE) problem - that is secure against chosen-ciphertext attacks while admitting (a variant of) smooth projective hashing. This encryption scheme suffices to construct a protocol for password-based authenticated key exchange (PAKE) that can be proven secure based on the LWE assumption in the standard model. We thus obtain the first PAKE protocol whose security relies on a lattice-based assumption. © 2009 Springer-Verlag.
Cite
CITATION STYLE
Katz, J., & Vaikuntanathan, V. (2009). Smooth projective hashing and password-based authenticated key exchange from lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5912 LNCS, pp. 636–652). https://doi.org/10.1007/978-3-642-10366-7_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.