A note on the complexity of breaking Okamoto-Tanaka ID-based key exchange scheme

Authors
Mambo, M Shizuya, H
Citation
M. Mambo et H. Shizuya, A note on the complexity of breaking Okamoto-Tanaka ID-based key exchange scheme, IEICE T FUN, E82A(1), 1999, pp. 77-80
Citations number
10
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
ISSN journal
09168508 → ACNP
Volume
E82A
Issue
1
Year of publication
1999
Pages
77 - 80
Database
ISI
SICI code
0916-8508(199901)E82A:1<77:ANOTCO>2.0.ZU;2-I
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 sc heme is equivalent to breaking the Diffie-Hellman key exchange scheme over Z(n), and (2) impersonation is easier than breaking. The second result is o btained by proving that breaking the RSA public-key cryptosystem reduces to breaking the Diffie-Hellman scheme over Z(n) with respect to the polynomia l-time many-one reducibility.