A simple transitive signature scheme for directed trees

Theoretical Computer Science

Volumn 396, Issue 1-3, 2008, Pages 277-282

  Neven, Gregory ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PATTERN RECOGNITION; PUBLIC KEY CRYPTOGRAPHY;

COMPUTATION TIME; TRANSITIVE SIGNATURES;

TREES (MATHEMATICS);

EID: 42149108421     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.01.042     Document Type: Article

References (13)

1. Ateniese G., Chou D.H., deMedeiros B., and Tsudik G. Sanitizable signatures, in: 10th European Symposium on Research in Computer Security. ESORICS 2005. Lecture Notes in Computer Science vol. 3679 (2005), Springer-Verlag 159-177
2. Bellare M., and Neven G. Transitive signatures based on factoring and RSA. In: Zheng Y. (Ed). Advances in Cryptology (ASIACRYPT2002). Lecture Notes in Computer Science vol. 2501 (2002), Springer-Verlag 397-414
3. Bellare M., and Neven G. Transitive signatures: New schemes and proofs. IEEE Transactions on Information Theory 51 6 (2005) 2133-2151
4. Boneh D., Gentry C., Lynn B., and Shacham H. Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham E. (Ed). Advances in Cryptology (EUROCRYPT2003). Lecture Notes in Computer Science vol. 2656 (2003), Springer-Verlag 416-432
5. S. Chari, T. Rabin, R. Rivest, An efficient signature scheme for route aggregation, 2002 (unpublished manuscript)
6. Goldwasser S., Micali S., and Rivest R.L. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17 2 (1988) 281-308
7. Hevia A., and Micciancio D. The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. In: Zheng Y. (Ed). Advances in Cryptology (ASIACRYPT2002). Lecture Notes in Computer Science vol. 2501 (2002), Springer-Verlag 379-396
8. S. Hohenberger, The cryptographic impact of groups with infeasible inversion, Master's Thesis, Massachusetts Institute of Technology, 2003
9. Johnson R., Molnar D., Song D.X., and Wagner D. Homomorphic signature schemes. In: Preneel B. (Ed). Topics in Cryptology (CT-RSA 2002). Lecture Notes in Computer Science vol. 2271 (2002), Springer-Verlag 244-262
10. Micali S., and Rivest R.L. Transitive signature schemes. In: Preneel B. (Ed). Topics in Cryptology (CT-RSA 2002). Lecture Notes in Computer Science vol. 2271 (2002), Springer-Verlag 236-243
11. R. Rivest, Two signature schemes, Slides from talk given at Cambridge University, October 17, 2000
12. Rompel J. One-way functions are necessary and sufficient for secure signatures. 22nd Annual ACM Symposium on Theory of Computing (1990), ACM Press 387-394
13. Yi X. Topics in Cryptology (CT-RSA 2007). In: Abe M. (Ed). Lecture Notes in Computer Science vol. 4377 (2007), Springer-Verlag 129-144