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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Technical report, Manubot (2019)
Wood, G., et al.: Ethereum: a secure decentralised generalised transaction ledger. Ethereum Project Yellow Paper 151(2014), 1–32 (2014)
Sasson, E.B., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459–474. IEEE (2014)
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
Camenisch, J.: Group signature schemes and payment systems based on the discrete logarithm problem. Ph.D. thesis, ETH Zurich (1998)
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
Chang, C.-C., Lee, J.-S.: An anonymous voting mechanism based on the key exchange protocol. Comput. Secur. 25(4), 307–314 (2006)
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)
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
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)
Han, S., Chang, E.: A pairing-based blind signature scheme with message recovery. Int. J. Inf. Technol. 2(4), 187–192 (2005)
Elkamchouchi, H.M., Abouelseoud, Y.: A new blind identity-based signature scheme with message recovery. IACR Cryptology ePrint Archive, 2008:38 (2008)
Diao, L., Gu, J., Yen, I.-L.: A new proxy blind signature scheme with message recovery. Inf. Technol. J. 12(21), 6159 (2013)
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)
Verma, G.K., Singh, B.B.: Efficient identity-based blind message recovery signature scheme from pairings. IET Inf. Secur. 12(2), 150–156 (2017)
James, S., Gayathri, N.B., Reddy, P.V.: Pairing free identity-based blind signature scheme with message recovery. Cryptography 2(4), 29 (2018)
Cao, T., Lin, D., Xue, R.: A randomized RSA-based partially blind signature scheme for electronic cash. Comput. Secur. 24(1), 44–49 (2005)
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
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
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
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
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)
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)
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)
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)
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)
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)
He, D., Chen, J., Zhang, R.: An efficient identity-based blind signature scheme without bilinear pairings. Comput. Electr. Eng. 37(4), 444–450 (2011)
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)
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
Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361–396 (2000)
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
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
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
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)