Transitive signatures based on factoring and rsa

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

Volumn 2501, Issue , 2002, Pages 397-414

  Bellare, Mihir ^a   Neven, Gregory ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

RSA; Signatures; Transitive signatures

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

SIGNATURES; TRANSITIVE SIGNATURES;

NETWORK SECURITY;

EID: 84958775356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36178-2_25     Document Type: Conference Paper

References (16)

1. M. Abdalla and L. Reyzin. A new forward-secure digital signature scheme. Advances in Cryptology – ASIACRYPT’00, Lecture Notes in Computer Science Vol. 1976, T. Okamoto ed., Springer-Verlag, 2000.
2. M. Bellare, C. Namprempre, D. Pointcheval and M. Semanko. The One-More-RSA-Inversion problems and the security of Chaum’s blind signature scheme. Cryptology ePrint Archive: Report 2001/002, http://eprint.iacr.org/2001/002/. Preliminary version, entitled “The power of RSA inversion oracles and the security of Chaum’s RSA-based blind signature scheme,” in Financial Cryptography’01, Lecture Notes in Computer Science Vol. 2339, P. Syverson ed., Springer-Verlag, 2001.
3. M. Bellare and G. Neven. Transitive signatures based on factoring and RSA. Full version of this abstract, available via http://www-cse.ucsd.edu/users/mihir.
4. M. Bellare and A. Palacio. GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks. Advances in Cryptology – CRYPTO’02, Lecture Notes in Computer Science Vol. 2442, M. Yung ed., Springer-Verlag, 2002.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. Proceedings of the 1st Annual Conference on Computer and Communications Security, ACM, 1993.
6. S. Chari, T. Rabin and R. Rivest. An efficient signature scheme for route aggregation. Manuscript, February 2002. http://theory.lcs.mit.edu/˜rivest/publications.html.
7. D. Chaum. Blind signatures for untraceable payments. Advances in Cryptology – CRYTPO 82Pro ceedings, D. Chaum, R. Rivest and A. Sherman eds., Plenum Press.
8. O. Goldreich, S. Goldwasser and S. Micali. How to construct random functions. Journal of the ACM, Vol. 33, No. 4, 1986, pp. 210–217.
9. S. Goldwasser, S. Micali and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, Vol. 17, No. 2, April 1988, pp. 281–308.
10. L. Guillou and J. J. Quisquater. A “paradoxical” identity-based signature scheme resulting from zero-knowledge. Advances in Cryptology – CRYPTO’88, Lecture Notes in Computer Science Vol. 403, S. Goldwasser ed., Springer-Verlag, 1988.
11. R. Johnson, D. Molnar, D. Song and D. Wagner. Homomorphic signature schemes. Topics in Cryptology – CT-RSA’02, Lecture Notes in Computer Science Vol. 2271, B. Preneel ed., Springer-Verlag, 2002.
12. S. Micali and R. Rivest. Transitive signature schemes. Topics in Cryptology – CT-RSA’02, Lecture Notes in Computer Science Vol. 2271, B. Preneel ed., Springer-Verlag, 2002.
13. S. Micali and L. Reyzin. Improving the exact security of digital signature schemes. Journal of Cryptology, Vol. 15, Number 1, 2002, pp. 1–18.
14. R. Rivest. Two signature schemes. Slides from talk given at Cambridge University, October 17, 2000.
15. http://theory.lcs.mit.edu/˜rivest/publications.html.
16. R. Steinfeld, L. Bull and Y. Zheng. Content Extraction Signatures. Information Security and Cryptology – ICISC 2001, Lecture Notes in Computer Science Vol. 2288, K. Kim ed., Springer-Verlag, 2002.