Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks

Jeong Ok Kwon; Kouichi Sakurai; Dong Hoon Lee

doi:10.1007/11758501_152

Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks

Jeong Ok Kwon, Kouichi Sakurai, Dong Hoon Lee

Graduate School of Information Study

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Citations (Scopus)

Abstract

A password-authenticated key exchange (PAKE) protocol in the three-party setting allows two users communicating over a public network to agree on a common session key by the help of a server. In the setting the users do not share a password between themselves, but only with the server. In this paper, we explore the possibility of designing a round-efficient three-party PAKE protocol with a method to protect against undetectable on-line dictionary attacks without using the random oracle. The protocol matches the most efficient three-party PAKE protocol secure against undetectable on-line dictionary attacks among those found in the literature while providing the same level of security. Finally, we indentify the relations between detectable on-line and undetectable on-line dictionary attacks by providing counter-examples to support the observed relations¹.

Original language	English
Title of host publication	Computational Science - ICCS 2006
Subtitle of host publication	6th International Conference, Proceedings
Publisher	Springer Verlag
Pages	977-980
Number of pages	4
ISBN (Print)	3540343792, 9783540343790
DOIs	https://doi.org/10.1007/11758501_152
Publication status	Published - 2006
Event	ICCS 2006: 6th International Conference on Computational Science - Reading, United Kingdom Duration: 2006 May 28 → 2006 May 31

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3991 LNCS - I
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	ICCS 2006: 6th International Conference on Computational Science
Country	United Kingdom
City	Reading
Period	06/5/28 → 06/5/31

Keywords

Cryptography
Dictionary attacks
Mobile network security
Password-authenticated key exchange
Round complexity

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11758501_152

Fingerprint Dive into the research topics of 'Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks'. Together they form a unique fingerprint.

Cite this

Kwon, J. O., Sakurai, K., & Lee, D. H. (2006). Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks. In Computational Science - ICCS 2006: 6th International Conference, Proceedings (pp. 977-980). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3991 LNCS - I). Springer Verlag. https://doi.org/10.1007/11758501_152

Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks. / Kwon, Jeong Ok; Sakurai, Kouichi; Lee, Dong Hoon.

Computational Science - ICCS 2006: 6th International Conference, Proceedings. Springer Verlag, 2006. p. 977-980 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3991 LNCS - I).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kwon, JO, Sakurai, K & Lee, DH 2006, Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks. in Computational Science - ICCS 2006: 6th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3991 LNCS - I, Springer Verlag, pp. 977-980, ICCS 2006: 6th International Conference on Computational Science, Reading, United Kingdom, 06/5/28. https://doi.org/10.1007/11758501_152

Kwon JO, Sakurai K, Lee DH. Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks. In Computational Science - ICCS 2006: 6th International Conference, Proceedings. Springer Verlag. 2006. p. 977-980. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11758501_152

Kwon, Jeong Ok ; Sakurai, Kouichi ; Lee, Dong Hoon. / Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks. Computational Science - ICCS 2006: 6th International Conference, Proceedings. Springer Verlag, 2006. pp. 977-980 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5d1e051b0db64ca98e50c135ce04f6c4,

title = "Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks",

abstract = "A password-authenticated key exchange (PAKE) protocol in the three-party setting allows two users communicating over a public network to agree on a common session key by the help of a server. In the setting the users do not share a password between themselves, but only with the server. In this paper, we explore the possibility of designing a round-efficient three-party PAKE protocol with a method to protect against undetectable on-line dictionary attacks without using the random oracle. The protocol matches the most efficient three-party PAKE protocol secure against undetectable on-line dictionary attacks among those found in the literature while providing the same level of security. Finally, we indentify the relations between detectable on-line and undetectable on-line dictionary attacks by providing counter-examples to support the observed relations1.",

keywords = "Cryptography, Dictionary attacks, Mobile network security, Password-authenticated key exchange, Round complexity",

author = "Kwon, {Jeong Ok} and Kouichi Sakurai and Lee, {Dong Hoon}",

year = "2006",

doi = "10.1007/11758501_152",

language = "English",

isbn = "3540343792",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "977--980",

booktitle = "Computational Science - ICCS 2006",

}

TY - GEN

T1 - Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks

AU - Kwon, Jeong Ok

AU - Sakurai, Kouichi

AU - Lee, Dong Hoon

PY - 2006

Y1 - 2006

N2 - A password-authenticated key exchange (PAKE) protocol in the three-party setting allows two users communicating over a public network to agree on a common session key by the help of a server. In the setting the users do not share a password between themselves, but only with the server. In this paper, we explore the possibility of designing a round-efficient three-party PAKE protocol with a method to protect against undetectable on-line dictionary attacks without using the random oracle. The protocol matches the most efficient three-party PAKE protocol secure against undetectable on-line dictionary attacks among those found in the literature while providing the same level of security. Finally, we indentify the relations between detectable on-line and undetectable on-line dictionary attacks by providing counter-examples to support the observed relations1.

AB - A password-authenticated key exchange (PAKE) protocol in the three-party setting allows two users communicating over a public network to agree on a common session key by the help of a server. In the setting the users do not share a password between themselves, but only with the server. In this paper, we explore the possibility of designing a round-efficient three-party PAKE protocol with a method to protect against undetectable on-line dictionary attacks without using the random oracle. The protocol matches the most efficient three-party PAKE protocol secure against undetectable on-line dictionary attacks among those found in the literature while providing the same level of security. Finally, we indentify the relations between detectable on-line and undetectable on-line dictionary attacks by providing counter-examples to support the observed relations1.

KW - Cryptography

KW - Dictionary attacks

KW - Mobile network security

KW - Password-authenticated key exchange

KW - Round complexity

UR - http://www.scopus.com/inward/record.url?scp=33746614267&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746614267&partnerID=8YFLogxK

U2 - 10.1007/11758501_152

DO - 10.1007/11758501_152

M3 - Conference contribution

AN - SCOPUS:33746614267

SN - 3540343792

SN - 9783540343790

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 977

EP - 980

BT - Computational Science - ICCS 2006

PB - Springer Verlag

T2 - ICCS 2006: 6th International Conference on Computational Science

Y2 - 28 May 2006 through 31 May 2006

ER -

Efficient password-authenticated key exchange for three-party secure against undetectable on-line dictionary attacks

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this