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. © 2014 Springer International Publishing.
CITATION STYLE
Kiefer, F., & Manulis, M. (2014). Distributed smooth projective hashing and its application to two-server password authenticated key exchange. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8479 LNCS, pp. 199–216). Springer Verlag. https://doi.org/10.1007/978-3-319-07536-5_13
Mendeley helps you to discover research relevant for your work.