Cryptology ePrint Archive: Report 2017/838

Two-Round PAKE from Approximate SPH and Instantiations from Lattices

Jiang Zhang and Yu Yu

Abstract: Password-based authenticated key exchange (PAKE) enables two users with shared low-entropy passwords to establish cryptographically strong session keys over insecure networks. At Asiacrypt 2009, Katz and Vaikuntanathan showed a generic three-round PAKE based on any CCA-secure PKE with associated approximate smooth projective hashing (ASPH), which helps to obtain the first PAKE from lattices. In this paper, we give a framework for constructing PAKE from CCA-secure PKE with associated ASPH, which uses only two-round messages by carefully exploiting a splittable property of the underlying PKE and its associated non-adaptive ASPH. We also give a splittable PKE with associated non-adaptive ASPH based on the LWE assumption, which finally allows to instantiate our two-round PAKE framework from lattices.

Category / Keywords: cryptographic protocols /

Original Publication (with major differences): IACR-ASIACRYPT-2017

Date: received 29 Aug 2017, last revised 31 Aug 2017

Contact author: jiangzhang09 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170901:174013 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]