Skip to main content

A Multisignature Scheme with Message Flexibility, Order Flexibility and Order Verifiability

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1841))

Abstract

Multisignature scheme realizes that plural users generate the signature on a message, and that the signature is verified. Various studies on multisignature have been proposed([4,13,11,8,1]). They are classified into two types: RSA([9])-based multisignature([4, 8]), and discrete logarithm problem(DLP) based multisignature([13,11,1]), all of which assume that a message is fixed beforehand. In a sense, these protocols do not have a feature of message flexibility. Furthermore all schemes which satisfy with order verifiability designate order of signers beforehand [13,1]. Therefore these protocols have a feature of order verifiability but not order flexibility.

For a practical purpose of circulating messages soundly through Internet, a multisignature scheme with message flexibility, order flexibility and order verifiability should be required. However, unfortunately, all previous multisignature do not realize these features. In this paper, we propose a multisignature scheme with flexibility and verifiability. We also present two practical schemes based on DLP based message recover signature([7]) and RSA signature([4]), respectively.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burmester, M., Desmedt, Y., 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–482. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Specification for a digital signature standard, National Institute for Standards and Technology, Federal Information Standard Publication XX, draft (1991)

    Google Scholar 

  3. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory IT-31, 469–472 (1985)

    Article  MathSciNet  Google Scholar 

  4. Itakura, K., Nakamura, K.: A public-key cryptosystem suitable for digital multisignatures. NEC J.Res.Dev.71(October 1983)

    Google Scholar 

  5. Knuth, D.E.: The art of computer programming, Seminumerical Algorithms, 2nd edn., vol. 2. Addison-Wesley, Reading (1981)

    Google Scholar 

  6. Miyaji, A.: Another countermeasure to forgeries over message recovery signature. IEICE Trans., Fundamentals E80-A(11), 2192–2200 (1997)

    Google Scholar 

  7. Nyberg, K., Rueppel, R.A.: Message recovery for signature schemes based on the discrete logarithm problem. Designs Codes and Cryptography 7, 61–81 (1996)

    MATH  Google Scholar 

  8. Okamoto, T.: A digital Multisignature Scheme Using Bijective Public-key Cryptosystems. ACM Trans. on Computer Systems 6(8), 432–441 (1988)

    Article  Google Scholar 

  9. Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  10. Sakurai, K., Shizuya, H.: Relationships among the computational powers of breaking Discrete Log cryptosystem. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 341–355. Springer, Heidelberg (1995); J. Cryptology 11, 29-43 (1998)

    Google Scholar 

  11. Shimbo, A.: Multisignature Schemes Based on the Elgamal Scheme. In: The 1994 Symposium on Cryptography and Information Security, SCIS94-2C (January 1994)

    Google Scholar 

  12. Schnorr, C.P.: Efficient signature generation by smart cards. Journal of cryptology 4, 161–174 (1991)

    Article  MATH  Google Scholar 

  13. Saito, T.: A Multiple Signature Scheme Enabling a Specified Signer’s Order. In: The 1997 Symposium on Cryptography and Information Security, SCIS97-33A (January 1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mitomi, S., Miyaji, A. (2000). A Multisignature Scheme with Message Flexibility, Order Flexibility and Order Verifiability. In: Dawson, E.P., Clark, A., Boyd, C. (eds) Information Security and Privacy. ACISP 2000. Lecture Notes in Computer Science, vol 1841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10718964_25

Download citation

  • DOI: https://doi.org/10.1007/10718964_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67742-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics