Abstract
Linearly homomorphic signature allows signature holders to perform arbitrary linear computation on signed vectors. The special “function” makes linearly homomorphic signature suitable for many applications. However, publicly combinable is not advisable in some specific scenarios. Although some schemes with designated combiners have been proposed, they break the homomorphism of the combined signature. The combined vectors cannot be combined again. In this paper, we put forth the notion of structure-preserving linearly homomorphic signatures with the designated combiner. The combined signature is indistinguishable from signatures generated by the signer. Only the signer and the designated entity can generate a valid signature for any combined vector. Finally, we prove our scheme is secure under the CDH problem assumption and show it is efficient.
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
Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 209–236. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14623-7_12
Attrapadung, N., Libert, B.: Homomorphic network coding signatures in the standard model. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 17–34. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19379-8_2
Attrapadung, N., Libert, B., Peters, T.: Efficient completely context-hiding quotable and linearly homomorphic signatures. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 386–404. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36362-7_24
Boneh, D., Freeman, D.M.: Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 1–16. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19379-8_1
Boneh, D., Freeman, D., Katz, J., Waters, B.: Signing a linear subspace: signature schemes for network coding. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 68–87. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00468-1_5
Catalano, D., Fiore, D., Warinschi, B.: Homomorphic signatures with efficient verification for polynomial functions. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 371–389. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44371-2_21
Chang, J., Ji, Y., Shao, B., Xu, M., Xue, R.: Certificateless homomorphic signature scheme for network coding. IEEE/ACM Trans. Netw. 28(6), 2615–2628 (2020)
Cheng, C., Lee, J., Jiang, T., Takagi, T.: Security analysis and improvements on two homomorphic authentication schemes for network coding. IEEE Trans. Inf. Forensics Secur. 11(5), 993–1002 (2016)
De Caro, A., Iovino, V.: jPBC: Java pairing based cryptography. In: Proceedings of the 16th IEEE Symposium on Computers and Communications, ISCC 2011, pp. 850–855. IEEE (2011)
Desmedt, Y.: Computer security by redefining what a computer is. In: Proceedings on the 1992–1993 Workshop on New Security Paradigms, pp. 160–166. ACM (1993)
Fuchsbauer, G., Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. J. Cryptol. 32(2), 498–546 (2019). https://doi.org/10.1007/s00145-018-9281-4
Gennaro, R., Katz, J., Krawczyk, H., Rabin, T.: Secure network coding over the integers. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 142–160. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13013-7_9
Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, pp. 469–477. ACM (2015)
Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 244–262. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45760-7_17
Li, T., Chen, W., Tang, Y., Yan, H.: A homomorphic network coding signature scheme for multiple sources and its application in IoT. Secur. Commun. Netw. 2018, 9641273:1–9641273:6 (2018)
Li, Y., Zhang, F., Liu, X.: Secure data delivery with identity-based linearly homomorphic network coding signature scheme in IoT. IEEE Trans. Serv. Comput. 15(4), 2202–2212 (2022). https://doi.org/10.1109/TSC.2020.3039976
Lin, C.-J., Huang, X., Li, S., Wu, W., Yang, S.-J.: Linearly homomorphic signatures with designated entities. In: Liu, J.K., Samarati, P. (eds.) ISPEC 2017. LNCS, vol. 10701, pp. 375–390. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-72359-4_22
Lin, C., Xue, R., Huang, X.: Linearly homomorphic signatures with designated combiner. In: Huang, Q., Yu, Yu. (eds.) ProvSec 2021. LNCS, vol. 13059, pp. 327–345. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-90402-9_18
SadrHaghighi, S., Khorsandi, S.: An identity-based digital signature scheme to detect pollution attacks in intra-session network coding. In: 13th International Iranian Society of Cryptology Conference on Information Security and Cryptology, ISCISC 2016, pp. 7–12. IEEE (2016)
Yu, H., Li, W.: A certificateless signature for multi-source network coding. J. Inf. Secur. Appl. 55, 102655 (2020)
Yu, Z., Wei, Y., Ramkumar, B., Guan, Y.: An efficient signature-based scheme for securing network coding against pollution attacks. In: INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, pp. 1409–1417. IEEE (2008)
Zhang, P., Yu, J., Wang, T.: A homomorphic aggregate signature scheme based on lattice. Chin. J. Electron. 21(4), 701–704 (2012)
Zhang, Y., Jiang, Y., Li, B., Zhang, M.: An efficient identity-based homomorphic signature scheme for network coding. In: Barolli, L., Zhang, M., Wang, X.A. (eds.) EIDWT 2017. LNDECT, vol. 6, pp. 524–531. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-59463-7_52
Acknowledgement
We thank the anonymous reviewers of ACISP 2022 for their useful comments. This work is supported by the National Natural Science Foundation of China under grants (62172096, 62072134, U2001205), and the Key projects of Guangxi Natural Science Foundation under grant 2019JJD170020, and the Key Research and Development Program of Hubei Province under Grant 2021BEA163.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Li, Y., Zhang, M., Zhang, F. (2022). Structure-Preserving Linearly Homomorphic Signature with Designated Combiner for Subspace. In: Nguyen, K., Yang, G., Guo, F., Susilo, W. (eds) Information Security and Privacy. ACISP 2022. Lecture Notes in Computer Science, vol 13494. Springer, Cham. https://doi.org/10.1007/978-3-031-22301-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-22301-3_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-22300-6
Online ISBN: 978-3-031-22301-3
eBook Packages: Computer ScienceComputer Science (R0)