Skip to main content

Two Simple Batch Verifying Multiple Digital Signatures

  • Conference paper
  • First Online:
Book cover Information and Communications Security (ICICS 2001)

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

Included in the following conference series:

Abstract

In this article, we propose two types of multiple digital signatures for batch verification. our schemes not only efficient to reduce computation of verifying these signatures, but also secure to detect forged multiple digital signatures.

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

Access this chapter

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. C. C. Chang and M. S. Hwang, “Parallel computation of the generating keys for RSA cryptosystems,” IEE Electronics Letters, vol. 32, no. 15, pp. 1365–1366, 1996.

    Article  Google Scholar 

  2. L. Harn, “Batch verifying multiple DSA-type digital signatures,” Electronics Letters, vol. 34, no. 9, pp. 870–871, 1998.

    Article  Google Scholar 

  3. L. Harn, “Batch verifying multiple RSA digital signatures,” Electronics Letters, vol. 34, no. 12, pp. 1219–1220, 1998.

    Article  Google Scholar 

  4. L. Harn and Y. Xu, “Design of generalisedElGamal type digital signature schemes basedon discrete logarithm,” Electronics Letters, vol. 30, no. 24, pp. 2025–2026, 1994.

    Article  Google Scholar 

  5. M. S. Hwang, I. C. Lin, and K. F. Hwang, “Cryptanalysis of the batch verifying multiple RSA digital signatures,” Informatica, vol. 11, no. 1, pp. 15–19, 2000.

    MATH  MathSciNet  Google Scholar 

  6. M. S. Hwang, C. C. Chang, and K. F. Hwang, “An ElGamal-like cryptosystem for enciphering large messages,” accepted and to appear in IEEE Transactions on Knowledge and Data Engineering.

    Google Scholar 

  7. C. H. Lim and P. J. Lee, “Security of interactive DSA batch verification,” Electronics Letters, vol. 30, no. 19, pp. 1592–1593, 1994.

    Article  Google Scholar 

  8. D. Naccache, D. Mraihi, D. Rapheali, and S. Vaudenay, “Can DSA be improved: Complexity trade-offs with the digital signature standard,” in Proceedings of Eurocrypt’94, pp. 85–94, Lecture Notes in Computer Science, 1994.

    Google Scholar 

  9. R. L. Rivest, A. Shamir, and L. Adleman, “A methodfor obtaining digital signatures andpublic key cryptosystems,” Communications of the ACM, vol. 21, pp. 120–126, Feb. 1978.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Min-Shiang, H., Cheng-Chi, L., Yuan-Liang, T. (2001). Two Simple Batch Verifying Multiple Digital Signatures. In: Qing, S., Okamoto, T., Zhou, J. (eds) Information and Communications Security. ICICS 2001. Lecture Notes in Computer Science, vol 2229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45600-7_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-45600-7_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics