The power of RSA inversion oracles and the security of chaum’s RSA-based blind signature scheme

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

Volumn 2339, Issue , 2002, Pages 319-338

  Bellare, Mihir ^a   Namprempre, Chanathip ^a   Pointcheval, David ^b   Semanko, Michael ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Blind digital signature schemes; Digital cash; RSA

Indexed keywords

CHROMIUM COMPOUNDS; CRYPTOGRAPHY; ELECTRONIC MONEY; EQUIVALENCE CLASSES; NETWORK SECURITY;

BLIND SIGNATURE SCHEME; BLIND SIGNATURES; COMPUTATIONAL PROBLEM; DIGITAL CASH SCHEME; DIGITAL SIGNATURE SCHEMES; INVERSION PROBLEMS; RANDOM ORACLE MODEL;

AUTHENTICATION;

EID: 84949210733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46088-8_25     Document Type: Conference Paper

References (19)

1. J. Abbott, M. Bronstein, and T. Mulders. Fast deterministic computation of determinants of dense matrices. In Proceedings of ACM International Symposium on Symbolic and Algebraic Computation, pages 197-204. ACM Press, 1999.
2. N. Barić and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In W. Fumy, editor, Advances in Cryptology-EUROCRYPT’ 97, volume 1233 of Lecture Notes in Computer Science, pages 480-494. Springer-Verlag, Berlin Germany, May 1997.
3. M. Bellare and P. Rogaway. Random oracles are practical: Ap aradigm for designing efficient protocols. In V. Ashby, editor, 1st ACM Conference on Computer and Communications Security. ACM Press, Nov. 1993.
4. M. Bellare and P. Rogaway. The exact security of digital signatures—how to sign with RSAan d Rabin. In U. Maurer, editor, Advances in Cryptology-EUROCRYPT’ 96, volume 1070 of Lecture Notes in Computer Science, pages 399-416. Springer-Verlag, Berlin Germany, 12-16 May 1996.
5. D. Boneh. Twenty years of attacks on the RSAc ryptosystem. Notices of the American Mathematical Society, 46(2):203-213, Feb. 1999.
6. D. Boneh and R. Venkatesan. Breaking RSAm ay not be equivalent to factoring. In K. Nyberg, editor, Advances in Cryptology-EUROCRYPT’98, volume 1233 of Lecture Notes in Computer Science, pages 59-71. Springer-Verlag, Berlin Germany, 1998.
7. D. Chaum. Blind signatures for untraceable payments. In D. Chaum, R. Rivest, and A. Sherman, editors, Advances in Cryptology-CRYPTO’82, Lecture Notes in Computer Science, pages 199-203. Plenum Press, New York and London, 1983, Aug. 1982.
8. J. Coron. On the exact security of full domain hash. In M. Bellare, editor, Advances in Cryptology-CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 229-235. Springer-Verlag, Berlin Germany, Aug. 2000.
9. R. Cramer and V. Shoup. Signature schemes based on the strong RSAa ssumption. In 5th ACM Conference on Computer and Communications Security, pages 46-51. ACM Press, Nov. 1999.
10. W. Eberly, M. Giesbrecht, and G. Villard. Computing the determinant and Smith form of an integer matrix. In Proceedings of the 41st Symposium on Foundations of Computer Science. IEEE, 2000.
11. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski Jr., editor, Advances in Cryptology-CRYPTO’97, volume 1294 of Lecture Notes in Computer Science, pages 16-30. Springer-Verlag, Berlin Germany, 17-21 Aug. 1997.
12. R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and-sign signatures without the random oracle. In J. Stern, editor, Advances in Cryptology-EUROCRYPT’99, volume 1592 of Lecture Notes in Computer Science, pages 123-139. Springer-Verlag, Berlin Germany, May 1999.
13. S. Goldwasser, S. Micali, and R. Rivest. Ad igital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, Apr. 1988. Special issue on cryptography.
14. A. Juels, M. Luby, and R. Ostrovsky. Security of blind digital signatures. In B. Kaliski Jr., editor, Advances in Cryptology-CRYPTO’97, volume 1294 of Lecture Notes in Computer Science, pages 150-164. Springer-Verlag, Berlin Germany, 17-21 Aug. 1997.
15. M. Michels, M. Stadler, and H. Sun. The security of some variants of the RSA signature scheme. In Y. Deswarte, editor, Computer Security-ESORICS’98, volume 1485 of Lecture Notes in Computer Science, pages 85-96. Springer-Verlag, Berlin Germany, 1998.
16. D. Pointcheval. Strengthened security for blind signatures. In K. Nyberg, editor, Advances in Cryptology-EUROCRYPT’98, volume 1403, pages 391-405. Springer-Verlag, Berlin Germany, 31-4 June 1998.
17. D. Pointcheval. New public key cryptosystems based on the dependent-RSApro blems. In J. Stern, editor, Advances in Cryptology-EUROCRYPT’99, volume 1592, pages 239-255. Springer-Verlag, Berlin Germany, 1999.
18. D. Pointcheval and J. Stern. Provably secure blind signature schemes. In K. Kim and T. Matsumoto, editors, Advances in Cryptology-ASIACRYPT’96, Lecture Notes in Computer Science, pages 252-265. Springer-Verlag, Berlin Germany, 1996.
19. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361-396, 2000.