SPHF-Friendly Non-Interactive Commitments

Download Now
Provided by: International Association for Cryptologic Research
Topic: Security
Format: PDF
In 2009, the author 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, the authors revisit the notion of non-interactive commitments, with a new formalism that implies UC security. In addition, they provide a quite efficient instantiation. They then extend their formalism to SPHF-friendly commitments.
Download Now

Find By Topic