Security analysis of a practical “on the fly” authentication and signature generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1403, Issue , 1998, Pages 422-436

  Poupard, Guillaume ^a   Stern, Jacques ^a  

^a Fondementset A   (France)

Author keywords

Digital signature; General discrete logarithm problem; Identification scheme; Low cost smart cards; Minimal on line computation; Security analysis

Indexed keywords

COMPUTATION THEORY; COST BENEFIT ANALYSIS; COSTS; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; SECURITY SYSTEMS; SMART CARDS; TRANSPORTATION;

DISCRETE LOGARITHM PROBLEMS; IDENTIFICATION SCHEME; LOW COSTS; ONLINE COMPUTATIONS; SECURITY ANALYSIS;

AUTHENTICATION;

EID: 84957640282     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054143     Document Type: Conference Paper

References (23)

1. 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.
2. E. F. Brickell and K. S. McCurley. An Interactive Identification Scheme Based on Discrete Logarithms and Factoring. Journal of Cryptology, 5:29-39, 1992.
3. H. Cohen. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics 138. Springer, 1993.
4. 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.
5. U. Feige, A. Fiat, and A. Shamir. Zero-Knowledge Proofs of Identity. Journal of Cryptology, 1:77-95, 1988.
6. 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.
7. M. Girault. An Identity-Based Identification Scheme Based on Discrete Logarithms Modulo a Composite Number. In Eurocrypt ’90, LNCS 473, 481-486, 1991.
8. M. Girault. Self-certified public keys. In Eurocrypt ’91, LNCS 547, 490-497. Springer, 1992.
9. 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.
10. O. Goldreich. Foundations of Cryptography. Weizmann Institute of Science, 1995. (fragment of a book).
11. 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.
12. D. E. Knuth. Seminumerical algorithms. In The Art of Computer Programming, volume 2. Addison-Wesley Publishing Company, 1969.
13. B. A. LaMacchia and A. M. Odlyzko. Computation of Discrete Logarithms in Prime Fields. Designs, Codes and Cryptography, 1(1):47-62, May 1991.
14. U. M. Maurer and Y. Yacobi. Non-interactive Public-Key Cryptography. In Eurocrypt ’91, LNCS 547, 498-507. Springer, 1992.
15. G. Miller. Riemann’s hypothesis and tests for primality. Journal of Computer and System Sciences, (13):300-317, 1976.
16. D. Naccache, D. M’Raïhi, S. Vaudenay, and D. Raphaeli. Can DSA be improved ? In Eurocrypt ’94, LNCS 950, 77-85. Springer, 1995.
17. D. Pointcheval and J. Stern. Security Proofs for Signature Schemes. In Eurocrypt ’96, LNCS 1070, 387-398. Springer, 1996.
18. C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In Crypto ’89, LNCS 435, 235-251. Springer, 1990.
19. A. Shamir. Identity-Based Cryptosystems and Signature Schemes. In Crypto ’84, LNCS 196, 47-53. Springer, 1985.
20. V. Shoup. On The Security of a Practical Identification Scheme. In Eurocrypt ’96, LNCS 1070, 344-353. Springer, 1996.
21. V. Shoup. Lower Bounds for Discrete Logarithms and Related Problems. In Eurocrypt ’97, LNCS 1233, 256-266. Springer, 1997.
22. D. R. Stinson. Cryptography, Theory and Practice. CRC Press, 1995.
23. 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.