{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T06:34:16Z","timestamp":1783665256322,"version":"3.55.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872284"],"award-info":[{"award-number":["61872284"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shaanxi Provincial Natural Science Basic Research Project","award":["2021JLM-16"],"award-info":[{"award-number":["2021JLM-16"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In recent years, network coding has received extensive attention and has been applied to various computer network systems, since it has been mathematically proven to enhance the network robustness and maximize the network throughput. However, it is well-known that network coding is extremely vulnerable to pollution attacks. Certificateless network coding scheme (CLNS) is a recently proposed mechanism to defend against pollution attacks for network coding, which avoids tedious management of certificates and key-escrow attack. Until now, only a few constructions were presented, and more ones should be given so as to enrich this field. In this paper, for the first time, we study the general construction of CLNS from certificateless public auditing protocol (CL-PAP), although the two areas seem to be quite different in their nature and are studied independently. Since there are many candidates of CL-PAPs, we can naturally obtain abundant constructions of CLNSs according to our systematic way. In addition, in order to show the power of the general construction, we also present a concrete implementation given a specific CL-PAP. The performance analysis and experimental results show that the implemented CLNS is competitive in the existing network coding schemes.<\/jats:p>","DOI":"10.1007\/s11227-022-04719-6","type":"journal-article","created":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T04:02:32Z","timestamp":1660968152000},"page":"2570-2602","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Certificateless network coding scheme from certificateless public auditing protocol"],"prefix":"10.1007","volume":"79","author":[{"given":"Genqing","family":"Bian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8061-2212","authenticated-orcid":false,"given":"Mingxuan","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bilin","family":"Shao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,20]]},"reference":[{"issue":"4","key":"4719_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R, Cai N, Li SYR, Yeung RW (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204\u20131216","journal-title":"IEEE Trans Inf Theory"},{"key":"4719_CR2","doi-asserted-by":"crossref","unstructured":"Johnson R, Molnar D, Song D, Wagner D (2002) Homomorphic signature schemes. In: Cryptographers\u2019 Track at the RSA Conference, pp 244\u2013262. Springer, New York","DOI":"10.1007\/3-540-45760-7_17"},{"key":"4719_CR3","doi-asserted-by":"crossref","unstructured":"Boneh D, Freeman D, Katz J, Waters B (2009) Signing a linear subspace: Signature schemes for network coding. In: International Workshop on Public Key Cryptography, pages 68\u201387. Springer, New York","DOI":"10.1007\/978-3-642-00468-1_5"},{"key":"4719_CR4","doi-asserted-by":"crossref","unstructured":"Shamir A (1984) Identity-based cryptosystems and signature schemes. In: Workshop on the Theory and Application of Cryptographic Techniques, pp 47\u201353. Springer, New York","DOI":"10.1007\/3-540-39568-7_5"},{"key":"4719_CR5","doi-asserted-by":"publisher","first-page":"20632","DOI":"10.1109\/ACCESS.2018.2809426","volume":"6","author":"Q Lin","year":"2018","unstructured":"Lin Q, Yan H, Huang Z, Chen W, Shen J, Tang Y (2018) An id-based linearly homomorphic signature scheme and its application in blockchain. IEEE Access 6:20632\u201320640","journal-title":"IEEE Access"},{"key":"4719_CR6","doi-asserted-by":"crossref","unstructured":"Al-Riyami SS, Paterson KG (2003) Certificateless public key cryptography. In: International Conference on the Theory and Application of Cryptology and Information Security, pp 452\u2013473. Springer, New York","DOI":"10.1007\/978-3-540-40061-5_29"},{"issue":"6","key":"4719_CR7","doi-asserted-by":"publisher","first-page":"2615","DOI":"10.1109\/TNET.2020.3013902","volume":"28","author":"J Chang","year":"2020","unstructured":"Chang J, Ji Y, Shao B, Maozhi X, Xue R (2020) Certificateless homomorphic signature scheme for network coding. IEEE\/ACM Trans Netw 28(6):2615\u20132628","journal-title":"IEEE\/ACM Trans Netw"},{"key":"4719_CR8","doi-asserted-by":"crossref","unstructured":"Juels A, Kaliski\u00a0Jr BS (2007) Pors: proofs of retrievability for large files. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp 584\u2013597","DOI":"10.1145\/1315245.1315317"},{"key":"4719_CR9","doi-asserted-by":"crossref","unstructured":"Ateniese G, Burns R, Curtmola R, Herring J, Kissner L, Peterson Z, Song D (2007) Provable data possession at untrusted stores. In: Proceedings of the 14th ACM Conference on Computer and Communications security, pp 598\u2013609","DOI":"10.1145\/1315245.1315318"},{"key":"4719_CR10","doi-asserted-by":"crossref","unstructured":"Shacham H, Waters B (2008) Compact proofs of retrievability. In: International Conference on the Theory and Application of Cryptology and Information Security, pp 90\u2013107. Springer, New York","DOI":"10.1007\/978-3-540-89255-7_7"},{"issue":"6","key":"4719_CR11","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1109\/TC.2015.2456027","volume":"65","author":"F Chen","year":"2015","unstructured":"Chen F, Xiang T, Yang Y, Chow SSM (2015) Secure cloud storage meets with secure network coding. IEEE Trans Comput 65(6):1936\u20131948","journal-title":"IEEE Trans Comput"},{"issue":"12","key":"4719_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-020-2997-0","volume":"64","author":"J Chang","year":"2021","unstructured":"Chang J, Shao B, Ji Y, Maozhi X, Xue R (2021) Secure network coding from secure proof of retrievability. Sci Chin Inf Sci 64(12):1\u20132","journal-title":"Sci Chin Inf Sci"},{"issue":"2","key":"4719_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S-YR Li","year":"2003","unstructured":"Li S-YR, Yeung RW, Cai N (2003) Linear network coding. IEEE Trans Inf Theory 49(2):371\u2013381","journal-title":"IEEE Trans Inf Theory"},{"key":"4719_CR14","doi-asserted-by":"crossref","unstructured":"Gkantsidis C, Rodriguez P et\u00a0al. (2006) Cooperative security for network coding file distribution. In: INFOCOM, volume\u00a03, page\u00a05","DOI":"10.1109\/INFOCOM.2006.233"},{"key":"4719_CR15","doi-asserted-by":"crossref","unstructured":"Cai N, Yeung RW (2002) Network coding and error correction. In: Proceedings of the IEEE Information Theory Workshop, pp 119\u2013122. IEEE","DOI":"10.1109\/ISIT.2003.1228115"},{"key":"4719_CR16","doi-asserted-by":"crossref","unstructured":"Jaggi S, Langberg M, Katti S, Ho T, Katabi D, M\u00e9dard M (2007) Resilient network coding in the presence of byzantine adversaries. In: IEEE INFOCOM 2007-26th IEEE International Conference on Computer Communications, pp 616\u2013624. IEEE","DOI":"10.1109\/ISIT.2007.4557281"},{"issue":"8","key":"4719_CR17","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R Koetter","year":"2008","unstructured":"Koetter R, Kschischang FR (2008) Coding for errors and erasures in random network coding. IEEE Trans Inf Theory 54(8):3579\u20133591","journal-title":"IEEE Trans Inf Theory"},{"key":"4719_CR18","doi-asserted-by":"crossref","unstructured":"Charles D, Jain K, Lauter K (2006) Signatures for network coding. In: 2006 40th Annual Conference on Information Sciences and Systems, pp 857\u2013863. IEEE","DOI":"10.1109\/CISS.2006.286587"},{"key":"4719_CR19","doi-asserted-by":"crossref","unstructured":"Zhao F, Kalker T, M\u00e9dard M, Han KJ (2007) Signatures for content distribution with network coding. In: 2007 IEEE International Symposium on Information Theory, pp 556\u2013560. IEEE","DOI":"10.1109\/ISIT.2007.4557283"},{"key":"4719_CR20","doi-asserted-by":"crossref","unstructured":"Yu Z, Wei Y, Ramkumar B, Guan Y (2008) An efficient signature-based scheme for securing network coding against pollution attacks. In: IEEE INFOCOM 2008-the 27th Conference on Computer Communications, pp. 1409\u20131417. IEEE","DOI":"10.1109\/INFOCOM.2008.199"},{"issue":"5","key":"4719_CR21","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/LCOMM.2016.2547420","volume":"20","author":"A Esfahani","year":"2016","unstructured":"Esfahani A, Mantas G, Rodriguez J (2016) An efficient null space-based homomorphic mac scheme against tag pollution attacks in rlnc. IEEE Commun Lett 20(5):918\u2013921","journal-title":"IEEE Commun Lett"},{"issue":"12","key":"4719_CR22","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.1093\/comjnl\/bxx055","volume":"60","author":"W Ying","year":"2017","unstructured":"Ying W, Chang J, Xue R, Zhang R (2017) Homomorphic mac from algebraic one-way functions for network coding with small key size. Comput J 60(12):1785\u20131800","journal-title":"Comput J"},{"key":"4719_CR23","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.future.2018.08.039","volume":"91","author":"J Chang","year":"2019","unstructured":"Chang J, Ji Y, Maozhi X, Xue R (2019) General transformations from single-generation to multi-generation for homomorphic message authentication schemes in network coding. Fut Gen Comput Syst 91:416\u2013425","journal-title":"Fut Gen Comput Syst"},{"key":"4719_CR24","doi-asserted-by":"crossref","unstructured":"Attrapadung N, Libert B (2011) Homomorphic network coding signatures in the standard model. In: International Workshop on Public Key Cryptography, pp 17\u201334. Springer","DOI":"10.1007\/978-3-642-19379-8_2"},{"key":"4719_CR25","doi-asserted-by":"crossref","unstructured":"Li Tong, Chen Wenbin, Tang Yi, Yan Hongyang (2018) A homomorphic network coding signature scheme for multiple sources and its application in iot. Security and communication networks, 2018","DOI":"10.1155\/2018\/9641273"},{"key":"4719_CR26","doi-asserted-by":"publisher","first-page":"50858","DOI":"10.1109\/ACCESS.2019.2908244","volume":"7","author":"J Chang","year":"2019","unstructured":"Chang J, Ma H, Zhang A, Maozhi X, Xue R (2019) Rka security of identity-based homomorphic signature scheme. IEEE Access 7:50858\u201350868","journal-title":"IEEE Access"},{"issue":"3","key":"4719_CR27","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1109\/TWC.2011.122010.100087","volume":"10","author":"Y Fan","year":"2010","unstructured":"Fan Y, Jiang Y, Zhu H, Chen J, Shen XS (2010) Network coding based privacy preservation against traffic analysis in multi-hop wireless networks. IEEE Trans Wireless Commun 10(3):834\u2013843","journal-title":"IEEE Trans Wireless Commun"},{"key":"4719_CR28","doi-asserted-by":"publisher","first-page":"109739","DOI":"10.1109\/ACCESS.2019.2933870","volume":"7","author":"X Liu","year":"2019","unstructured":"Liu X, Huang J, Yuanxi W, Zong G (2019) A privacy-preserving signature scheme for network coding. IEEE Access 7:109739\u2013109750","journal-title":"IEEE Access"},{"issue":"2","key":"4719_CR29","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1007\/s12083-020-01028-8","volume":"14","author":"W Bin","year":"2021","unstructured":"Bin W, Wang C, Yao H (2021) A certificateless linearly homomorphic signature scheme for network coding and its application in the iot. Peer-to-Peer Netw Appl 14(2):852\u2013872","journal-title":"Peer-to-Peer Netw Appl"},{"key":"4719_CR30","doi-asserted-by":"crossref","unstructured":"Wang Qian, Wang Cong, Li Jin, Ren Kui, Lou Wenjing (2009) Enabling public verifiability and data dynamics for storage security in cloud computing. In European symposium on research in computer security, pages 355\u2013370. Springer","DOI":"10.1007\/978-3-642-04444-1_22"},{"issue":"2","key":"4719_CR31","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TSC.2011.51","volume":"6","author":"Y Zhu","year":"2011","unstructured":"Zhu Y, Ahn G-J, Hu H, Yau SS, An HG, Hu C-J (2011) Dynamic audit services for outsourced storages in clouds. IEEE Trans Serv Comput 6(2):227\u2013238","journal-title":"IEEE Trans Serv Comput"},{"issue":"4","key":"4719_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699909","volume":"17","author":"CC Erway","year":"2015","unstructured":"Erway CC, K\u00fcp\u00e7\u00fc A, Papamanthou C, Tamassia R (2015) Dynamic provable data possession. ACM Transactions on Information and System Security (TISSEC) 17(4):1\u201329","journal-title":"ACM Transactions on Information and System Security (TISSEC)"},{"issue":"10","key":"4719_CR33","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1109\/TIFS.2017.2705620","volume":"12","author":"J Shen","year":"2017","unstructured":"Shen J, Shen J, Chen X, Huang X, Susilo W (2017) An efficient public auditing protocol with novel dynamic structure for cloud data. IEEE Trans Inf Forensics Secur 12(10):2402\u20132415","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"4719_CR34","doi-asserted-by":"crossref","unstructured":"Wang Boyang, Li Hui, Li Ming (2013) Privacy-preserving public auditing for shared cloud data supporting group dynamics. In 2013 IEEE International Conference on Communications (ICC), pages 1946\u20131950. IEEE","DOI":"10.1109\/ICC.2013.6654808"},{"issue":"1","key":"4719_CR35","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TSC.2013.2295611","volume":"8","author":"B Wang","year":"2013","unstructured":"Wang B, Li B, Li H (2013) Panda: Public auditing for shared data with efficient user revocation in the cloud. IEEE Trans Serv Comput 8(1):92\u2013106","journal-title":"IEEE Trans Serv Comput"},{"issue":"2","key":"4719_CR36","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/TSC.2014.1","volume":"8","author":"H Wang","year":"2014","unstructured":"Wang H (2014) Identity-based distributed provable data possession in multicloud storage. IEEE Trans Serv Comput 8(2):328\u2013340","journal-title":"IEEE Trans Serv Comput"},{"key":"4719_CR37","doi-asserted-by":"crossref","unstructured":"Wang Huiqun, Feng Luqiang, Ji Yanyan, Shao Bilin, Xue Rui (2021) Toward usable cloud storage auditing, revisited. IEEE Systems Journal","DOI":"10.1109\/JSYST.2021.3055021"},{"key":"4719_CR38","doi-asserted-by":"crossref","unstructured":"Wang Boyang, Li Baochun, Li Hui, Li Fenghua (2013) Certificateless public auditing for data integrity in the cloud. In 2013 IEEE Conference on Communications and Network Security (CNS), pages 136\u2013144. IEEE","DOI":"10.1109\/CNS.2013.6682701"},{"issue":"1","key":"4719_CR39","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/JSYST.2015.2428620","volume":"12","author":"D He","year":"2015","unstructured":"He D, Zeadally S, Libing W (2015) Certificateless public auditing scheme for cloud-assisted wireless body area networks. IEEE Syst J 12(1):64\u201373","journal-title":"IEEE Syst J"},{"issue":"1","key":"4719_CR40","first-page":"71","volume":"14","author":"J Li","year":"2018","unstructured":"Li J, Yan H, Zhang Y (2018) Certificateless public integrity checking of group shared data on cloud storage. IEEE Trans Serv Comput 14(1):71\u201381","journal-title":"IEEE Trans Serv Comput"},{"key":"4719_CR41","doi-asserted-by":"crossref","unstructured":"Zhou Rui, He Mingxing, Chen Zhimin (2021) Certificateless public auditing scheme with data privacy preserving for cloud storage. In 2021 IEEE 6th International Conference on Cloud Computing and Big Data Analytics (ICCCBDA), pages 675\u2013682. IEEE","DOI":"10.1109\/ICCCBDA51879.2021.9442586"},{"issue":"2","key":"4719_CR42","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s13389-013-0057-3","volume":"3","author":"JA Akinyele","year":"2013","unstructured":"Akinyele JA, Garman C, Miers I, Pagano MW, Rushanan M, Green M, Rubin AD (2013) Charm: a framework for rapidly prototyping cryptosystems. J Cryptogr Eng 3(2):111\u2013128","journal-title":"J Cryptogr Eng"},{"key":"4719_CR43","unstructured":"Ben Lynn (2007) On the implementation of pairing-based cryptosystems. PhD thesis, Stanford University"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04719-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04719-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04719-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T12:15:44Z","timestamp":1673612144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04719-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,20]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["4719"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04719-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,20]]},"assertion":[{"value":"11 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declared that they have no conflicts of interest to this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}