DocumentCode :
1825589
Title :
An optimal round two-party password-authenticated key agreement protocol
Author :
Strangio, Maurizio A.
Author_Institution :
Dept. of Comput. Sci., Syst. & Production, Rome Univ., Italy
fYear :
2006
fDate :
20-22 April 2006
Abstract :
Key agreement protocols constitute one of the most valuable cryptographic primitives since they allow two (or more) users to setup a private and authenticated communication channel over a public network. This paper is concerned with key agreement protocols in the symmetric trust model, wherein the shared key is a password. This setting is very appealing from the user´s perspective since two parties, in principle, can easily agree on a shared password beforehand (e.g. on the telephone). However, designing such protocols represents an interesting challenge since there is no standard way of choosing a password that achieves an optimum trade-off between usability and security. Indeed, passwords belonging to a highly structured language (including PINs personal identification numbers) are essentially equivalent to low entropy strings. A fundamental goal is that of obtaining secure and efficient protocols, with optimum computational complexity, round complexity and communication efficiency. These properties make them ideal candidates for mobile devices. We present a new construction (DH-BPAKE) based on the encrypted key exchange protocol of Bellovin and Merritt augmented with an efficient key confirmation round. The communication model is asynchronous, meaning that each party can simultaneously send a message to the other party. In addition, we formally prove security in a modified version of the model of Boyko et al. (which is based on the model of Shoup).
Keywords :
computational complexity; cryptography; message authentication; protocols; telecommunication channels; communication efficiency; cryptographic primitives; key exchange protocol; mobile devices; optimal round two-party password-authenticated key agreement protocol; optimum computational complexity; personal identification number; private communication channel; public network; round complexity; structured language; symmetric trust model; Communication channels; Computational complexity; Cryptographic protocols; Cryptography; Entropy; Mobile communication; Pins; Security; Telephony; Usability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Availability, Reliability and Security, 2006. ARES 2006. The First International Conference on
Print_ISBN :
0-7695-2567-9
Type :
conf
DOI :
10.1109/ARES.2006.29
Filename :
1625313
Link To Document :
بازگشت