Cryptology ePrint Archive: Report 2015/1144

Mitigating Server Breaches in Password-Based Authentication: Secure and Efficient Solutions

Olivier Blazy and CÚline Chevalier and Damien Vergnaud

Abstract: Password-Authenticated Key Exchange allows users to generate a strong cryptographic key based on a shared \human-memorable" password without requiring a public-key infrastructure. It is one of the most widely used and fundamental cryptographic primitives. Unfortunately, mass password theft from organizations is continually in the news and, even if passwords are salted and hashed, brute force breaking of password hashing is usually very successful in practice. In this paper, we propose two ecient protocols where the password database is somehow shared among two servers (or more), and authentication requires a distributed computation involving the client and the servers. In this scenario, even if a server compromise is doable, the secret exposure is not valuable to the adversary since it reveals only a share of the password database and does not permit to brute force guess a password without further interactions with the parties for each guess. Our protocols rely on smooth projective hash functions and are proven secure under classical assumption in the standard model (i.e. do not require idealized assumption, such as random oracles).

Category / Keywords: Cryptographic Protocols / Password-Authenticated Key Exchange, Distributed Computation, Decision Diffie-Hellman, Smooth Projective Hashing

Original Publication (with major differences): CT-RSA 2016

Date: received 26 Nov 2015, last revised 27 Nov 2015

Contact author: olivier blazy at unilim fr

Available format(s): PDF | BibTeX Citation

Version: 20151127:183436 (All versions of this report)

Short URL: ia.cr/2015/1144

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]