A Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Seheme (Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 1999-01-25
著者
-
Mambo Masahiro
Educational Center For Information Processing Tohoku University
-
Mambo Masahiro
Education Center For Information Processing And Graduate School Of Information Sciences Tohoku Unive
-
Shizuya Hiroki
Education Center For Information Processing Tohoku University
-
Shizuya Hiroki
Education Center For Information Processing And Graduate School Of Information Sciences Tohoku Unive
-
Mambo Masahiro
Education Center For Information Processing And Graduate School Of Information Sciences Tohoku Unive
関連論文
- A Note on AM Languages Outside NP ⋃ co-NP (Special Section on Cryptography and Information Security)
- A Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Seheme (Special Section on Cryptography and Information Security)
- Demonstrating Possession without Revealing Factors (Special Section on Cryptography and Information Security)
- On the Complexity of the Discrete Logarithm for a General Finite Group (Special Section on Cryptography and Information Security)
- On the Σ^b_1-Definability of Integer Factoring
- On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks
- Multisignature Schemes Using Structured Group ID
- Secure Access Control Agent for Distributed Files