On the fly authentication and signature schemes based on groups of unknown order

Journal of Cryptology

Volumn 19, Issue 4, 2006, Pages 463-487

  Girault, Marc ^a   Poupard, Guillaume ^b   Stern, Jacques ^c  

^a ORANGE LABS   (France)

^b DCSSI Crypto Lab   (France)

^c ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Digital signature; Discrete logarithm problem; Identification scheme; Low cost smart cards; Minimal on line computation

Indexed keywords

DISCRETE LOGARITHM PROBLEM; IDENTIFICATION SCHEME; LOW COST SMART CARDS; MINIMAL ONLINE COMPUTATION;

GLOBAL POSITIONING SYSTEM; ONLINE SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; SMART CARDS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33749561582     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-006-0224-0     Document Type: Article

References (45)

1. M. Abdalla, J.H. An, M. Bellare, and C. Namprempre. From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. In Eurocrypt 2002, LNCS 2332, pages 418-433. Springer-Verlag, Berlin, 2002.
2. M. Bellare, M. Fischlin, S. Goldwasser, and S. Micali. Identification Protocols Secure against Reset Attacks. In Eurocrypt 2001, LNCS 2045, pages 495-511. Springer-Verlag, Berlin, 2001.
3. M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In Proceedings of the 1st ACM-CCS, pages 62-73. ACM Press, New York, 1993.
4. T. Beth. Efficient Zero-Knowledge Identification Scheme for Smart Cards. In Eurocrypt '88, LNCS 330, pages 77-86. Springer-Verlag, Berlin, 1988.
5. I. Biehl, J. Buchmann, S. Hamdy, and A. Meyer. A Signature Scheme Based on the Intractability of Computing Roots. Designs, Codes and Cryptography, 25(3):223-236, March 2002.
6. E. Biham and A. Shulman. User-Defined Divisibility of Ecash and a Practical Implementation. In CARDIS '98, LNCS 1820, pages 1-18. Springer-Verlag, Berlin, 2000.
7. E. F. Brickell and K. S. McCurley. An Interactive Identification Scheme Based on Discrete Logarithms and Factoring. Journal of Cryptology, 5:29-39, 1992.
8. R. Canetti, O. Goldreich, and S. Halevi. The Random Oracle Methodology Revisited. In Proceedings of the 30th STOC, pages 209-218. ACM Press, New York, 1998.
9. R. Canetti, S. Goldwasser, O. Goldreich, and S. Micali. Resettable Zero-Knowledge. In Proceedings of the 32nd STOC, pages 235-244. ACM Press, New York, 2000.
10. D. Chaum, J. Evertse, and J. van de Graaf. An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations. In Eurocrypt '87, LNCS 304, pages 127-141. Springer-Verlag, Berlin, 1988.
11. D. Chaum, J. Evertse, J. van de Graaf, and R. Peralta. Demonstrating Possession of a Discrete Logarithm without Revealing It. In Crypto '86, LNCS 263, pages 200-212. Springer-Verlag, Berlin, 1987.
12. J.S. Coron, H. Handschuh, and D. Naccache. ECC: Do We Need to Count? In Asiacrypt '99, LNCS 1716, pages 122-134. Springer-Verlag, Berlin, 1999.
13. C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-Knowledge. In Proceedings of the 30th STOC, pages 409-418. ACM Press, New York, 1998.
14. S. Even, O. Goldreich, and S. Micali. On-Line/Off-Line Digital Signatures. In Crypto '89, LNCS 435, pages 263-277. Springer-Verlag, Berlin, 1990.
15. U. Feige, A. Fiat, and A. Shamir. Zero-Knowledge Proofs of Identity. Journal of Cryptology, 1:77-95, 1988.
16. U. Feige and A. Shamir. Witness Indistinguishable and Witness Hiding Protocols. In Proceedings of the 22nd STOC, pages 416-426. ACM Press, New York, 1990.
17. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Crypto '86, LNCS 263, pages 186-194. Springer-Verlag, Berlin, 1987.
18. P. A. Fouque and G. Poupard. On the Security of RDSA. In Eurocrypt 2003, LNCS 2656, pages 462-476. Springer-Verlag, Berlin, 2003.
19. R. Gennaro. An Improved Pseudo-Random Generator Based on Discrete Log. In Crypto 2000, LNCS 1880, pages 469-481. Springer-Verlag, Berlin, 2000.
20. M. Girault. An Identity-Based Identification Scheme Based on Discrete Logarithms Modulo a Composite Number. In Eurocrypt '90, LNCS 473, pages 481-486. Springer-Verlag, Berlin, 1991.
21. M. Girault. Self-Certified Public Keys. In Eurocrypt '91, LNCS 547, pages 490-497. Springer-Verlag, Berlin, 1992.
22. M. Girault. Low-Size Coupons for Low-Cost IC Cards. In CARDIS 2000, volume 180 of IFIP Conference Proceedings, pages 39-50. Kluwer, Dordrecht, 2000.
23. M. Girault and D. Lefranc. Public Key Authentication with One Single (On-Line) Addition. In CHES 2004, LNCS 3156, pages 413-427. Springer-Verlag, Berlin, 2004.
24. M. Girault and J.-C. Paillès. On-Line/Off-Line RSA-Like. In Proceedings of WCC '03, pages 173-184, 2003.
25. M. Girault, G. Poupard, and J. Stern. Some Modes of Use of the GPS Identification Scheme. In Proceedings of the 3rd NESSIE Conference, 2002.
26. M. Girault and J.-J. Quisquater. GQ+GPS. Rump-Session of Eurocrypt 2002.
27. M. Girault and J. Stern. On the Length of Cryptographic Hash-Values Used in Identification Schemes. In Crypto '94, LNCS 839, pages 202-215. Springer-Verlag, Berlin, 1994.
28. GNU Multiple Precision Arithmetic Library (GMP 4.0.1), 2002. Available from http://www.swox.com/gmp.
29. S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal of Computing, 18(1):186-208, February 1989.
30. S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adaptative Chosen-Message Attacks. SIAM Journal of Computing, 17(2):281-308, April 1988.
31. ISO/IEC 9798-5. Information Technology - Security Techniques - Entity Authentication - Part 5: Mechanisms Using Zero-Knowledge Techniques - Second edition, December 2004.
32. A. Lenstra and E. Verheul. Selecting Cryptographic Key Sizes. Journal of Cryptology, 14(4):255-293, 2001.
33. D. Naccache, D. M'Raïhi, S. Vaudenay, and D. Raphaeli. Can DSA be Improved? In Eurocrypt '94, LNCS 950, pages 77-85. Springer-Verlag, Berlin, 1995.
34. NESSIE consortium. Portfolio of Recommended Cryptographic Primitives, 2003. Available from http://www.cryptonessie.org.
35. NIST. Secure Hash Standard (SHS). Federal Information Processing Standards Publication 180-2, August 2002.
36. T. Okamoto. Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes. In Crypto '92, LNCS 740, pages 31-53. Springer-Verlag, Berlin, 1992.
37. S. Patel and G. Sundaram. An Efficient Discrete Log Pseudo Random Generator. In Crypto '98, LNCS 1462, pages 304-317. Springer-Verlag, Berlin, 1998.
38. D. Pointcheval. The Composite Discrete Logarithm and Secure Authentication. In PKC 2000, LNCS 1751, pages 113-128. Springer-Verlag, Berlin, 2000.
39. D. Pointcheval and J. Stern. Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology, 13(3):361-396, 2000.
40. G. Poupard and J. Stern. Security Analysis of a Practical "On the Fly" Authentication and Signature Generation. In Eurocrypt '98, LNCS 1403, pages 422-436. Springer-Verlag, Berlin, 1998.
41. G. Poupard and J. Stern. On the Fly Signatures based on Factoring. In Proceedings of 6th ACM-CCS, pages 37-45. ACM Press, New York, 1999.
42. C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In Crypto '89, LNCS 435, pages 235-251. Springer-Verlag, Berlin, 1990.
43. C. P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161-174, 1991.
44. A. Shamir and Y. Tauman. Improved Online/Offline Signature Schemes. In Crypto 2001, LNCS 2139, pages 355-367. Springer-Verlag, Berlin, 2001.
45. P. C. van Oorschot and M. J. Wiener. On Diffie-Hellman Key Agreement with Short Exponents. In Eurocrypt '96, LNCS 1070, pages 332-343. Springer-Verlag, Berlin, 1996.