On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks
スポンサーリンク
概要
- 論文の詳細を見る
As far as the knowledge of authors, the rigorous security of Okamoto-Tanaka idenntity-based key exchange scheme was shown in [MS99] for the first time since its invention. However, the analysis deals with only the passive attack. In this paper, we describe several models of active attacks against the scheme and show the rigorous security of the scheme in these models. We prove several relationships including that (1) breaking the scheme in one attack model is equivalent to breaking the RSA public-key cryptosystem and (2) breaking the scheme in another attack model is equivalent to breaking the Diffie-Hellman key exchange scheme over Z_n.
- 社団法人電子情報通信学会の論文
- 2000-01-26
著者
-
Mambo M
Japan Advanced Inst. Sci. And Technol. Ishikawa‐ken Jpn
-
Mambo Masahiro
Education Center For Information Processing And Graduate School Of Information Sciences Tohoku Unive
-
Shizuya Hiroki
Education Center For Information Processing And Graduate School Of Information Sciences Tohoku Unive
-
KIM Seungjoo
The author is with the Korea Information Security Agency
-
Kim Seungjoo
Korea Information Security Agency
-
Won Dongho
Dept.of Information Eng., Sungkyunkwan University
-
Won Dongho
The Author Is With The Department Of Information Engineering Sungkyunkwan University
関連論文
- Proposal of an Automatic Signature Scheme Using a Compiler (Special Section on Cryptography and Information Security)
- Permutation Cipher Scheme Using Polynomials over a Field
- 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
- Proxy Signatures: Delegation of the Power to Sign Messages (Special Section on Information Theory and Its Applications)
- The Computational Difficulty of Solving Cryptographic Primitive Problems Related to the Discrete Logarithm Problem(Public Key Cryptography)(Cryptography and Information Security)
- Complexity Analysis of the Cryptographic Primitive Problems through Square-Root Exponent(Discrete Mathematics and Its Applications)
- On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks : Special Section on Cryptography and Information Security
- On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks
- Proxy Cryptosystems: Delegation of the Power to Decrypt Ciphertexts (Special Section on Cryptography and Information Security)
- Multisignature Schemes Using Structured Group ID
- Secure Access Control Agent for Distributed Files