On the Security of Girault Key Agreement Protocols against Active Attacks

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E86-A, Issue 5, 2003, Pages 1181-1189

  Oh, Soo Hyun ^a   Mambo, Masahiro ^b   Shizuya, Hiroki ^b   Won, Dong Ho ^a  

^a Sungkyunkwan University   (South Korea)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

Girault key agreement protocol; Reduction; Self certified public key

Indexed keywords

FUNCTIONS; NETWORK PROTOCOLS; PROBLEM SOLVING; SECURITY OF DATA;

GIRAULT KEY PROTOCOLS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0141972489     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Review

References (16)

1. E. Bach, "Discrete logarithms and factoring," Technical Report UCB/CSD 84/186, University of California, Computer Science Division (EECS), 1984.
2. W. Diffie and M. Hellman, "New directions in cryptography," IEEE Trans. Inf. Theory, vol.IT-22, no.6, pp.644-654, 1974.
3. M. Girault, "Self-certified public keys," Advances in Cryptology-Eurocrypt'91, LNCS 547, pp.490-497, Springer-Verlag, Berlin, 1991.
4. Y. Gurevich, "Average case completeness," J. Comput. Syst. Sci., vol.42, pp.346-398, 1991.
5. S.J. Kim, M. Mambo, T. Okamoto, H. Shizuya, M. Tada, and D.H. Won, "On the security of the Okamoto-Tanaka ID-based key exchange scheme against active attacks," IEICE Trans. Fundamentals, vol.E84-A, no.l, pp.231-238, Jan. 2001.
6. M. Mambo and H. Shizuya, "A note on the complexity of breaking Okamoto-Tanaka ID-based key exchange scheme," IEICE Trans. Fundamentals, vol.E82-A, no.l, pp.77-80, Jan. 1999.
7. K.S. McCurley, "A key distribution system equivalent to factoring," J. Cryptology, vol.1, pp.95-105, 1988.
8. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
9. E. Okamoto and K. Tanaka, "Key distribution system based on identification information," IEEE J. Sel. Areas Commun., vol.7, pp.481-485, 1989.
10. P. Ribenboim, The Book of Prime Number Records, Springer-Verlag, 1988.
11. R.L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public key cryptosystems," Commun. ACM, vol.21, no.2, pp.120-126, 1978.
12. R.A. Rueppel and P.C. van Oorschot, "Modern key agreement techniques," Computer Communications, vol.17 no.7, pp.458-465, July 1994.
13. K. Sakurai and H. Shizuya, "Relationships among the computational powers of breaking discrete log cryptosystems," Advances in Cryptology-Eurocrypt'95 LNCS 921, pp.341-355, Springer-Verlag, 1995. J. Cryptology, vol.11, pp.29-43, 1998.
14. K. Sakurai and H. Shizuya, "Relationships among the computational powers of breaking discrete log cryptosystems," Advances in Cryptology-Eurocrypt'95 LNCS 921, pp.341-355, Springer-Verlag, 1995. J. Cryptology, vol.11, pp.29-43, 1998.
15. Z. Shmuely, "Composite Diffie-Hellman public-key generating systems are hard to break," Technical Report, no.356, Computer Science Department, Technion-Israel Institute of Technology, 1985.
16. H. Woll, "Reduction among number theoretic problems," Inf. Comput., vol.72, pp.167-179, 1987.