International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2009: Advances in Cryptology – ASIACRYPT 2009 pp 636-652

Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices

  • Jonathan Katz
  • Vinod Vaikuntanathan
Conference paper

DOI: 10.1007/978-3-642-10366-7_37

Volume 5912 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Katz J., Vaikuntanathan V. (2009) Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices. In: Matsui M. (eds) Advances in Cryptology – ASIACRYPT 2009. ASIACRYPT 2009. Lecture Notes in Computer Science, vol 5912. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jonathan Katz
    • 1
  • Vinod Vaikuntanathan
    • 2
  1. 1.University of Maryland 
  2. 2.IBM Research