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.
Category / Keywords: cryptographic protocols / smooth projective hashing, two-server PAKE Original Publication (with major differences): 12th International Conference on Applied Cryptography and Network Security (ACNS '14) Date: received 19 May 2014 Contact author: f kiefer at surrey ac uk Available format(s): PDF | BibTeX Citation Version: 20140519:163705 (All versions of this report) Short URL: ia.cr/2014/350 Discussion forum: Show discussion | Start new discussion