We propose and realize a definition of security for password-based key exchange within the framework of universally composable (UC) security, thus providing security guarantees under arbitrary composition with other protocols. In addition, our definition captures some aspects of the problem that were not adequately addressed by most prior notions. For instance, it does not assume any underlying probability distribution on passwords, nor does it assume independence between passwords chosen by different parties. We also formulate a definition of password-based secure channels, and show that such a definition is achievable given password-based key exchange. Our protocol realizing the new definition of password-based key exchange is in the common reference string model and relies on standard number-theoretic assumptions. The components of our protocol can be instantiated to give a relatively efficient solution which is conceivably usable in practice. We also show that it is impossible to satisfy our definition in the "plain" model (e.g., without a common reference string). © International Association for Cryptologic Research 2005.
CITATION STYLE
Canetti, R., Halevi, S., Katz, J., Lindell, Y., & MacKenzie, P. (2005). Universally composable password-based key exchange. In Lecture Notes in Computer Science (Vol. 3494, pp. 404–421). Springer Verlag. https://doi.org/10.1007/11426639_24
Mendeley helps you to discover research relevant for your work.