Skip to main content
Springer Nature Link
Log in

Directed Transitive Signature Scheme

  • Conference paper
Topics in Cryptology – CT-RSA 2007 (CT-RSA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4377))

Included in the following conference series:

Abstract

In 2002, Micali and Rivest raised an open problem as to whether directed transitive signatures exist or not. In 2003, Hohenberger formalized the necessary mathematical criteria for generic directed transitive signature scheme, showing that the edge signatures in such a scheme form a special (and powerful) mathematical group, called Abelian trapdoor group with infeasible inversion, which is not known to exist. In this paper, we consider a directed graph whose transitive reduction is a directed tree, on which we propose a natural RSA-based directed transitive signature scheme \(\mathcal{RSADTS}\). In this particular case, we have answered the open problem raised by Micali and Rivest. We have proved that \(\mathcal{RSADTS}\), associated to a standard digital signature scheme, is transitively unforgeable under adaptive chosen-message attack if the RSA inversion problem over a cyclic group is hard and the standard digital signature is secure. Furthermore, \(\mathcal{RSADTS}\) has even better performance than \(\mathcal{RSATS}\)-1 in certain circumstance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Micali, S., Rivest, R.: Transitive signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 236–243. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Bellare, M., Neven, G.: Transitive signature based on factoring and RSA. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 397–414. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Bellare, M., Neven, G.: Transitive signatures: new schemes and proofs. IEEE Transactions on Information Theory 51(6), 2133–2151 (2005)

    Article  MathSciNet  Google Scholar 

  4. Okamoto, T.: Provably secure and practical identification schemes and corresponding signature schemes. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 31–53. Springer, Heidelberg (1993)

    Google Scholar 

  5. Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, Heidelberg (1990)

    Google Scholar 

  6. Shahandashti, S.F., Salmasizadeh, M., Mohajeri, J.: A provably secure short transitive signature scheme from bilinear group pairs. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 60–76. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing 17(2), 281–308 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The One-more-RSA-inversion problems and the security of Chaum’s blind signature scheme. Journal of Cryptology 16(3), 185–215 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Chaum, D.: Blind signatures for untraceable payments. In: Proc. Crypto 1982, pp. 199–203 (1982)

    Google Scholar 

  10. Bellare, M., Palacio, A.: GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attack. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 162–177. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Guillou, L.C., Quisquater, J.J.: A ‘paradoxical’ identity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 216–231. Springer, Heidelberg (1990)

    Google Scholar 

  12. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In: Proc. Public-Key Cryptography 2003, pp. 31–46 (2003)

    Google Scholar 

  14. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proc. 1st Conf. Computer and Communications Security, Fairfax, VA, November 1993, pp. 62–73 (1993)

    Google Scholar 

  15. Hohenberger, S.R.: The cryptographic impact of groups with infeasible inversion, Master’s Thesis, MIT, MA (May 2003)

    Google Scholar 

  16. Sadeghi, A.R., Steiner, M.: Assumptions related to discrete logarithms: Why subtleties make a real difference. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 244–261. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Kuwakado, H., Tanaka, H.: Transitive signature scheme for directed trees. IEICE Trans. Fundamentals E86-A(5), 1120–1126 (2003)

    Google Scholar 

  18. Yi, X., Tan, C.H., Okamoto, E.: Security of Kuwakado-Tanaka transitive signature scheme for directed trees. IEICE Trans. Fundamentals E87-A(4), 955–957 (2004)

    Google Scholar 

  19. Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers. Oxford University Press, Oxford (1979)

    MATH  Google Scholar 

  20. Ribenboim, P.: The New Book of Prime Number Records, 3rd edn. Springer, New York (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Mathematics, Victoria University, PO Box 14428, Melbourne City MC, Victoria, 8001, Australia

    Xun Yi

Authors
  1. Xun Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Sharing Platform Laboratories, NTT Corporation, Japan

    Masayuki Abe

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yi, X. (2006). Directed Transitive Signature Scheme. In: Abe, M. (eds) Topics in Cryptology – CT-RSA 2007. CT-RSA 2007. Lecture Notes in Computer Science, vol 4377. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11967668_9

Download citation

  • DOI: https://doi.org/10.1007/11967668_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69327-7

  • Online ISBN: 978-3-540-69328-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics