Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Security and Cryptology

Inscrypt 2010: Information Security and Cryptology pp 350–358Cite as

Online/Offline Verification of Short Signatures

  • Conference paper

  • 813 Accesses

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

Abstract

Fast signature verification is desirable in many applications, especially when signature recipients need to make response quickly. In this paper, we present an efficient online/offline verification of short signature (OVS) scheme without random oracles. Besides message signing, signature verification can be also separated into offline phase and online phase. Only one multi-exponentiation is required for the verifier in the online phase. In addition, our signature is short which gives about 480 bits for 80-bit security. Our scheme indeed improves the efficiency of signature verification since no pairing operation is required in the online phase. We also give a generic construction of OVS schemes using the idea of double trapdoor chameleon hash.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bellare, M., Garay, J., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236–250. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Bresson, E., Catalano, D., Gennaro, R.: Improved on-line/Off-line threshold signatures. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 217–232. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Camenisch, J.L., Hohenberger, S., Pedersen, M.Ø.: Batch verification of short signatures. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 246–263. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56–72. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Catalano, D., Di Raimondo, M., Fiore, D., Gennaro, R.: Off-line/on-line signatures: theoretical aspects and experimental results. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 101–120. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Gao, C., Wei, B., Xie, D., Tang, C.: Divisible on-Line/off-Line signatures. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 148–163. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Guo, F., Mu, Y.: Optimal online/Offline signature: How to sign a message without online computation. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol. 5324, pp. 98–111. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Hohenberger, S., Waters, B.: Realizing hash-and-sign signatures under standard assumptions. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 333–350. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Krawczyk, H., Rabin, T.: Chameleon signatures. In: NDSS 2000, pp. 143–154. Internet Society, San Diego (2000)

    Google Scholar 

  12. Kurosawa, K., Schmidt-Samoa, K.: New online/Offline signature schemes without random oracles. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 330–346. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Au, M.H., Susilo, W., Mu, Y.: Is the Notion of Divisible On-Line/Off-Line Signatures Stronger than On-Line/Off-Line Signatures? In: Pieprzyk, J., Zhang, F. (eds.) ProvSec 2009. LNCS, vol. 5848, pp. 129–139. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Shamir, A., Tauman, Y.: Improved online/offline signature schemes. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 355–367. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Even, S., Goldreich, O., Micali, S.: On-line/Off-line digital signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 263–275. Springer, Heidelberg (1990)

    Google Scholar 

  16. Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Xu, S., Mu, Y., Susilo, W.: Online/Offline Signatures and Multisignatures for AODV and DSR Routing Security. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol. 4058, pp. 99–110. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  18. Yu, P., Tate, S.R.: Online/Offline signature schemes for devices with limited computing capabilities. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 301–317. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Lab of Network Security and Cryptology, School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, China

    Yilian Zhang & Zhide Chen

  2. Centre for Computer and Information Security Research, School of Computer Science and Software Engineering, University of Wollongong, Wollongong, NSW2522, Australia

    Fuchun Guo

Authors
  1. Yilian Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhide Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fuchun Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiaotong University, Dongchuan Road 800, 200240, Shanghai, China

    Xuejia Lai

  2. Columbia University, USA

    Moti Yung

  3. State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China

    Dongdai Lin

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Y., Chen, Z., Guo, F. (2011). Online/Offline Verification of Short Signatures. In: Lai, X., Yung, M., Lin, D. (eds) Information Security and Cryptology. Inscrypt 2010. Lecture Notes in Computer Science, vol 6584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21518-6_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21518-6_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21517-9

  • Online ISBN: 978-3-642-21518-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation