Skip to main content
SpringerLink
Log in

An Identity-Based Blind Signature Scheme with Message Recovery from Pairings

  • Conference paper
  • First Online:
Applied Cryptography and Network Security Workshops (ACNS 2021)

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

Included in the following conference series:

Abstract

As a variant of digital signature schemes, the blind signature enables that the signer signs a message without knowing its content. In identity-based cryptography, many blind signature schemes have been proposed. Among them, Verma et al. designed an identity-based blind signature scheme with message recovery (IDBS-MR). Unfortunately, after our cryptanalysis, their scheme cannot satisfy untraceability, which enables the signer to break the anonymity of users by tracking the previous signature transmission scripts. To solve the problem, we construct a new IDBS-MR scheme using the bilinear pairing and demonstrates that the proposed scheme has blindness, untraceability, and unforgeability in the random oracle model. Performance results show that compared with Verma et al.’s scheme, the proposed scheme has the same computation costs in views of signers, twice computation costs in views of users, but reduces 36% computation costs in views of verifiers.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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

References

  1. Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Technical report, Manubot (2019)

    Google Scholar 

  2. Wood, G., et al.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Project Yellow Paper 151(2014), 1–32 (2014)

    Google Scholar 

  3. Sasson, E.B., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459–474. IEEE (2014)

    Google Scholar 

  4. Sun, S.-F., Au, M.H., Liu, J.K., Yuen, T.H.: RingCT 2.0: a compact accumulator-based (linkable ring signature) protocol for blockchain cryptocurrency monero. In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017. LNCS, vol. 10493, pp. 456–474. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66399-9_25

    Chapter  Google Scholar 

  5. Camenisch, J.: Group signature schemes and payment systems based on the discrete logarithm problem. Ph.D. thesis, ETH Zurich (1998)

    Google Scholar 

  6. Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology, pp. 199–203. Springer, Boston, MA (1983). https://doi.org/10.1007/978-1-4757-0602-4_18

    Chapter  Google Scholar 

  7. Chang, C.-C., Lee, J.-S.: An anonymous voting mechanism based on the key exchange protocol. Comput. Secur. 25(4), 307–314 (2006)

    Article  Google Scholar 

  8. Delaune, S., Kremer, S., Ryan, M.: Coercion-resistance and receipt-freeness in electronic voting. In: 19th IEEE Computer Security Foundations Workshop (CSFW 2006), pp. 12-pp. IEEE (2006)

    Google Scholar 

  9. Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985). https://doi.org/10.1007/3-540-39568-7_5

    Chapter  Google Scholar 

  10. Nyberg, K., Rueppel, R.A.: A new signature scheme based on the DSA giving message recovery. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 58–61 (1993)

    Google Scholar 

  11. Han, S., Chang, E.: A pairing-based blind signature scheme with message recovery. Int. J. Inf. Technol. 2(4), 187–192 (2005)

    Google Scholar 

  12. Elkamchouchi, H.M., Abouelseoud, Y.: A new blind identity-based signature scheme with message recovery. IACR Cryptology ePrint Archive, 2008:38 (2008)

    Google Scholar 

  13. Diao, L., Gu, J., Yen, I.-L.: A new proxy blind signature scheme with message recovery. Inf. Technol. J. 12(21), 6159 (2013)

    Article  Google Scholar 

  14. James, S., Gowri, T., Babu, G.V., Reddy, P.V.: Identity-based blind signature scheme with message recovery. Electr. Comput. Eng. 7(5), 2088–8708 (2017)

    Google Scholar 

  15. Verma, G.K., Singh, B.B.: Efficient identity-based blind message recovery signature scheme from pairings. IET Inf. Secur. 12(2), 150–156 (2017)

    Article  Google Scholar 

  16. James, S., Gayathri, N.B., Reddy, P.V.: Pairing free identity-based blind signature scheme with message recovery. Cryptography 2(4), 29 (2018)

    Article  Google Scholar 

  17. Cao, T., Lin, D., Xue, R.: A randomized RSA-based partially blind signature scheme for electronic cash. Comput. Secur. 24(1), 44–49 (2005)

    Article  Google Scholar 

  18. Zhang, F., Kim, K.: ID-based blind signature and ring signature from pairings. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 533–547. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36178-2_33

    Chapter  Google Scholar 

  19. Zhang, F., Kim, K.: Efficient ID-based blind signature and proxy signature from bilinear pairings. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 312–323. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-45067-X_27

    Chapter  Google Scholar 

  20. Huang, Z., Chen, K., Wang, Y.: Efficient identity-based signatures and blind signatures. In: Desmedt, Y.G., Wang, H., Mu, Y., Li, Y. (eds.) CANS 2005. LNCS, vol. 3810, pp. 120–133. Springer, Heidelberg (2005). https://doi.org/10.1007/11599371_11

    Chapter  Google Scholar 

  21. Mao, J.: Linkability analysis of some blind signature schemes. In: Wang, Y., Cheung, Y., Liu, H. (eds.) CIS 2006. LNCS (LNAI), vol. 4456, pp. 556–566. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74377-4_58

    Chapter  Google Scholar 

  22. Kalkan, S., Kaya, K., Selcuk, A.A.: Generalized ID-based blind signatures from bilinear pairings. In: 2008 23rd International Symposium on Computer and Information Sciences, pp. 1–6. IEEE (2008)

    Google Scholar 

  23. Fan, C.-I., Sun, W.-Z., Huang, V.S.-M.: Provably secure randomized blind signature scheme based on bilinear pairing. Comput. Math. Appl. 60(2), 285–293 (2010)

    Article  MathSciNet  Google Scholar 

  24. Zhang, L., Hu, Y., Tian, X., Yang, Y.: Novel identity-based blind signature for electronic voting system. In: 2010 Second International Workshop on Education Technology and Computer Science, vol. 2, pp. 122–125. IEEE (2010)

    Google Scholar 

  25. Shakerian, R., MohammadPour, T., Kamali, S.H., Hedayati, M.: An identity based public key cryptography blind signature scheme from bilinear pairings. In: 2010 3rd International Conference on Computer Science and Information Technology, vol. 7, pp. 28–32. IEEE (2010)

    Google Scholar 

  26. Hu, X., Wang, J., Yang, Y.: Secure ID-based blind signature scheme without random oracle. In: 2011 International Conference on Network Computing and Information Security, vol. 1, pp. 245–249. IEEE (2011)

    Google Scholar 

  27. Xu, G., Xu, G.: An ID-based blind signature from bilinear pairing with unlinkability. In: 2013 3rd International Conference on Consumer Electronics, Communications and Networks, pp. 101–104. IEEE (2013)

    Google Scholar 

  28. He, D., Chen, J., Zhang, R.: An efficient identity-based blind signature scheme without bilinear pairings. Comput. Electr. Eng. 37(4), 444–450 (2011)

    Article  Google Scholar 

  29. Khan, M.A., Qureshi, I.M., Ullah, I., Khan, S., Khanzada, F., Noor, F.: An efficient and provably secure certificateless blind signature scheme for flying ad-hoc network based on multi-access edge computing. Electronicsd 9(1), 30 (2020)

    Google Scholar 

  30. Barreto, P.S.L.M., Libert, B., McCullagh, N., Quisquater, J.-J.: Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 515–532. Springer, Heidelberg (2005). https://doi.org/10.1007/11593447_28

    Chapter  Google Scholar 

  31. Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361–396 (2000)

    Article  Google Scholar 

  32. Devegili, A.J., Scott, M., Dahab, R.: Implementing cryptographic pairings over Barreto-Naehrig curves. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 197–207. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73489-5_10

    Chapter  Google Scholar 

  33. Aranha, D.F., Gouvêa, C.P.L., Markmann, T., Wahby, R.S., Liao, K.: RELIC is an Efficient LIbrary for Cryptography. https://github.com/relic-toolkit/relic

