Distributed Smooth Projective Hashing and Its Application to Two-Server Password Authenticated Key Exchange
Smooth projective hash functions have been used as building block for various cryptographic applications, in particular for password-based authentication.
In this work we propose the extended concept of distributed smooth projective hash functions where the computation of the hash value is distributed across n parties and show how to instantiate the underlying approach for languages consisting of Cramer-Shoup ciphertexts.
As an application of distributed smooth projective hashing we build a new framework for the design of two-server password authenticated key exchange protocols, which we believe can help to “explain” the design of earlier two-server password authenticated key exchange protocols.
KeywordsSmooth Projective Hash Functions Two-Server PAKE
- 5.Benhamouda, F., Blazy, O., Chevalier, C., Pointcheval, D., Vergnaud, D.: New Smooth Projective Hash Functions and One-Round Authenticated Key Exchange. Cryptology ePrint Archive, Report 2013/034 (2013), http://eprint.iacr.org/
- 8.Brainard, J., Juels, A.: A new two-server approach for authentication with short secrets. In: USENIX 2003. SSYM 2003, vol. 12, p. 14. USENIX Association (2003)Google Scholar
- 19.Wu, T.: RFC 2945 - The SRP Authentication and Key Exchange System (September 2000)Google Scholar