Paper 2013/588

SPHF-Friendly Non-Interactive Commitments

Michel Abdalla, Fabrice Benhamouda, Olivier Blazy, Céline Chevalier, and David Pointcheval


In 2009, Abdalla et al. proposed a reasonably practical password-authenticated key exchange (PAKE) secure against adaptive adversaries in the universal composability (UC) framework. It exploited the Canetti-Fischlin methodology for commitments and the Cramer-Shoup smooth projective hash functions (SPHFs), following the Gennaro-Lindell approach for PAKE. In this paper, we revisit the notion of non-interactive commitments, with a new formalism that implies UC security. In addition, we provide a quite efficient instantiation. We then extend our formalism to SPHF-friendly commitments. We thereafter show that it allows a blackbox application to one-round PAKE and oblivious transfer (OT), still secure in the UC framework against adaptive adversaries, assuming reliable erasures and a single global common reference string, even for multiple sessions. Our instantiations are more efficient than the Abdalla et al. PAKE in Crypto 2009 and the recent OT protocol proposed by Choi~et al. in PKC 2013. Furthermore, the new PAKE instantiation is the first one-round scheme achieving UC security against adaptive adversaries.

Note: 2014-02-17: This version provides a more detailed description of our PAKE scheme and its proof. In particular, we describe an additional property of our SPHF-friendly commitment scheme, called strong pseudo-randomness, which is required for the security proof of our PAKE scheme.

Available format(s)
Cryptographic protocols
Publication info
A major revision of an IACR publication in ASIACRYPT 2013
CommitmentUniversal ComposabilityPassword AuthenticationOblivious TransferSmooth Projective Hashing
Contact author(s)
fabrice ben hamouda @ ens fr
2014-02-17: last of 2 revisions
2013-09-14: received
See all versions
Short URL
Creative Commons Attribution


      author = {Michel Abdalla and Fabrice Benhamouda and Olivier Blazy and Céline Chevalier and David Pointcheval},
      title = {SPHF-Friendly Non-Interactive Commitments},
      howpublished = {Cryptology ePrint Archive, Paper 2013/588},
      year = {2013},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.