Skip to main content

Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt ‘95

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2964))

Abstract

We present a cryptanalysis of a zero-knowledge identification protocol introduced by Naccache et al. at Eurocrypt ‘95. Our cryptanalysis enables a polynomial-time attacker to pass the identification protocol with probability one, without knowing the private key.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)

    Google Scholar 

  2. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pp. 291–304 (1985)

    Google Scholar 

  3. Naccache, D.: Method, sender apparatus and receiver apparatus for modulo operation, European patent application no. 91402958.2, November 5 (1991)

    Google Scholar 

  4. Naccache, D., MRaihi, D., Wolfowicz, W., di Porto, A.: Are Crypto-Accelrators really inevitable? 20 bit zero-knowledge in less than a second on simple 8-bit microcontrollers. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 404–409. Springer, Heidelberg (1995)

    Google Scholar 

  5. Shamir, A.: Memory efficient variants of public-key schems for smart-card applications. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 445–449. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coron, JS., Naccache, D. (2004). Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt ‘95. In: Okamoto, T. (eds) Topics in Cryptology – CT-RSA 2004. CT-RSA 2004. Lecture Notes in Computer Science, vol 2964. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24660-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24660-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20996-6

  • Online ISBN: 978-3-540-24660-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics