Advertisement

On the security of Girault's identification scheme

  • Shahrokh Saeednia
  • Rei Safavi-Naini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1431)

Abstract

In this paper, we describe two serious weaknesses of an identity-based identification scheme proposed by Girault (presented at Eurocrypt '90) that enables adversaries to forge identity, key pairs for a large group of users. We also show how to modify the scheme to make the attacks ineffective.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. Brickell and K. McCurley, ”An interactive identification scheme based on discrete logarithms”, Advances in Cryptology (Proceedings of EuroCrypt '90), Lecture Notes in Computer Science, vol. 473, Springer-Verlag, 1991, pp. 63–71Google Scholar
  2. 2.
    M. Girault, ”An identity-based identification scheme based on discrete logarithms modulo a composite number”, Advances in Cryptology (Proceedings of EuroCrypt '90), Lecture Notes in Computer Science, vol. 473, Springer-Verlag, 1991, pp. 481–486Google Scholar
  3. 3.
    M. Girault, ”Self-certified public keys”, Advances in Cryptology (Proceedings of EuroCrypt '91), Lecture Notes in Computer Science, vol. 547, Springer-Verlag, 1991, pp. 490–497Google Scholar
  4. 4.
    C. Schnorr, ”Efficient signature generation by smart cards”, Journal of Cryptology, vol. 4, no. 3, 1991, pp. 161–174MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Shahrokh Saeednia
    • 1
  • Rei Safavi-Naini
    • 2
  1. 1.Département d'InformatiqueUniversité Libre de BruxellesBruxellesBelgium
  2. 2.Department of Computer ScienceUniversity of WollongongWollongongAustralia

Personalised recommendations