In this paper, we first formally define some properties for the transform (password hashing) applied to the password for the storage on the server-side, for an efficient VPAKE use. A tight one-wayness is required to prevent improved password searches. We then enhance the Bellare-Pointcheval-Rogaway game-based model for PAKE to VPAKE protocols, in such a way that it allows a VPAKE protocol to be secure in the standard model. In addition, we show how to further extend this model to handle non-uniform and related passwords, both in case of PAKE and VPAKE.
Finally, we propose very efficient constructions of password hashing and \VPAKE protocols, which are nearly as efficient as the best PAKE protocols to date.Category / Keywords: cryptographic protocols / Multi-linear maps, smooth projective hash functions, authentication, key exchange Date: received 9 Dec 2013, last revised 14 Oct 2014 Contact author: fabrice ben hamouda at ens fr Available format(s): PDF | BibTeX Citation Version: 20141014:212038 (All versions of this report) Short URL: ia.cr/2013/833 Discussion forum: Show discussion | Start new discussion