Skip to main content
Log in

Efficient batch verification of online/offline short signature for a multi-signer setting

  • Published:
Wuhan University Journal of Natural Sciences

Abstract

In this paper, we propose a method to construct an online/offline batch verification signature scheme in a multi-signer setting. The length of the scheme is approximately 480 bits. Based on the Lysyanskaya, Rivest, Sahai and Wolf (LRSW) assumption, this scheme is proved secure in a random oracle model, and it requires only three pairing operations for verifying n signatures from a multi-signer setting.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Even S, Goldreich O, Micali S. Online/offline digital signatures [C]// Advances in Cryptology — Crypto 1989. Berlin: Springer-Verlag, 1989: 263–277.

  2. Guo Fuchun, Mu Yi, Chen Zhide. Efficient batch verification of short signatures for a single-signer setting without random oracles [C]// The Third International Workshop on Security (IWSEC 2008). Berlin: Springer-Verlag, 2008: 49–63.

    Google Scholar 

  3. Shamir A, Tauman Y. Improved online/offline signature schemes [C]// Advances in Cryptology — Crypto 2001. Berlin: Springer-Verlag, 2001: 355–367.

    Google Scholar 

  4. Guo F, Mu Y. Optimal online/offline signature: How to sign a message without online computation [C] // Proceedings of ProvSec. Berlin: Springer-Verlag, 2008: 98–111.

    Google Scholar 

  5. Kurosawa K, Schmidt-Samoa K. New online/online signature schemes without random oracles [C]// Proceedings of Public Key Cryprography’06. Berlin: Springer-Verlag, 2006: 330–346.

    Google Scholar 

  6. Catalano D, Di Raimondo M, Fiore D, et al. Off-line/on-line signatures: theoretical aspects and experimental results [C]// Proceedings of Public Key Cryptography’08. Berlin: Springer-Verlag, 2008: 101–120.

    Google Scholar 

  7. Bresson E, Catalano D, Gennaro R. Improved on-line/off- Line threshold signatures [C]// Proceedings of Public Key Cryptography’ 07. Berlin: Springer-Verlag, 2007: 217–232.

    Google Scholar 

  8. Xu S, Mu Y, Susilo W. Online/offline signatures and multisignatures for aodv and dsr routing security [C]// 11th Australasian Conference on Information Security and Privacy 2006. Berlin: Springer-Verlag, 2006: 99–110.

    Google Scholar 

  9. Yu P, Tate S R. Online/offline signature schemes for devices with limited computing capabilities [C]// The CryptographersTrack at the RSA Conference. Berlin: Springer-Verlag, 2006: 301–317.

    Google Scholar 

  10. Fiat A. Batch RSA [C]// Advances in Cryptology-CRYPTO’ 89. Berlin: Springer-Verlag, 1989: 175–185.

    Google Scholar 

  11. Naccache D, MRaĭhi D, Vaudenay S, et al. Can D.S.A. be improved complexity trade-offs with the digital signature standard [C]// Adavances in Cryptology-EUROCRYPT’94. Berlin: Springer-Verlag, 1994: 77–85.

    Google Scholar 

  12. Yen S M, Laih S C. Improved digital signature suitable for batch verification [J]. IEEE Trans Comput, 1995, 44(7): 957–959.

    Article  MATH  Google Scholar 

  13. Bellare M, Garay J A, Tal Rabin. Fast batch verification for modular exponentiation and digital signatures [C] //Advances in Cryptology — EUROCRYPT’ 98. Berlin: Springer-Verlag, 1998: 236–250.

    Google Scholar 

  14. Yoon H, Cheon J H, Kim Y. Batch verifications with ID-based signatures [C]// Information Security and Cryptology 2004. Berlin: Springer-Verlag, 2004: 233–248.

    Google Scholar 

  15. Camenisch J, Hohenberger S, Pedersen M. Batch verification of short signatures [C]// Advances in Cryptology — EUROCRYPT’ 07. Berlin: Springer-Verlag, 2007: 246–263.

    Google Scholar 

  16. Lysyanskaya A, Rivest Ron, Sahai A, et al. Pseudonym systems [C]// Selected Areas in Cryptography. Berlin: Springer- Verlag, 1999: 184–199.

    Google Scholar 

  17. Lim C H. Efficient multi-exponentiation and application to batch verification of digital signatures[EB/OL]. [2000-05-12]. http://dasan.sejong.ac.kr/chlim/pub/multi exp.ps.

  18. Granger R, Smart N P. On Computing Products of Pairings [R]. CSTR-06-013, Bristol: University of Bristol, 2006: 1–11.

    Google Scholar 

  19. Gentry C. Practical identity-based encryption without random oracles [C]// Advance of Eurocrypt’06. Berlin: Springer-Verlag, 2006: 445–464.

    Google Scholar 

  20. Boneh D, Lynn B, Shacharm H. Short Signatures from the weil pairing [C]// 7th Inter Conf on the Theory and Application of Cryptology and Information Security. Berlin: Springer-Verlag, 2001: 514–532.

    Google Scholar 

  21. Waters B. Efficient identity-based encryption without random oracles [C]// 24th Annual Eurocrypt Conference. Berlin: Springer-Verlag, 2005: 114–127.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhide Chen.

Additional information

Foundation item: Supported by the National Natural Science Foundation of China(61072080), the Foundation of Education Bureau of Fujian Province (JK2010012), and Key Project of Services for Haixia Construction in Universities of Fujian Province

Biography: CHEN Zhide, male, Associate professor, Ph.D., research direction: cryptography and network security.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Z., Zhang, Y., Xu, L. et al. Efficient batch verification of online/offline short signature for a multi-signer setting. Wuhan Univ. J. Nat. Sci. 16, 481–486 (2011). https://doi.org/10.1007/s11859-011-0785-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11859-011-0785-0

Key words

CLC number

Navigation