Efficient Zero-Knowledge Identification Scheme for Smart Cards

  • Thomas Beth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 330)


In this paper we present a Fiat-Shamir like authentication protocol for the El-Gamal Scheme.

6. References

  1. [1]
    El-Gamal: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE-IT-31, 469–472, 1985Google Scholar
  2. [2]
    Vanstone, Mullin: Communication 1986, Cryptech, Waterloo, Ontario, CanadaGoogle Scholar
  3. [3]
    Beth, Cook, Gollmann: Architectures for Exponentiation in GF(2п), Proceedings of Crypto 86, Santa Barbara, Springer LNCS 263, 302–310, 1987Google Scholar
  4. [4]
    Fiat, Shamir: How to prove yourself: Practical solutions to identification and signature problems, Proceedings of Crypto 86, Santa Barbara, Springer LNCS 263, 186–194, 1987Google Scholar
  5. [5]
    Chaum, Evertse, van de Graaf: An unproved Protocol for Demonstrating Possession of Discrete Logarithms and some Generalizations, Proceedings EUROCRYPT’87, Springer LNCS 304, 127–141, 1988Google Scholar
  6. [6]
    Coppersmith: Fast Evaluation of Logarithms in Fields of Characteristic Two, IEEE-IT-30, 587–594, 1984Google Scholar
  7. [7]
    Wang: Exponentiation in Finite Fields, Ph.D. dissertation, University of California, Los Angeles, 1985Google Scholar
  8. [8]
    Goldwasser, S.: Micali, S.; Rackoff, C.: The Knowlege Complexity of Interactive Proof Systems, Proc. 17th ACM Symp. on Theory of Computing, 1985Google Scholar
  9. [9]
    Berger, Kannan, Peralta: A Framework for the Study of Cryptographic Protocols, Proc. CRYPTO’85, Springer LNCS 218, 87–103Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Thomas Beth
    • 1
  1. 1.Fakultät für Informatik Institut für Algorithmen und Kognitive SystemeUniversität KarlsruheKarlsruhe

Personalised recommendations