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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
Naccache, D.: Method, sender apparatus and receiver apparatus for modulo operation, European patent application no. 91402958.2, November 5 (1991)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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