The Cramer-Shoup strong-RSA signature scheme revisited

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

Volumn 2567, Issue , 2003, Pages 116-129

  Fischlin, Marc ^a  

^a Fraunhofer Institute Secure Telecooperation (SIT)   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY;

GROUP IDENTIFICATION; LINKABLE; RSA SIGNATURE SCHEMES; SIGNATURE SCHEME; STRONG RSA ASSUMPTION; WITHOUT RANDOM ORACLES;

AUTHENTICATION;

EID: 35248856345     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36288-6_9     Document Type: Article

References (18)

1. G. ATENIESE, J. CAMENISCH, M. JOYE, G. TSUDIK: A Practical and Provably Secure Coalition-Resistant Group Signature Scheme, Advances in Cryptology - Crypto 2000, Lecture Notes in Computer Science, Vol. 1880, pp. 255-270, Springer-Verlag, 2000.
2. N. BARIĆ, B. PFITZMANN: Collision-free Accumulators and Fail-Stop Signature Schemes Without Trees, Advances in Cryptology-Eurocrypt '97, Lecture Notes in Computer Science, Vol. 1233, pp. 480-495, Springer-Verlag, 1997.
3. M. BELLARE, M. FISCHLIN, S. GOLDWASSER, S. MICALI: Identification Protocols Secure Against Reset Attacks, Advances in Cryptology-Eurocrypt 2001, Lecture Notes in Computer Science, Vol. 2045, pp. 495-511, Springer-Verlag, 2001.
4. M. BELLARE, P. ROGAWAY: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin, Advances in Cryptology-Eurocrypt '96, Lecture Notes in Computer Science, Vol. 1070, pp. 399-416, Springer-Verlag, 1996.
5. D. BLEICHENBACHER: Efficiency and Security of Cryptosystems Based on Number Theory, Ph.D. thesis, Swiss Federal Institute of Technology, Zürich, 1996.
6. D. BONEH: Twenty Years of Attacks on the RSA Cryptosystem, Notices of the American Mathematical Society (AMS), Vol. 46, No. 2, pp. 203-213, 1999.
7. D. BONEH, M. FRANKLIN: Anonymous Authentication with Subset Queries, Proceedings of the 6th ACM Conference on Computer and Communication Security, pp. 113-119, 1999.
8. R. CRAMER, I. DAMGARD, T. PEDERSEN: Efficient and Provable Security Amplification, CWI Reports, Computer Science, CS-R9529, 1995.
9. R. CRAMER, I. DAMGÅRD, B. SCHOENMAKERS: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, Advances in Cryptology-Crypto'94, Lecture Notes in Computer Science, Vol. 839, pp. 174-187, Springer-Verlag, 1994.
10. R. CRAMER, V. SHOUP: Signature Schemes Based on the Strong RSA Assumption, ACM Transactions on Information and System Security (ACM TISSEC), 3(3), pp. 161-185, 2000.
11. I. DAMGARD, M. KOPROWSKI: Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups, Advances in Cryptology-Eurocrypt 2002, Lecture Notes in Computer Science, Springer-Verlag, 2002.
12. A. DE SANTIS, G. DI CRESCENZO, G. PERSIANO: Communication-Efficient Anonymous Group Identification, Proceedings of the 5th ACM Conference on Computer and Communication Security, pp. 73-82, 1998.
13. E. FUJISAKI, T. OKAMOTO: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations, Advances in Cryptology-Crypto '97, Lecture Notes in Computer Science, vol. 1294, pp. 16-30, Springer Verlag, 1997.
14. C. LEE, X. DENG, H. ZHU: Desing and Security Analysis of Anonymous Group Identifcation Protocols, Public Key Cryptography (PKC) 2002, Lecture Notes in Computer Science, Springer-Verlag, 2002.
15. U. MAURER: Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters, Journal of Cryptology, vol. 8, pp. 123-155, Springer-Verlag, 1995.
16. T. OKAMOTO: Provable Secure and Practical Identification Schemes and Corresponding Signature Schemes, Advances in Cryptology-Crypto '92, Lecture Notes in Computer Science, vol. 740, pp. 31-53, Springer Verlag, 1993.
17. RSA CRYPTOGRAPHY STANDARD: PKCS #1 v2.1, available at www.rsa.security.com/rsalabs/pkcs, June 2002.
18. T. SCHWEINBERGER, V. SHOUP: ACE -The Advanced Cryptographic Engine, available at www.shoup.net, August 2002.