A note on the complexity of breaking okamoto-tanaka id-based key exchange scheme

Masahiro Mambo, Hiroki Shizuya

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)

    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 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
    Title of host publicationPublic Key Cryptography - 1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998, Proceedings
    EditorsYuliang Zheng, Hideki Imai
    PublisherSpringer-Verlag
    Pages258-262
    Number of pages5
    ISBN (Print)3540646930, 9783540646938
    DOIs
    Publication statusPublished - 1998 Jan 1
    Event1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998 - Pacifico Yokohama, Japan
    Duration: 1998 Feb 51998 Feb 6

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1431
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other1st International Workshop on Practice and Theory in Public Key Cryptography, PKC 1998
    CountryJapan
    CityPacifico Yokohama
    Period98/2/598/2/6

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    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