Skip to main content
SpringerLink
Log in

ID-Based Series-Parallel Multisignature Schemes for Multi-Messages from Bilinear Maps

  • Conference paper
Coding and Cryptography (WCC 2005)

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

Included in the following conference series:

Abstract

In this paper series-parallel multisignature schemes for multi-messages are investigated. We propose an ID-based series-parallel multisignature scheme (ID-SP-M4M scheme) based on pairings in which signers in the same subgroup sign the same message, and those in different subgroups sign different messages. Our new scheme is an improvement over the series-parallel multisignature schemes introduced by Doi, Mambo and Okamoto [5] and subsequent results such as the schemes proposed by Burmester et al. [4] and the original protocols proposed by Tada [17,18], in which only one message is to be signed. Our ID-SP-M4M scheme is secure against forgery signature attack from parallel insiders under the BDH assumption.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416–432. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Boyd, C.: Digital multisignatures. In: Proc. IMA Conf. Crypto. Coding, pp. 241–246. Clarendon, Oxford (1989)

    Google Scholar 

  4. Burmester, M., Desmedt, Y.G., Doi, H., Mambo, M., Okamoto, E., Tada, M., Yoshifuji, Y.: A structured elGamal-type multisignature scheme. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 466–483. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Doi, H., Mambo, M., Okamoto, E.: Multisignature scheme with specified order. In: SCIS94-2A, Biwako, Japan (1994)

    Google Scholar 

  6. Doi, H., Mambo, M., Okamoto, E.: RSA-based multisignature scheme for various group structure. Journal of Information Processing Society of Japan 41(8), 2080–2091 (2000)

    MathSciNet  MATH  Google Scholar 

  7. Doi, H., Mambo, M., Okamoto, E.: On the security of the RSA-based multisignature scheme for various group structures. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 352–367. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Joux, A.: The Weil and Tate pairings as building blocks for public key cryptosystems. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 20–32. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Kawauchi, K., Komano, Y., Ohta, K., Tada, M.: Probabilistic multi-signature schemes using a one-way trapdoor permutation. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E87-A(5), 1141–1153 (2004)

    Google Scholar 

  11. Kawauchi, K., Minato, H., Miyaji, A., Tada, M.: A multi-signature scheme with signers’ intentions secure against active attacks. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 328–340. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354–368. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Mitomi, S., Miyaji, A.: A general model of multisignature schemes with message flexibility, order flexibility, and order verifiability. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E84-A(10), 2488–2499 (2001)

    MATH  Google Scholar 

  14. Ohta, K., Okamoto, T.: A digital multisignature scheme based on the Fiat-Shamir scheme. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 139–148. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  15. Okamoto, T.: A digital multisignature scheme using bijective public-key cryptosystems. ACM Trans. Computer Systems 6, 432–441 (1988)

    Article  MATH  Google Scholar 

  16. Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: SCIS2000-C20, Okinawa, Japan (2000)

    Google Scholar 

  17. Tada, M.: An order-specified multisignature scheme secure against active insider attacks. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 328–345. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  18. Tada, M.: A secure multisignature scheme with signing order verifiability. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E86-A(1), 73–88 (2003)

    Google Scholar 

  19. Washington, L.C.: Elliptic Curves: Number Theory and Cryptography. Chapman & Hall/CRC, Boca Raton (2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, 305-8573, Japan

    Lihua Wang, Eiji Okamoto, Ying Miao & Takeshi Okamoto

  2. Graduate School of Information Security, Institute of Information Security, Yokohama, 221-0835, Japan

    Hiroshi Doi

Authors
  1. Lihua Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eiji Okamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ying Miao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Takeshi Okamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hiroshi Doi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Informatics, University of Bergen, N-5020, Bergen, Norway

    Øyvind Ytrehus

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, L., Okamoto, E., Miao, Y., Okamoto, T., Doi, H. (2006). ID-Based Series-Parallel Multisignature Schemes for Multi-Messages from Bilinear Maps. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_23

Download citation

  • DOI: https://doi.org/10.1007/11779360_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35481-9

  • Online ISBN: 978-3-540-35482-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation