Skip to main content
SpringerLink
Log in

A Nyberg-Rueppel Signature for Multiple Messages and Its Batch Verification

  • Conference paper
  • First Online:
Information Security (ISC 2002)

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

Included in the following conference series:

  • 821 Accesses

Abstract

We propose a Nyberg-Rueppel message recovery signature scheme for multiple messages which produces one signature for multiple messages and has its batch verification of the signature for multiple messages. The length of the signature is shorter than the sum of length of corresponding signatures produced by the ordinary digital signature scheme, separately. In the signature generation and the verification of our scheme, the number of exponentiations is constant independent of the number of messages.

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. Bellare, M., Garay, J. A., Rabin, T.: Fast Batch Verification for Modular Exponentiation and Digital Signatures. Advances in Cryptology-EUROCRYPTO’98, Lecture Notes in Computer Science Vol. 1403, Springer-Verlag, (1998) 236–250

    Chapter  Google Scholar 

  2. ElGamal, T.: A Public Key Cryptosystem and A Signature Scheme Based on Discrete Logarithms. IEEE Trans. on Information Theory, Vol. IT-31 (1985) 469–472

    Article  MathSciNet  Google Scholar 

  3. Fiat, A.: Batch RSA. Advances in Cryptology-CRYPTO’89, Lecture Notes in Computer Science, Vol. 435, Springer-Verlag, (1989) 175–185

    Google Scholar 

  4. Harn, L.: DSA Type Secure Interactive Batch Verification Protocols. Electronics Letters, Vol. 31, No. 4, (1995) 257–258

    Article  Google Scholar 

  5. Naccache, D., M'rãihi, D., Vaudenay, S., Ráphaeli, D.: Can D.S.A. be Improved?-Complexity Trade-Offs with the Digital Signature Standard-. Advances in Cryptology-EUROCRYPT’94, Lecture Notes in Computer Science, Vol. 950, Springer-Verlag, (1995) 77–85

    Chapter  Google Scholar 

  6. Nyberg, K., Rueppel, R.A.: Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem. Advances in Cryptology-EUROCRYPT’94, Lecture Notes in Computer Science, Vol. 950, Springer-Verlag, (1995) 175–190

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Electronics, Kyushu Institute of Technology, 680-4 Kawazu, Iizuka, 820-8502, Fukuoka, Japan

    Shunsuke Araki

Authors
  1. Shunsuke Araki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computer Science, Northeastern University, 02115, Boston, MA, USA

    Agnes Hui Chan

  2. Department of Electrical and Computer Engineering, University of Maryland, 20742, College Park, MD, USA

    Virgil Gligor

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Araki, S. (2002). A Nyberg-Rueppel Signature for Multiple Messages and Its Batch Verification. In: Chan, A.H., Gligor, V. (eds) Information Security. ISC 2002. Lecture Notes in Computer Science, vol 2433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45811-5_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45811-5_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45811-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation