On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks : Special Section on Cryptography and Information Security

スポンサーリンク

概要

• 論文の詳細を見る

• As far as the knowledge of authors, the rigorous security of Okamoto-Tanaka identity-based key exchange scheme was shown in [4] for the first time since its invention. However, the analysis deals with only the passive attack. In this paper, we give several models of active attacks against the scheme and show the rigorous security of the scheme in these models. We prove several relationships among attack models, 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. The difference of the complexity stems from the difference of the timing of dishonest party's sending out and receiving messages.

• 社団法人電子情報通信学会の論文
• 2001-01-01

著者

• Mambo M

  Japan Advanced Inst. Sci. And Technol. Ishikawa‐ken Jpn

• Shizuya Hiroki

  The Author Is With Education Center For Information Processing Tohoku University

• Tada Mitsuru

  The Authors Are With The School Of Information Science Japan Advanced Institute Of Science And Techn

• Mambo Masahiro

  The Authors Are With The Department Of Computer And Mathematical Sciences The Graduate School Of Inf

• Okamoto T

  Univ. Tsukuba Tsukuba‐shi Jpn

• KIM Seungjoo

  The author is with the Korea Information Security Agency

• OKAMOTO Takeshi

  The authors are with the School of Information Science, Japan Advanced Institute of Science and Tech

• WON Dongho

  The author is with the Department of Information Engineering, Sungkyunkwan University

• Won Dongho

  The Author Is With The Department Of Information Engineering Sungkyunkwan University

• Okamoto Takeshi

  The Authors Are With The Department Of Knowledge-based Information Engineering Toyohashi 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
• On the Average Length of Secret Key Exchange Eulerian Circuits(Special Section on Discrete Mathematics and Its Applications)
• A Way of Making Trapdoor One-Way Functions Trapdoor No-Way : Special Section on Cryptography and Information Security
• On the Complexity of Constructing an Elliptic Curve of a Given Order : Special Section on Cryptography and Information Security
• 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)
• A Distributed Approach against Computer Viruses Inspired by the Immune System (IEICE/IEEE Joint Special Issue on Autonomous Decentralized Systems)

もっと見る 閉じる

スポンサーリンク