By Topic

Efficient Password-Based Authenticated Key Exchange from Lattices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yi Ding ; Sch. of Inf. Security Eng., Shanghai Jiao Tong Univ., Shanghai, China ; Lei Fan

Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. One must ensure that protocols are immune to off-line dictionary attacks in which an adversary exhaustively enumerates all possible passwords in an attempt to determine the correct one. Recently Katz, et al. [6] gave a new framework for realizing PAKE without random oracles, in the common reference string model. In this paper, we instantiate the framework of [6] under the lattices assumptions. Specifically, we modified the lattice-based approximate projective hashing introduced in [11] and plug it into the framework of [6], and we prove our new PAKE is efficient and secure based on the security of GK's PAKE framework [6] in the standard model.

Published in:

Computational Intelligence and Security (CIS), 2011 Seventh International Conference on

Date of Conference:

3-4 Dec. 2011