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

Masahiro Mambo, Hiroki Shizuya

    Research output: Contribution to journalArticlepeer-review

    14 Citations (Scopus)

    Abstract

    The rigorous security of Okamoto-Tanaka identity-based key exchange scheme has been open for a decade. In this paper, \ve 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.

    Original languageEnglish
    Pages (from-to)77-80
    Number of pages4
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE82-A
    Issue number1
    Publication statusPublished - 1999 Jan 1

    Keywords

    • DiffieHellman
    • Key exchange scheme
    • Okamoto-Tanaka
    • RSA
    • Reducibility

    ASJC Scopus subject areas

    • Signal Processing
    • Computer Graphics and Computer-Aided Design
    • Electrical and Electronic Engineering
    • Applied Mathematics

    Fingerprint Dive into the research topics of 'A note on the complexity of breaking Okamoto-Tanaka ID-based key exchange scheme'. Together they form a unique fingerprint.

    Cite this