Encyclopedia of Cryptography and Security

2005 Edition
| Editors: Henk C. A. van Tilborg

Strong RSA Assumption

  • Dan Boneh
Reference work entry
DOI: https://doi.org/10.1007/0-387-23483-7_414
Let \(1 < \tau \in \mathbb{Z}\)
This is a preview of subscription content, log in to check access.


  1. [1]
    Ateniese, Giuseppe, Jan Camenisch, Marc Joye, and Gene Tsudik (2000). “A practical and provably secure coalition-resistant group signature scheme.” Advances in Cryptology—CRYPTO 2000, August, Lecture Notes in Computer Science, vol. 1880, ed. M. Bellare. Springer-Verlag, Berlin, 255–70.Google Scholar
  2. [2]
    Baric, N. and B. Pfitzman (1997). “Collision-free accumulators and fail-stop signature schemes without trees.” Proceedings of Eurocrypt, Lecture Notes in Computer Science, vol. 1233, ed. W. Fumy. Springer-Verlag, Berlin, 480–494.Google Scholar
  3. [3]
    Cramer, Ronald and Victor Shoup (2000). “Signature schemes based on the strong RSA assumption.” ACM Transactions on Information and System Security (ACM TISSEC), 3 (3), 161–185, extended abstract in Proc. 6th ACM Conf. on Computer and Communications Security, 1999.Google Scholar
  4. [4]
    Gennaro, Rosario, Shai Halevi, and Tal Rabin (1999). “Secure hash-and-sign signatures without the random oracle.” Advances in Cryptology—EUROCRYPT'99, Lecture Notes in Computer Science, vol. 1592, ed. J. Stern. Springer-Verlag, Berlin, 123–139.Google Scholar

Copyright information

© International Federation for Information Processing 2005

Authors and Affiliations

  • Dan Boneh

There are no affiliations available