Abstract
It is difficult to construct a blind signature scheme in the standard model that conforms to the formalized blindness. The difficulty lies in eliminating the blindness when the scheme is constructed. Focused on the blind nature and using the bilinear pairing, a signature scheme with disclaimer contract is proposed on the basis of the Waters signature scheme, which has provable security and blind features. Besides, the security proof of the scheme is given in the standard model. In general, the scheme has the characteristics of self-eliminating blindness and higher efficiency. It is easy to be realized in the standard model.
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
References
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
Choon, J.C., Hee Cheon, J.: An identity-based signature from gap Diffie-Hellman groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 18–30. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36288-6_2
Xun, Y.: An identity-based signature scheme from the Weil pairing. IEEE Commun. Lett. 7(2), 76–78 (2003)
Zhang, B., Xu, Q.: Certificateless proxy blind signature scheme from bilinear pairings. In: The 2nd International Workshop on Knowledge Discovery and Data Mining, IWKDD 2009, Washington, vol. 47, pp. 573–576. IEEE Computer Society (2009)
Han, S., Chang, E.: A pairing-based blind signature scheme with message recovery. Int. J. Inf. Technol. 2(4), 187–192 (2005)
Zhang, Y.H., Chen, M.: Extended identity-based partially blind signature scheme in the standard model. Comput. Eng. Appl. 46(1), 95–101 (2014)
Deng, Y.Q., Du, M.H., Yao, Z.L.: A blind proxy re-signatures scheme based on standard model. J. Electron. Inf. Technol. 32(5), 1219–1223 (2010)
Bellare, M.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st Conference on Computer and Communications Security, vol. 27, pp. 62–73. ACM Press (1993)
Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114–127. Springer, Heidelberg (2005). https://doi.org/10.1007/11426639_7
Hwang, Y.H., Liu, J.K., Chow, S.S.: Certificateless public key encryption secure against malicious KGC attacks in the standard model. J. Univers. Comput. Sci. 14(3), 463–480 (2008)
Boneh, D., Boyen, X.: Efficient selective identity-based encryption without random oracles. J. Cryptol. 24(4), 659–693 (2011)
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). https://doi.org/10.1007/978-3-540-24676-3_4
Boneh, D., Shacham, H., Lynn, B.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297–319 (2004)
Gu, K., Jia, W.J., Wang, S.C.: Proxy signature in the standard model: constructing security model and proving security. J. Softw. 23(9), 2416–2429 (2012)
Yu, Y., Ni, J.B., Xu, C.X.: Cryptanalysis of a secure and efficient identity-based signature scheme. J. Softw. 25(5), 1125–1131 (2014)
Chen, M.: Identity-based proxy blind signature scheme in standard model. J. Sichuan Univ. (Eng. Sci. Ed.) 51(19), 103–109 (2015)
Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44647-8_13
Abe, M., Okamoto, T.: Provably secure partially blind signatures. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 271–286. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44598-6_17
Okamoto, T.: Efficient blind and partially blind signatures without random oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 80–99. Springer, Heidelberg (2006). https://doi.org/10.1007/11681878_5
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
Ghadafi, E.: Efficient round-optimal blind signatures in the standard model. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 455–473. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70972-7_26
Verma, G.K., Singh, B.B.: Efficient identity-based blind message recovery signature scheme from pairings. IET Inf. Secur. 12(2), 150–156 (2018)
Acknowledgements
This work is partially supported by the National Natural Science Foundation of China (11361024), the Natural Science Foundation Projects of Jiangxi Province (20171BAB201009), the Science and Technology Project of Jiangxi Province Office of Education (GJJ170386), the Innovation Fund Designated for Graduate Students of Jiangxi Province (YC2017-S257).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Zuo, L., Zhang, M., Zhang, T., Hu, K. (2018). A Blind Signature Scheme with Disclaimer Contract in the Standard Model. In: Sun, X., Pan, Z., Bertino, E. (eds) Cloud Computing and Security. ICCCS 2018. Lecture Notes in Computer Science(), vol 11064. Springer, Cham. https://doi.org/10.1007/978-3-030-00009-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-030-00009-7_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00008-0
Online ISBN: 978-3-030-00009-7
eBook Packages: Computer ScienceComputer Science (R0)