Directed transitive signature scheme

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

Volumn 4377 LNCS, Issue , 2007, Pages 129-144

  Yi, Xun ^a  

^a VICTORIA UNIVERSITY   (Australia)

Author keywords

Directed transitive signature; RSA inversion problem over a cyclic group; Transitive closure and reduction

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; DECISION TREES; GROUP THEORY; TREES (MATHEMATICS);

CHOSEN MESSAGE ATTACKS; CYCLIC GROUP; DIGITAL SIGNATURE SCHEMES; DIRECTED TRANSITIVE SIGNATURES; DIRECTED TREES; INVERSION PROBLEMS; TRANSITIVE CLOSURE; TRANSITIVE REDUCTIONS;

DIRECTED GRAPHS;

EID: 84992493441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11967668_9     Document Type: Conference Paper

References (20)

1. S. Micali and R. Rivest, “Transitive signature schemes”, Proc. CT-RSA’02, pp. 236-243, San Jose, CA, USA, Feb. 2002.
2. M. Bellare and G. Neven, “Transitive signature based on factoring and RSA”, Proc. Asiacrypt’02, pp. 397-414, Queenstown, New Zealand, Dec. 2002.
3. M. Bellare and G. Neven, “Transitive signatures: new schemes and proofs”, IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 2133-2151, 2005.
4. T. Okamoto, “Provably secure and practical identification schemes and corresponding signature schemes”, Proc. Crypto’92, pp. 31-53, 1993.
5. C. P. Schnorr, “Efficient identification and signatures for smart cards”, Proc. Crypto’89, pp. 239-252, 1989.
6. S. F. Shahandashti, M. Salmasizadeh, and J. Mohajeri, “A provably secure short transitive signature scheme from bilinear group pairs”, Proc. SCN’04, pp. 60-76, Amalfi, Italy, Sept 2004.
7. 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, pp. 281-308, 1988.
8. M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko, “The One-more-RSA-inversion problems and the security of Chaum’s blind signature scheme”, Journal of Cryptology, vol. 16, no. 3, pp. 185-215, 2003.
9. D. Chaum, “Blind signatures for untraceable payments”, Proc. Crypto’82, pp. 199-203, 1982.
10. M. Bellare and A. Palacio, “GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attack”, Proc. Crypto’02, pp. 162-177, Aug 2002.
11. L. C. Guillou and J. J. Quisquater, “A ‘paradoxical’ identity-based signature scheme resulting from zero-knowledge”, Proc. Crypto’88, pp. 216-231, 1988.
12. D. Boneh, B. Lynn, and H. Shacham, “Short signatures from the Weil pairing”, Proc. Asiacrypt’01, pp. 514-532, 2001.
13. A. Boldyreva, “Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme”, Proc. Public-Key Cryptography 2003, pp. 31-46, 2003.
14. M. Bellare and P. Rogaway, “Random oracles are practical: A paradigm for designing efficient protocols”, Proc. 1st Conf. Computer and Communications Security, pp. 62-73, Fairfax, VA, Nov 1993.
15. S. R. Hohenberger, “The cryptographic impact of groups with infeasible inversion”, Master’s Thesis, MIT, MA, May 2003.
16. A. R. Sadeghi and M. Steiner, “Assumptions related to discrete logarithms: Why subtleties make a real difference”, Proc. Eurocrypt’01, pp. 244-261, 2001.
17. H. Kuwakado and H. Tanaka, “Transitive signature scheme for directed trees”, IEICE Trans. Fundamentals, vol. E86-A, no. 5, pp. 1120-1126, May 2003.
18. X. Yi, C. H. Tan and E. Okamoto, “Security of Kuwakado-Tanaka transitive signature scheme for directed trees”, IEICE Trans. Fundamentals, vol.E87-A, no. 4, pp. 955-957, Apr 2004.
19. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Oxford University Press, 1979.
20. P. Ribenboim, The New Book of Prime Number Records, 3rd Edition, Springer-Verlag, New York, NY, 1995.