Security arguments for digital signatures and blind signatures

Journal of Cryptology

Volumn 13, Issue 3, 2000, Pages 361-396

  Pointcheval, David ^a   Stern, Jacques ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Blind signatures; Cryptography; Digital signatures; Existential forgery; Forking lemma; One more forgery; Security arguments

Indexed keywords

EID: 0000901529     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/S001450010003     Document Type: Article

References (56)

1. M. Bellare and S. Micali. How to Sign Given Any Trapdoor Function. Journal of the ACM, 39(l):214-233, January 1992.
2. M. Bellare and P. Rogaway. Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In Proc. of the 1st CCCS, pages 62-73. ACM Press, New York, 1993.
3. M. Bellare and P. Rogaway. The Exact Security of Digital Signatures-How to Sign with RS A and Rabin. In Eurocrypt '96, LNCS 1070, pages 399-416. Springer-Verlag, Berlin, 1996.
4. D. Bleichenbacher. Generating El Gamal Signatures without Knowing the Secret Key. In Eurocrypt '96, LNCS 1070, pages 10-18. Springer-Verlag, Berlin, 1996.
5. A. Bosselaers, H. Dobbertin, and B. Preneel. RIPEMD-160: a Strengthened Version of RIPEMD. In Proc of the 3rd FSE, LNCS 1039, pages 71-82. Springer-Verlag, Berlin, 1996.
6. S. A. Brands. An Efficient Off-Line Electronic Cash System Based on the Representation Problem. Technical report CS-R9323, CWI, Amsterdam, 1993.
7. S. A. Brands. Untraceable Off-Line Cash in Wallets with Observers. In Crypto '93, LNCS 773, pages 302-318. Springer-Verlag, Berlin, 1994.
8. S. A. Brands. A Note on Parallel Executions of Restrictive Blind Issuing Protocols for Secret-Key Certificates. Technical report CS-R9519, CWI, Amsterdam, 1995.
9. S. A. Brands. More on Restrictive Blind Issuing of Secret-Key Certificates in Parallel Mode. Technical report CS-R9534, CWI, Amsterdam, 1995.
10. S. A. Brands. Off-Line Electronic Cash Based on Secret-Key Certificates. In LATIN '95, LNCS 911, pages 131-166. Springer-Verlag, Berlin, 1995.
11. S. A. Brands. Restrictive Blind Issuing of Secret-Key Certificates in Parallel Mode. Technical report CS-R9523, CWI, Amsterdam, 1995.
12. J. Camenisch, U. Maurer, and M. Stadier. Digital Payment Systems with Passive Anonymity-Revoking Trustees. Journal of Computer Security, 5(l):254-265,1997.
13. D. Chaum. Blind Signatures for Untraceable Payments. In Crypto '82, pages 199-203. Plenum, New York, 1983.
14. D. Chaum, A. Fiat, and M. Naor. Untraceable Electronic Cash. In Crypto '88, LNCS 403, pages 319-327. Springer-Verlag, Berlin, 1989.
15. I. B. Damgârd. A Design Principle for Hash Functions. In Crypto '89, LNCS 435, pages 416-427. Springer-Verlag, Berlin, 1990.
16. W. Diffie and M. E. Hellman. New Directions in Cryptography. In IEEE Transactions on Information Theory, 22(6):644-654, November 1976.
17. T. El Gamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory, rT-31(4):469172, July 1985.
18. U. Feige and A. Shamir. Witness Indistinguishable and Witness Hiding Protocols. In Proc. of the 22nd STOC, pages 416-426. ACM Press, New York, 1990.
19. N. Ferguson. Extensions of Single Term Coins. In Crypto '93, LNCS 773, pages 292-301. Springer-Verlag, Berlin, 1994.
20. N. Ferguson. Single Term Off-Line Coins. In Eurocrypt '93, LNCS 765, pages 318-328. Springer-Verlag, Berlin, 1994.
21. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions of Identification and Signature Problems. In Crypto '86, LNCS 263, pages 186-194. Springer-Verlag, Berlin, 1987.
22. Y. Frankel, Y. Tsiounis, and M. Yung. Indirect Disclosure Proof: Achieving Efficient Fair Off-Line E-Cash. In Asiacrypt '96, LNCS 1163, pages 286-300. Springer-Verlag, Berlin, 1996.
23. M. Franklin and M. Yung. Secure and Efficient Off-Line Digital Money. In Proc. of the 20th ICALP, LNCS 700, pages 265-276. Springer-Verlag, Berlin, 1993.
24. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of W-Completeness. Freeman, San Francisco, CA, 1979.
25. O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In Proc. of the I9lh STOC, pages 218-229. ACM Press, New York, 1987.
26. S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. In Proc. of the 17th STOC, pages 291-304. ACM Press, New York, 1985. [27] S. Goldwasser, S. Micali, and R. Rivest. A Paradoxical Solution to the Signature Problem. In Proc. of the 25th FOCS, pages 441-448. IEEE, New York, 1984.
27. 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.
28. S. Goldwasser, S. Micali, and A. Yao. Strong Signature Schemes. In Proc. of the 15th STOC, pages 431-439. ACM Press, New York, 1983.
29. L. C. Guillou and J.-J. Quisquater. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory. In Eurocrypt '88, LNCS 330, pages 123-128. Springer-Verlag, Berlin, 1988.
30. M. Jakobsson and M. Yung. Revokable and Versatile Electronic Money. In Proc. of the 3rd CCCS, pages 76-87. ACM Press, New York, 1996.
31. A. Juels, M. Luby, and R. Ostrovsky. Security of Blind Digital Signatures. In Crypto '97, LNCS 1294, pages 150-164. Springer-Verlag, Berlin, 1997.
32. M. Naor and M. Yung. Universal One-Way Hash Functions and Their Cryptographic Applications. In Proc. of the 2lst STOC, pages 33-43. ACM Press, New York, 1989.
33. National Bureau of Standard U.S. Data Encryption Standard, 1977.
34. NIST. Digital Signature Standard (DSS). Pëderaî TnîoïrïïaTion Processing Standards Publication 186, November 1994.
35. NIST. Secure Hash Standard (SHS). Federal Information Processing Standards Publication 180-1, April 1995.
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. H. Ong and C.P. Schnorr. Fast Signature Generation with a Fiat-Shamir-Like Scheme. In Eurociypt '90, LNCS 473, pages 432-440. Springer-Verlag, Berlin, 1991.
38. B. Pfitzmann and M. Waidner. How to Break and Repair a Provably Secure Untraceable Payment System. In Crypto '91, LNCS 576, pages 338-350. Springer-Verlag, Berlin, 1992.
39. J. Pieprzyk, J. Seberry, and Y. Zheng. A One-Way Hashing Algorithm with Variable Length and Output. InAuscrypt '92, LNCS 718, pages 83-104. Springer-Verlag, Berlin, 1993.
40. D. Pointcheval. A New Identification Scheme Based on the Perceptrons Problem. In Eurocrypt '95, LNCS 921, pages 319-328. Springer-Verlag, Berlin, 1995.
41. D. Pointcheval and J. Stern. Provably Secure Blind Signature Schemes. In Asiacrypt '96, LNCS 1163, pages 252-265. Springer-Verlag, Berlin, 1996.
42. D. Pointcheval and J. Stem. Security Proofs for Signature Schemes. In Eurociypt '96, LNCS 1070, pages 387-398. Springer-Verlag, Berlin, 1996.
43. D. Pointcheval and J. Stern. New Blind Signatures Equivalent to Factorization. In Proc. of the 4th CCCS, pages 92-99. ACM Press, New York, 1997.
44. C. Radu, R. Govaerts, and J. Vanderwalle. A Restrictive Blind Signature Scheme with Applications to Electronic Cash. In Communications and Multimedia Security 11, pages 196-207. Chapman & Hall, London, 1996.
45. Ripe Integrity Primitives - Final Report of RACE Integrity Primitives Evaluation (R1040), LNCS 1007. Springer-Verlag, Berlin, 1995.
46. R. Rivest. The MD4 Message-Digest Algorithm. RFC 1320, The Internet Engineering Task Force, April 1992.
47. R. Rivest. The MD5 Message-Digest Algorithm. RFC 1321, The Internet Engineering Task Force, April 1992.
48. R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM, 21(2):120-126, February 1978.
49. C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In Crypto '89, LNCS 435, pages 235-251. Springer-Verlag, Berlin, 1990.
50. C. P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161-174, 1991
51. L. A. M. Schoenmakers. An Efficient Electronic Payment System Withstanding Parallel Attacks. Tech-nical report CS-R9522, CWI, Amsterdam, 1995.
52. A. Shamir. An Efficient Identification Scheme Based on Permuted Kernels. In Crypto '89, LNCS 435, pages 606-609. Springer-Verlag, Berlin, 1990.
53. J. Stem. A New Identification Scheme Based on Syndrome Decoding. In Crypto '93, LNCS 773, pages 13-21. Springer-Verlag, Berlin, 1994.
54. J. Stern. Designing Identification Schemes with Keys of Short Size. In Crypto '94, LNCS 839, pages 164-173. Springer-Verlag, Berlin, 1994.
55. J. Stern. The Validation of Cryptographic Algorithms. In Asiacrypt '96, LNCS 1163, pages 301-310. Springer-Verlag, Berlin, 1996.
56. S. von Solms and D. Naccache. On Blind Signatures and Perfect Crimes. Computers & Security, 11:581583, 1992.