TY - GEN
T1 - Efficient password-based authenticated key exchange without public information
AU - Shao, Jun
AU - Cao, Zhenfu
AU - Wang, Licheng
AU - Lu, Rongxing
PY - 2007
Y1 - 2007
N2 - Since the first password-based authenticated key exchange (PAKE) was proposed, it has enjoyed a considerable amount of interest from the cryptographic research community. To our best knowledge, most of proposed PAKEs based on Diffie-Hellman key exchange need some public information, such as generators of a finite cyclic group. However, in a client-server environment, not all servers use the same public information, which demands clients authenticate those public information before beginning PAKE. It is cumbersome for users. What's worse, it may bring some secure problems with PAKE, such as substitution attack. To remove these problems, in this paper, we present an efficient password-based authenticated key exchange protocol without any public information. We also provide a formal security analysis in the non-concurrent setting, including basic security, mutual authentication, and forward secrecy, by using the random oracle model.
AB - Since the first password-based authenticated key exchange (PAKE) was proposed, it has enjoyed a considerable amount of interest from the cryptographic research community. To our best knowledge, most of proposed PAKEs based on Diffie-Hellman key exchange need some public information, such as generators of a finite cyclic group. However, in a client-server environment, not all servers use the same public information, which demands clients authenticate those public information before beginning PAKE. It is cumbersome for users. What's worse, it may bring some secure problems with PAKE, such as substitution attack. To remove these problems, in this paper, we present an efficient password-based authenticated key exchange protocol without any public information. We also provide a formal security analysis in the non-concurrent setting, including basic security, mutual authentication, and forward secrecy, by using the random oracle model.
UR - https://www.scopus.com/pages/publications/38049059426
U2 - 10.1007/978-3-540-74835-9_20
DO - 10.1007/978-3-540-74835-9_20
M3 - 会议稿件
AN - SCOPUS:38049059426
SN - 9783540748342
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 299
EP - 310
BT - Computer Security - ESORICS 2007 - 12th European Symposium on Research in Computer Security, Proceedings
PB - Springer Verlag
T2 - 12th European Symposium on Research in Computer Security, ESORICS 2007
Y2 - 24 September 2007 through 26 September 2007
ER -