Abstract
In response to the current need for fast, secure and cheap public-key cryptography, we study an interactive zero-knowledge identification scheme and a derived signature scheme that combine provable security based on the general problem of computing discrete logarithms modulo any number, short identity-based keys, very short transmission and minimal on-line computation. This leads to both efficient and secure applications well suited to the implementation on low cost smart cards. We develop complete proofs of completeness, soundness and statistical zero-knowledge property of the identification scheme. The security analysis of the signature scheme leads to present a novel number theoretical lemma of independent interest and an original use of the “forking lemma” technique. From a practical point of view, the possible choice of parameters is discussed and we submit performances of an actual implementation on a cheap smart card. As an example, a complete and secure authentication can be performed in less than 20 ms with low cost equipment.
Chapter PDF
Key words
References
M. Bellare and P. Rogaway. Random Oracles are Practical: a paradigm for designing efficient protocols. In Proc. of the 1st CCCS, 62–73. ACM press, 1993.
E. F. Brickell and K. S. McCurley. An Interactive Identification Scheme Based on Discrete Logarithms and Factoring. Journal of Cryptology, 5:29–39, 1992.
H. Cohen. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics 138. Springer, 1993.
J. Cowie, B. Dodson, R.M. Elkenbracht-Huizing, A. Lenstra, P. Montgomery, and J. Zayer. A World Wide Number Field Sieve Factoring Record: On to 512 Bits. In Asiacrypt '96, LNCS 1163, 382–394. Springer, 1996.
U. Feige, A. Fiat, and A. Shamir. Zero-Knowledge Proofs of Identity. Journal of Cryptology, 1:77–95, 1988.
A. Fiat and A. Shamir. How to Prove Yourself: practical solutions of identification and signature problems. In Crypto '86, LNCS 263, 186–194. Springer, 1987.
M. Girault. An Identity-Based Identification Scheme Based on Discrete Logarithms Modulo a Composite Number. In Eurocrypt '90, LNCS 473, 481–486, 1991.
M. Girault. Self-certified public keys. In Eurocrypt '91, LNCS 547, 490–497. Springer, 1992.
M. Girault and J. Stern. On the Length of Cryptographic Hash-Values used in Identification Schemes. In Crypto '94, LNCS 839, 202–215. Springer, 1994.
O. Goldreich. Foundations of Cryptography. Weizmann Institute of Science, 1995. (fragment of a book).
S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. In Proc. of the 17th STOC, 291–304. ACM Press, 1985.
D. E. Knuth. Seminumerical algorithms. In The Art of Computer Programming, volume 2. Addison-Wesley Publishing Company, 1969.
B. A. LaMacchia and A. M. Odlyzko. Computation of Discrete Logarithms in Prime Fields. Designs, Codes and Cryptography, 1(1):47–62, May 1991.
U. M. Maurer and Y. Yacobi. Non-interactive Public-Key Cryptography. In Eurocrypt '91, LNCS 547, 498–507. Springer, 1992.
G. Miller. Riemann's hypothesis and tests for primality. Journal of Computer and System Sciences, (13):300–317, 1976.
D. Naccache, D. M'RaÏhi, S. Vaudenay, and D. Raphaeli. Can DSA be improved ? In Eurocrypt '94, LNCS 950, 77–85. Springer, 1995.
D. Pointcheval and J. Stern. Security Proofs for Signature Schemes. In Eurocrypt '96, LNCS 1070, 387–398. Springer, 1996.
C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In Crypto '89, LNCS 435, 235–251. Springer, 1990.
A. Shamir. Identity-Based CryptoSystems and Signature Schemes. In Crypto '84, LNCS 196, 47–53. Springer, 1985.
V. Shoup. On The Security of a Practical Identification Scheme. In Eurocrypt '96, LNCS 1070, 344–353. Springer, 1996.
V. Shoup. Lower Bounds for Discrete Logarithms and Related Problems. In Eurocrypt '97, LNCS 1233, 256–266. Springer, 1997.
D. R. Stinson. Cryptography, Theory and Practice. CRC Press, 1995.
P. C. van Oorschot and M. J. Wiener. On Diffie-Hellman Key Agreement with Short Exponents. In Eurocrypt '96, LNCS 1070, 332–343. Springer, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poupard, G., Stern, J. (1998). Security analysis of a practical “on the fly” authentication and signature generation. In: Nyberg, K. (eds) Advances in Cryptology — EUROCRYPT'98. EUROCRYPT 1998. Lecture Notes in Computer Science, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054143
Download citation
DOI: https://doi.org/10.1007/BFb0054143
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64518-4
Online ISBN: 978-3-540-69795-4
eBook Packages: Springer Book Archive