A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme

Masahiro Mambo; Hiroki Shizuya

doi:10.1007/BFb0054031

A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme

Masahiro Mambo, Hiroki Shizuya

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

4 Citations (Scopus)

Abstract

The rigorous security of Okamoto-Tanaka identity-based key exchange scheme has been open for a decade. In this paper, we show that (1) breaking the scheme is equivalent to breaking the Diffie-Hellman key exchange scheme over Z_n, and (2) impersonation is easier than breaking. The second result is obtained by proving that breaking the RSA public-key cryptosystem reduces to breaking the Diffie-Hellman scheme over Z_n with respect to the polynomial-time many-one reducibility.

Original language	English
Title of host publication	Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings
Editors	Yuliang Zheng, Hideki Imai
Publisher	Springer-Verlag
Pages	258-262
Number of pages	5
ISBN (Print)	3540646930, 9783540646938
DOIs	https://doi.org/10.1007/BFb0054031
Publication status	Published - 1998 Jan 1
Event	1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998 - Pacifico Yokohama, Japan Duration: 1998 Feb 5 → 1998 Feb 6

Publication series

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

Other

Other	1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998
Country/Territory	Japan
City	Pacifico Yokohama
Period	98/2/5 → 98/2/6

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/BFb0054031

Cite this

Mambo, M., & Shizuya, H. (1998). A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme. In Y. Zheng, & H. Imai (Eds.), Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings (pp. 258-262). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1431). Springer-Verlag. https://doi.org/10.1007/BFb0054031

A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme. / Mambo, Masahiro; Shizuya, Hiroki.
Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. ed. / Yuliang Zheng; Hideki Imai. Springer-Verlag, 1998. p. 258-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1431).

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

Mambo, M & Shizuya, H 1998, A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme. in Y Zheng & H Imai (eds), Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1431, Springer-Verlag, pp. 258-262, 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Pacifico Yokohama, Japan, 98/2/5. https://doi.org/10.1007/BFb0054031

Mambo M, Shizuya H. A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme. In Zheng Y, Imai H, editors, Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. Springer-Verlag. 1998. p. 258-262. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/BFb0054031

Mambo, Masahiro ; Shizuya, Hiroki. / A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme. Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings. editor / Yuliang Zheng ; Hideki Imai. Springer-Verlag, 1998. pp. 258-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{c8b7568cb692456a9ef948e364ca22db,

title = "A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme",

abstract = "The rigorous security of Okamoto-Tanaka identity-based key exchange scheme has been open for a decade. In this paper, we show that (1) breaking the scheme is equivalent to breaking the Diffie-Hellman key exchange scheme over Zn, and (2) impersonation is easier than breaking. The second result is obtained by proving that breaking the RSA public-key cryptosystem reduces to breaking the Diffie-Hellman scheme over Zn with respect to the polynomial-time many-one reducibility.",

author = "Masahiro Mambo and Hiroki Shizuya",

year = "1998",

month = jan,

day = "1",

doi = "10.1007/BFb0054031",

language = "English",

isbn = "3540646930",

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

publisher = "Springer-Verlag",

pages = "258--262",

editor = "Yuliang Zheng and Hideki Imai",

booktitle = "Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings",

note = "1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998 ; Conference date: 05-02-1998 Through 06-02-1998",

}

TY - GEN

T1 - A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme

AU - Mambo, Masahiro

AU - Shizuya, Hiroki

PY - 1998/1/1

Y1 - 1998/1/1

N2 - The rigorous security of Okamoto-Tanaka identity-based key exchange scheme has been open for a decade. In this paper, we show that (1) breaking the scheme is equivalent to breaking the Diffie-Hellman key exchange scheme over Zn, and (2) impersonation is easier than breaking. The second result is obtained by proving that breaking the RSA public-key cryptosystem reduces to breaking the Diffie-Hellman scheme over Zn with respect to the polynomial-time many-one reducibility.

AB - The rigorous security of Okamoto-Tanaka identity-based key exchange scheme has been open for a decade. In this paper, we show that (1) breaking the scheme is equivalent to breaking the Diffie-Hellman key exchange scheme over Zn, and (2) impersonation is easier than breaking. The second result is obtained by proving that breaking the RSA public-key cryptosystem reduces to breaking the Diffie-Hellman scheme over Zn with respect to the polynomial-time many-one reducibility.

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

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

U2 - 10.1007/BFb0054031

DO - 10.1007/BFb0054031

M3 - Conference contribution

AN - SCOPUS:33746716683

SN - 3540646930

SN - 9783540646938

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

SP - 258

EP - 262

BT - Public Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings

A2 - Zheng, Yuliang

A2 - Imai, Hideki

PB - Springer-Verlag

T2 - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998

Y2 - 5 February 1998 through 6 February 1998

ER -

A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this