Download references

Author information

Authors and Affiliations

  1. The 54th Research Institute of China Electronics Technology Group Corporation, Shijiazhuang, China

    Yihong Wen & Shicheng Wang

  2. School of Cyber Science and Engineering, Wuhan University, Wuhan, China

    Cong Peng, Li Li & Min Luo

Authors
  1. Yihong Wen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cong Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shicheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Li Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Min Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Min Luo .

Editor information

Editors and Affiliations

  1. Singapore University of Technology and Design, Singapore, Singapore

    Jianying Zhou

  2. University of Strathclyde, Glasgow, UK

    Chuadhry Mujeeb Ahmed

  3. ICIS, Radboud University, Nijmegen, The Netherlands

    Lejla Batina

  4. Singapore University of Technology and Design, Singapore, Singapore

    Sudipta Chattopadhyay

  5. LIACS, Leiden University, Leiden, The Netherlands

    Olga Gadyatskaya

  6. Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

    Chenglu Jin

  7. University of Science and Technology of China, Hefei, China

    Jingqiang Lin

  8. University of Padua, Padua, Italy

    Eleonora Losiouk

  9. University of Kansas, Lawrence, KS, USA

    Bo Luo

  10. CIISE, Concordia University, Montréal, Canada

    Suryadipta Majumdar

  11. New York University, Abu Dhabi, United Arab Emirates

    Mihalis Maniatakos

  12. Illinois at Singapore Pte Ltd, Singapore, Singapore

    Daisuke Mashima

  13. Technical University of Denmark, Kongens Lyngby, Denmark

    Weizhi Meng

  14. Delft University of Technology, Delft, The Netherlands

    Stjepan Picek

  15. SECOM Co., Ltd., Tokyo, Japan

    Masaki Shimaoka

  16. University of Aizu, Aizu-Wakamatsu, Japan

    Chunhua Su

  17. City University of Hong Kong, Hong Kong, Hong Kong

    Cong Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wen, Y., Peng, C., Wang, S., Li, L., Luo, M. (2021). An Identity-Based Blind Signature Scheme with Message Recovery from Pairings. In: Zhou, J., et al. Applied Cryptography and Network Security Workshops. ACNS 2021. Lecture Notes in Computer Science(), vol 12809. Springer, Cham. https://doi.org/10.1007/978-3-030-81645-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-81645-2_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-81644-5

  • Online ISBN: 978-3-030-81645-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation