Advertisement

A survey of identification schemes

  • Marc Girault
Section 4 Protection Of Information
Part of the Lecture Notes in Computer Science book series (LNCS, volume 514)

Abstract

The goal of this lecture is to present and compare a large variety of recent cryptographic schemes used to corroborate the identity claimed by an entity. The protocols used in these schemes are minimum (or even zero)-knowledge protocols, in that they provably leak no substantial knowledge on the entity's secret key, provided the mathematical problems on which they lie are effectively hard. Are considered schemes based on factorization problem (Fiat-Shamir, Guillou-Quisquater, ...), on discrete logarithm problem (Chaum et al., Beth, Schnorr, ...), or both (Brickell-Mc Curley, Girault). We also show how less traditional problems -at least in cryptography- are also used to build such schemes, as general linear decoding problem (Stern) or permuted kernels problem (Shamir). In this summary, we introduce the reader to the topic, say a little word about each of the schemes mentioned above, describe some of them in detail and provide a bibliography.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. Bibliography

  1. [Be]
    T. Beth, "A Fiat-Shamir-like authentication protocol for the ElGamal scheme", Advances in Cryptology, Proc. of EUROCRYPT'88, LNCS 330, Springer-Verlag, 1988, pp.77–86.Google Scholar
  2. [BC]
    E. F. Brickell and K. S. McCurley, "An interactive identification scheme based on discrete logarithms and factoring", Proc. of EUROCRYPT'90, to appear.Google Scholar
  3. [CEG]
    D. Chaum, J.H. Evertse and J. van de Graaf, "An improved protocol for demonstrating possession of discrete logarithms and some generalizations", Advances in Cryptology, Proc. of EUROCRYPT'87, LNCS 304, Springer-Verlag, 1988, pp. 127–141.Google Scholar
  4. [DES]
    Data Encryption Standard, National Bureau of Standards, Federal Information Processing Standards, Publ. 46, 1977.Google Scholar
  5. [DH]
    W. Diffie and M. Hellman, "New directions in cryptography", IEEE Transactions on Information Theory, Vol.IT-22, Nov.1976, pp.644–654.CrossRefGoogle Scholar
  6. [FMR]
    M.J. Fischer, S. Micali and C. Rackoff, "A secure protocol for the oblivious transfer", presented at EUROCRYPT'84, Paris, 9–11 Apr.1984.Google Scholar
  7. [FS]
    A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems", Advances in Cryptology, Proc. of CRYPTO'86, LNCS 263, Springer-Verlag, 1987, pp.186–194.Google Scholar
  8. [Gi1]
    M. Girault, "Recent solutions to entity authentication problem", Proc. of ARESAD seminar on Analysis and Management of International Crises, to appear.Google Scholar
  9. [Gi2]
    M. Girault, "An identity-based identification scheme based on discrete logarithms modulo a composite number", Proc. of EUROCRYPT'90, to appear.Google Scholar
  10. [Gi3]
    M. Girault, "Self-certified public keys", submitted to EUROCRYPT'91.Google Scholar
  11. [Gu]
    C.G. Günter, "Diffie-Hellman and ElGamal protocols with one single authentication key", Proc. of EUROCRYPT'89, to appear.Google Scholar
  12. [GP]
    M. Girault and JC. Paillès, "An identity-based identification scheme providing zero-knowledge authentication and authenticated key exchange", Proc. of ESORICS 90, pp. 173–184.Google Scholar
  13. [GQ]
    L.C. Guillou and J.J. Quisquater, "A practical zero-knowledge protocol fitted to security microprocessors minimizing both transmission and memory", Advances in Cryptology, Proc. of EUROCRYPT'88, LNCS 330, Springer-Verlag, 1988, pp.123–128.Google Scholar
  14. [GMR]
    S. Goldwasser, S. Micali and C. Rackoff, "The knowledge of interactive proof-systems", 17th ACM Symposium on Theory of Computing, 1985, pp.291–304.Google Scholar
  15. [MS]
    S. Micali and A. Shamir, "An improvement of the Fiat-Shamir identification and signature scheme", Advances in Cryptology, Proc. of CRYPTO'88, LNCS 403, Springer-Verlag, 1989, pp.244–247.Google Scholar
  16. [OO]
    K. Ohta and T. Okamoto, "A modification of the Fiat-Shamir scheme", Advances in Cryptology, Proc. of CRYPTO'88, LNCS 403, Springer-Verlag, 1989, pp.232–243.Google Scholar
  17. [OS]
    H. Ong and C.P. Schnorr, "Fast signature generation with the Fiat-Shamir scheme", Proc. of EUROCRYPT'90, to appear.Google Scholar
  18. [R1]
    M.O Rabin, "How to exchange secrets by oblivious transfer", manuscript, Harvard Center for Research in Computer Technology, 1981.Google Scholar
  19. [R2]
    M.O Rabin, "Digitalized signatures and public-key functions as intractable as factorization", MIT, Laboratory for Computer Science, MIT/LCS/TR-212, Jan.1979.Google Scholar
  20. [RSA]
    R.L. Rivest, A. Shamir and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems", CACM, Vol.21, no2, Feb.1978, pp.120–126.Google Scholar
  21. [Sc]
    C.P. Schnorr, "Efficient identification and signatures for smart cards", Advances in Cryptology, Proc. of CRYPTO'89, LNCS 435, Springer-Verlag, pp.239–252.Google Scholar
  22. [Sh1]
    A. Shamir, "Identity-based cryptosystems and signature schemes", Advances in Cryptology, Proc. of CRYPTO'84, LNCS 196, Springer-Verlag, 1985, pp.47–53.Google Scholar
  23. [Sh2]
    A. Shamir, "An efficient identification scheme based on permuted kernels", Advances in Cryptology, Proc. of CRYPTO'89, LNCS 435, Springer-Verlag, pp.606–609.Google Scholar
  24. [St]
    J. Stern, "An alternative to the Fiat-Shamir protocol", Proc. of EUROCRYPT'90, to appear; new version presented at Oberwolfach seminar on Cryptography, 24–30 Sept. 89.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Marc Girault
    • 1
  1. 1.Service d'Etudes communes des Postes et Télécommunications (SEPT)CaenFrance

Personalised recommendations