To date, few general frameworks for constructing PAKE protocols in the standard model are known. Here, we abstract and generalize a protocol by Jiang and Gong to give a new methodology for realizing PAKE without random oracles, in the common reference string model. In addition to giving a new approach to the problem, the resulting construction offers several advantages over prior work. We also describe an extension of our protocol that is secure within the universal composability~(UC) framework and, when instantiated using El Gamal encryption, is more efficient than a previous protocol of Canetti et al.
Category / Keywords: cryptographic protocols / password-based key exchange Publication Info: ACM CCCS 2010 Date: received 19 Mar 2010, last revised 22 Jun 2010 Contact author: jkatz at cs umd edu Available formats: PDF | BibTeX Citation Version: 20100622:192646 (All versions of this report) Discussion forum: Show discussion | Start new discussion