A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
New Techniques for SPHFs and Efficient One-Round PAKE Protocols
[chapter]
2013
Lecture Notes in Computer Science
Password-authenticated key exchange (PAKE) protocols allow two players to agree on a shared high entropy secret key, that depends on their own passwords only. Following the Gennaro and Lindell's approach, with a new kind of smooth-projective hash functions (SPHFs), Katz and Vaikuntanathan recently came up with the first concrete one-round PAKE protocols, where the two players just have to send simultaneous flows to each other. The first one is secure in the Bellare-Pointcheval-Rogaway (BPR)
doi:10.1007/978-3-642-40041-4_25
fatcat:nj2nvocbxrhhpl7gpijhc6ezmy