Abstract
Password-authenticated key exchange (PAKE) is where a client and a server, who share a password, authenticate each other and meanwhile establish a cryptographic key by exchange of messages. In this setting, all the passwords necessary to authenticate clients are stored in a single server. If the server is compromised, due to, for example, hacking or even insider attack, passwords stored in the server are all disclosed. In this paper, we consider a scenario where two servers cooperate to authenticate a client and if one server is compromised, the attacker still cannot pretend to be the client with the information from the compromised server. Current solutions for two-server PAKE are either symmetric in the sense that two peer servers equally contribute to the authentication or asymmetric in the sense that one server authenticates the client with the help of another server. This paper presents a symmetric solution for two-server PAKE, where the client can establish different cryptographic keys with the two servers, respectively. Our protocol runs in parallel and is more efficient than existing symmetric two-server PAKE protocol, and even more efficient than existing asymmetric two-server PAKE protocols in terms of parallel computation.
Original language | English |
---|---|
Article number | 6311402 |
Pages (from-to) | 1773-1782 |
Number of pages | 10 |
Journal | IEEE Transactions on Parallel and Distributed Systems |
Volume | 24 |
Issue number | 9 |
DOIs | |
Publication status | Published - 2013 |
Keywords
- dictionary attack
- Diffie-Hellman key exchange
- ElGamal encryption
- Password-authenticated key exchange