{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T06:34:15Z","timestamp":1783665255714,"version":"3.55.0"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T00:00:00Z","timestamp":1732492800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T00:00:00Z","timestamp":1732492800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Gansu Provincial Department of Education: Innovation Fund Project for University Teachers","award":["2023A-041"],"award-info":[{"award-number":["2023A-041"]}]},{"name":"Gansu Provincial Department of Education: Innovation Fund Project for University Teachers","award":["2023A-041"],"award-info":[{"award-number":["2023A-041"]}]},{"name":"Young Scholars Science Foundation of Lanzhou Jiaotong University","award":["2022011"],"award-info":[{"award-number":["2022011"]}]},{"name":"2023 Lanzhou Science and Technology Development Plan Project","award":["2023-ZD-234"],"award-info":[{"award-number":["2023-ZD-234"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s11235-024-01227-1","type":"journal-article","created":{"date-parts":[[2024,11,25]],"date-time":"2024-11-25T14:04:05Z","timestamp":1732543445000},"page":"1129-1145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A efficient lattice-based forward-secure linearly homomorphic signature scheme for network coding"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7056-5769","authenticated-orcid":false,"given":"Bin","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9957-7664","authenticated-orcid":false,"given":"Caifen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0912-5606","authenticated-orcid":false,"given":"Yahong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3766-0029","authenticated-orcid":false,"given":"Ning","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,25]]},"reference":[{"issue":"11","key":"1227_CR1","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1109\/TCOMM.2005.857148","volume":"53","author":"Y Wu","year":"2005","unstructured":"Wu, Y., Chou, P., & Kung, S.-Y. (2005). Minimum-energy multicast in mobile ad hoc networks using network coding. IEEE Transactions on Communications, 53(11), 1906\u20131918.","journal-title":"IEEE Transactions on Communications"},{"issue":"2","key":"1227_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S-Y Li","year":"2003","unstructured":"Li, S.-Y., Yeung, R., & Cai, N. (2003). Linear network coding. IEEE Transactions on Information Theory, 49(2), 371\u2013381.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"1227_CR3","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R Koetter","year":"2003","unstructured":"Koetter, R., & Medard, M. (2003). An algebraic approach to network coding. IEEE\/ACM Transactions on Networking, 11(5), 782\u2013795.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1227_CR4","doi-asserted-by":"crossref","unstructured":"Jin, J.-Q., Ho, T., & Viswanathan, H. (2006). Comparision of network coding and nonnetwork coding schemes for multi-hop wireless networks. In Proceedings of 2006 IEEE International Symposium on Information Theory (ISIT 2006), Seattle, WA, USA (pp. 197\u2013201).","DOI":"10.1109\/ISIT.2006.261832"},{"key":"1227_CR5","doi-asserted-by":"crossref","unstructured":"Lun, D., Medard, M., Koetter, R., & Effros, M. (2005). Further results on coding for reliable communication over packet networks. In Proceedings of International Symposium on Information Theory (ISIT 2005), Adelaide, SA, Australia (pp. 1848\u20131852).","DOI":"10.1109\/ISIT.2005.1523665"},{"key":"1227_CR6","doi-asserted-by":"crossref","unstructured":"Widmer, J., Boudec, J.-Y. Le. (2005). Network coding for efficient communication in extreme networks. In Proceedings of the ACM SIGCOMM workshop on Delay-tolerant networking, New York, NY, USA (pp. 284\u2013291).","DOI":"10.1145\/1080139.1080147"},{"key":"1227_CR7","doi-asserted-by":"crossref","unstructured":"Krohn, M., Freedman, M., & Mazieres, D. (2004). On the-fly verification of rateless erasure codes for efficient content distribution. In Proceedings of IEEE Symposium on Security and Privacy, Berkeley, CA, USA (pp. 226\u2013240).","DOI":"10.1109\/SECPRI.2004.1301326"},{"key":"1227_CR8","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., & Rodriguez P. (2005). Network coding for large scale content distribution. In Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Miami, FL (Vol. 4, pp. 2235\u20132245).","DOI":"10.1109\/INFCOM.2005.1498511"},{"key":"1227_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Freeman, D., Katz, J., & Waters, J. (2009). Signing a linear subspace: Signature schemes for network coding. In Proceedings of International Workshop on Public Key Cryptography (PKC 2009) (Vol. 5443, pp. 68\u201387). Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-00468-1_5"},{"key":"1227_CR10","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Katz, J., & Rabin, T. (2010). Secure network coding over the integers. In Proceedings of International Workshop on Public Key Cryptography (PKC 2010), LNCS 6056 (pp. 142\u2013160). Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-13013-7_9"},{"key":"1227_CR11","first-page":"1","volume":"2018","author":"T Li","year":"2018","unstructured":"Li, T., Chen, W., Tang, Y., & Yan, H. (2018). A homomorphic network coding signature scheme for multiple sources and its application in IoT. Security and Communication Networks, 2018, 1\u20136.","journal-title":"Security and Communication Networks"},{"key":"1227_CR12","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., Wu, Y., & Zong, G. (2019). A privacy-preserving signature scheme for network coding. IEEE Access, 7, 109739\u2013109750.","journal-title":"IEEE Access"},{"issue":"15","key":"1227_CR13","doi-asserted-by":"publisher","first-page":"2588","DOI":"10.3390\/math10152588","volume":"10","author":"Y Gu","year":"2022","unstructured":"Gu, Y., Shen, L., Zhang, F., & Xiong, J. (2022). Provably secure linearly homomorphic aggregate signature scheme for electronic healthcare system. Mathematics, 10(15), 2588.","journal-title":"Mathematics"},{"issue":"2","key":"1227_CR14","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1007\/s12083-020-01028-8","volume":"14","author":"B Wu","year":"2021","unstructured":"Wu, B., Wang, C., & Yao, H. (2021). A certificateless linearly homomorphic signature scheme for network coding and its application in the IoT. Peer-to-Peer Networking and Applications, 14(2), 852\u2013872.","journal-title":"Peer-to-Peer Networking and Applications"},{"key":"1227_CR15","doi-asserted-by":"publisher","first-page":"12966","DOI":"10.1109\/ACCESS.2018.2809684","volume":"6","author":"Q Lin","year":"2018","unstructured":"Lin, Q., Li, J., Huang, Z., Chen, W., & Shen, J. (2018). A short linearly homomorphic proxy signature scheme. IEEE Access, 6, 12966\u201312972.","journal-title":"IEEE Access"},{"issue":"5","key":"1227_CR16","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor, P. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484\u20131509.","journal-title":"SIAM Journal on Computing"},{"key":"1227_CR17","unstructured":"Anderson, R. (1997). Two remarks on public-key cryptology. In The fourth ACM Conference on Computer and Communications Security (CCS 1997). Retrieved from http:\/\/www.cl.cam.ac.uk\/users\/rja14."},{"key":"1227_CR18","doi-asserted-by":"crossref","unstructured":"Bellare, M., & Miner, S. K. (1999). A forward-secure digital signature scheme. In Proceedings of advances in cryptology(CRYPTO 1999), Santa Barbara, California, USA (pp. 431\u2013448).","DOI":"10.1007\/3-540-48405-1_28"},{"key":"1227_CR19","doi-asserted-by":"crossref","unstructured":"Abdalla, M., & Reyzin, L. (2000). A new forward-secure digital signature scheme. In Proceedings of advances in cryptology (ASIACRYPT 2000) (Vol. 1976. pp. 116\u201329). Springer-Verlag.","DOI":"10.1007\/3-540-44448-3_10"},{"key":"1227_CR20","doi-asserted-by":"crossref","unstructured":"Itkis, G., & Reyzin, L. (2001). Forward-secure signatures with optimal signing and verifying. In Proceedings of advances in cryptology (CRYPTO 2001) (Vol. 2139, pp. 499\u2013514). Springer-Verlag.","DOI":"10.1007\/3-540-45708-9_32"},{"key":"1227_CR21","doi-asserted-by":"crossref","unstructured":"Kozlov, A., & Reyzin, L. (2002). Forward-secure signatures with fast key update. In International Conference on Security in Communication Networks (pp. 241\u2013256.). Springer, Berlin, Heidelberg, 2002.","DOI":"10.1007\/3-540-36413-7_18"},{"key":"1227_CR22","doi-asserted-by":"crossref","unstructured":"Maklin, T., Micciancio, D., & Miner, S. (2002) Efficient general forward-secure signatures with an unbounded number of time periods. In Proceedings of advances in cryptology (EUROCRYPT 2002) (Vol. 2332, pp. 400\u201317). Springer-Verlag.","DOI":"10.1007\/3-540-46035-7_27"},{"key":"1227_CR23","doi-asserted-by":"crossref","unstructured":"Yao, D., Fazio, N., Dodis, Y., & Lysyanskaya, A. (2004). ID-based encryption for complex hierarchies with applications to forward security and brodacast encryption. In Proceedings of the ACM conference on computer and communications security (pp. 354\u201363).","DOI":"10.1145\/1030083.1030130"},{"key":"1227_CR24","doi-asserted-by":"crossref","unstructured":"Boyen, X., Shacham, H., Shen, E., & Waters, B. (2006). Forward-secure signatures with untrusted update. In Proceedings of the 13th ACM conference on Computer and communications security (pp. 191\u2013200).","DOI":"10.1145\/1180405.1180430"},{"issue":"2","key":"1227_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.3233\/FI-2011-562","volume":"111","author":"J Yu","year":"2011","unstructured":"Yu, J., Kong, F., Cheng, X., Hao, R., & Fan, J. (2011). Forward-secure identity-based public-key encryption without random oracle. Fundamenta Informaticae, 111(2), 241\u201356.","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"1227_CR26","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.compeleceng.2011.03.011","volume":"37","author":"X Chen","year":"2011","unstructured":"Chen, X., Zhang, F., Tian, H., Wei, B., & Kim, K. (2011). Discrete logarithm based chameleon hashing and signatures without key exposure. Computers and Electrical Engineering, 37(4), 614\u201323.","journal-title":"Computers and Electrical Engineering"},{"key":"1227_CR27","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., & Boyen, X. (2010). Efficient lattice (H)IBE in the standard. In Proceedings of advances in cryptology(EUROCRYPT 2010) (pp. 553\u201372). Springer Verlag.","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"1227_CR28","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ins.2014.03.082","volume":"279","author":"J Yu","year":"2014","unstructured":"Yu, J., Kong, F., Cheng, X., Hao, R., & Li, G. (2014). One forward-secure signature scheme using bilinear maps and its applications. Information Sciences, 279, 60\u201376.","journal-title":"Information Sciences"},{"key":"1227_CR29","unstructured":"Hu, F., Wu, C.-H., & Irwin, J. D. (2003). A new forward secure signature scheme using bilinear maps. Cryptology ePrint Archive, Report 2003\/188. http:\/\/eprint.iacr.org\/2003\/188."},{"key":"1227_CR30","unstructured":"Kang, B. G., Park, J. H., & Hahn, S. G. (2004). A new forward secure signature scheme. Cryptology ePrint Archive, Report 2004\/183. http:\/\/eprint.iacr.org\/2004\/183."},{"key":"1227_CR31","doi-asserted-by":"crossref","unstructured":"Maklin, T., Micciancio, D., & Miner, S. (2002). Efficient generic forward-secure signatures with an unbounded number of time periods. In Proceedings of Advances in Cryptology(EUROCRYPT 2002) (Vol. 2332, pp. 400\u2013417). Springer-Verlag.","DOI":"10.1007\/3-540-46035-7_27"},{"key":"1227_CR32","doi-asserted-by":"crossref","unstructured":"Krawczyk, H. (2000). Simple forward-secure signatures for any signature scheme. In Proceedings of the Seventh ACM Conference on Computer and Communications Security (pp. 108\u2013115). ACM Press.","DOI":"10.1145\/352600.352617"},{"issue":"3","key":"1227_CR33","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1007\/s11277-015-3001-2","volume":"86","author":"J Yu","year":"2016","unstructured":"Yu, J., Xia, H., Zhao, H., Hao, R., Fu, Z., & Cheng, X. (2016). Forward secure identity-based signature scheme in untrusted update environments. Wireless Personal Communications, 86(3), 1467\u20131491.","journal-title":"Wireless Personal Communications"},{"key":"1227_CR34","doi-asserted-by":"crossref","unstructured":"Liu, Y., Yin, X., & Qiu, L. (2008). ID-based forward-secure signature scheme from the bilinear pairings. In Proceedings of The International Symposium on Electronic Commerce and Security(ISECS 2008), IEEE Computer Society, Guangzhou, China (pp. 179\u2013183).","DOI":"10.1109\/ISECS.2008.220"},{"issue":"3","key":"1227_CR35","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/j.ins.2010.09.034","volume":"181","author":"J Yu","year":"2011","unstructured":"Yu, J., Hao, R., Kong, F., et al. (2011). Forward-secure identity-based signature: Security notions and construction. Information Sciences, 181(3), 648\u2013660.","journal-title":"Information Sciences"},{"issue":"7","key":"1227_CR36","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1080\/00207160.2016.1190835","volume":"94","author":"J Wei","year":"2017","unstructured":"Wei, J., Liu, W., & Hu, X. (2017). Forward-secure identity-based signature with efficient revocation. International Journal of Computer Mathematics, 94(7), 1390\u20131411.","journal-title":"International Journal of Computer Mathematics"},{"key":"1227_CR37","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ins.2018.04.049","volume":"454","author":"H Oh","year":"2018","unstructured":"Oh, H., Kim, J., & Shin, J. S. (2018). Forward-secure ID based digital signature scheme with forward-secure private key generator. Information Sciences, 454, 96\u2013109.","journal-title":"Information Sciences"},{"issue":"6","key":"1227_CR38","doi-asserted-by":"publisher","first-page":"1963","DOI":"10.1016\/j.compeleceng.2013.12.003","volume":"40","author":"X Zhang","year":"2014","unstructured":"Zhang, X., Xu, X., Jin, C., & Xie, R. (2014). Efficient forward secure identity-based shorter signature from lattice. Computers and Electrical Engineering, 40(6), 1963\u20131971.","journal-title":"Computers and Electrical Engineering"},{"issue":"5","key":"1227_CR39","first-page":"2792","volume":"11","author":"X Zhang","year":"2017","unstructured":"Zhang, X., & Liu, Z. (2017). Lattice-based strongly-unforgeable forward-secure identity-based signature scheme with flexible key update. TIIS, 11(5), 2792\u20132810.","journal-title":"TIIS"},{"key":"1227_CR40","doi-asserted-by":"crossref","unstructured":"Johnson, R., Molnar, D., & Song, D. (2002). Homomorphic Signature Schemes. In Cryptographers\u2019 track at the RSA conference (pp. 244\u2013262). Berlin, Heidelberg: Springer Berlin Heidelberg.","DOI":"10.1007\/3-540-45760-7_17"},{"key":"1227_CR41","doi-asserted-by":"crossref","unstructured":"Boneh, D., & Freeman, D. M. (2011). Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In Proceedings of PKC 2011(PKC 2011), LNCS 6571 (pp. 1\u201316). Berlin: Springer-Verlag.","DOI":"10.1007\/978-3-642-19379-8_1"},{"issue":"5","key":"1227_CR42","first-page":"2427","volume":"10","author":"D Xie","year":"2016","unstructured":"Xie, D., Peng, H., Li, L., & Yang, Y. (2016). Efficient post-quantum secure network coding signatures in the standard model. TIIS, 10(5), 2427\u20132445.","journal-title":"TIIS"},{"key":"1227_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2020\/8857815","volume":"2020","author":"J Cai","year":"2020","unstructured":"Cai, J., Jiang, H., Wang, H., et al. (2020). Lattice-based linearly homomorphic signature scheme over $$ {\\mathbb{F} }_2 $$. Security and Communication Networks, 2020, 1\u20137.","journal-title":"Security and Communication Networks"},{"key":"1227_CR44","doi-asserted-by":"publisher","first-page":"50858","DOI":"10.1109\/ACCESS.2019.2908244","volume":"6","author":"J Chang","year":"2019","unstructured":"Chang, J., Ma, H., Zhang, A., Xu, M., & Xue, R. (2019). RKA security of identity-based homomorphic signature scheme. IEEE Access, 6, 50858\u201350868.","journal-title":"IEEE Access"},{"issue":"4","key":"1227_CR45","doi-asserted-by":"publisher","first-page":"2202","DOI":"10.1109\/TSC.2020.3039976","volume":"15","author":"Y Li","year":"2020","unstructured":"Li, Y., Zhang, F., & Liu, X. (2020). Secure data delivery with identity-based linearly homomorphic network coding signature scheme in IoT. IEEE Transactions on Services Computing, 15(4), 2202\u20132212.","journal-title":"IEEE Transactions on Services Computing"},{"key":"1227_CR46","doi-asserted-by":"crossref","unstructured":"H\u00e9bant, C., Pointcheval, D., & Sch\u00e4dlich, R. (2023). Tracing a linear subspace: Application to linearly-homomorphic group signatures. In IACR International Conference on Public-Key Cryptography (pp. 312\u2013341).","DOI":"10.1007\/978-3-031-31368-4_12"},{"issue":"13","key":"1227_CR47","doi-asserted-by":"publisher","first-page":"13707","DOI":"10.1109\/JSEN.2022.3177317","volume":"22","author":"H Yu","year":"2022","unstructured":"Yu, H., & Shi, J. (2022). Certificateless homomorphism network coding signature scheme. IEEE Sensors Journal, 22(13), 13707\u201313715.","journal-title":"IEEE Sensors Journal"},{"issue":"1","key":"1227_CR48","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1049\/ise2.12011","volume":"15","author":"Y Li","year":"2021","unstructured":"Li, Y., Zhang, F., & Sun, Y. (2021). Lightweight certificateless linearly homomorphic network coding signature scheme for electronic health system. IET Information Security, 15(1), 131\u2013146.","journal-title":"IET Information Security"},{"key":"1227_CR49","doi-asserted-by":"crossref","unstructured":"Schabhuser, L., Butin, D., & Buchmann, J. (2019). Context hiding multi-key linearly homomorphic authenticators. In Topics in Cryptology\u2013CT-RSA 2019: The Cryptographers\u2019 Track at the RSA Conference 2019, San Francisco, CA, USA, March 4\u20138, Proceedings (pp. 493\u2013513).","DOI":"10.1007\/978-3-030-12612-4_25"},{"key":"1227_CR50","doi-asserted-by":"crossref","unstructured":"Schabhuser, L., Buchmann, J., & Struck, P. (2017). A linearly homomorphic signature scheme from weaker assumptions. In Cryptography and Coding: 16th IMA International Conference, IMACC 2017, Oxford, UK, December 12-14, 2017, Proceedings 16 (pp. 261\u2013279).","DOI":"10.1007\/978-3-319-71045-7_14"},{"key":"1227_CR51","doi-asserted-by":"crossref","unstructured":"Lai, R. W,. Tai, R. K., Wong, H. W., & Chow, H. W. (2018). Multi-key homomorphic signatures unforgeable under insider corruption. In International Conference on the Theory and Application of Cryptology and Information Security (pp. 465\u2013492).","DOI":"10.1007\/978-3-030-03329-3_16"},{"issue":"2","key":"1227_CR52","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.32604\/cmes.2023.026153","volume":"136","author":"C Wang","year":"2023","unstructured":"Wang, C., & Wu, B. (2023). A linear homomorphic proxy signature scheme based on blockchain for Internet of Things. CMES-Computer Modeling in Engineering Sciences, 136(2), 1857.","journal-title":"CMES-Computer Modeling in Engineering Sciences"},{"key":"1227_CR53","doi-asserted-by":"crossref","unstructured":"Lin, C., Xue, R., & Huang, X. (2021). Linearly homomorphic signatures with designated combiner. In Provable and Practical Security: 15th International Conference, ProvSec 2021, Guangzhou, China, November 5\u20138, 2021, Proceedings 15 (pp. 327\u2013345).","DOI":"10.1007\/978-3-030-90402-9_18"},{"key":"1227_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2021.107655","volume":"235","author":"H Yu","year":"2022","unstructured":"Yu, H., Wang, W., & Zhang, Q. (2022). Certificateless anti-quantum ring signcryption for network coding. Knowledge-Based Systems, 235, 1\u20139.","journal-title":"Knowledge-Based Systems"},{"issue":"10","key":"1227_CR55","doi-asserted-by":"publisher","first-page":"11057","DOI":"10.1109\/TITS.2023.3276920","volume":"24","author":"H Yu","year":"2023","unstructured":"Yu, H., & Wang, H. (2023). Lattice-based threshold signcryption for blockchain oracle data transmission. IEEE Transactions on Intelligent Transportation Systems, 24(10), 11057\u201311065.","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"1","key":"1227_CR56","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D., & Regev, O. (2007). Worst-case to average-case reductions based on Gaussian measures. SIAM Journal on Computing, 37(1), 267\u2013302.","journal-title":"SIAM Journal on Computing"},{"key":"1227_CR57","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008). Trapdoors for hard lattices and new cryptographic constructions. In Proceedings of the fortieth annual ACM symposium on Theory of computing (pp. 197\u2013206).","DOI":"10.1145\/1374376.1374407"},{"key":"1227_CR58","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2010). Bonsai trees, or how to delegate a lattice basis. In Proceedings of the 29th Annual Int. Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology (EUROCRYPT 2010) (Vol. 6110, pp. 523\u2013552).","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"1227_CR59","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., & Boyen, X. (2010). Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In Proceedings of the 30th Annual Cryptology Conference on Advances in Cryptology (CRYPTO 2010) (Vol 6223, pp. 98\u2013115).","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"1227_CR60","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., & Micciancio, D. (2008). Asymptotically efficient lattice-based digital signatures. In Proceedings of the TCC 2008(TCC 2008), LNCS 4948 (pp. 37\u201354). Berlin: Springer-Verlag.","DOI":"10.1007\/978-3-540-78524-8_3"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-024-01227-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-024-01227-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-024-01227-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:11:37Z","timestamp":1733548297000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-024-01227-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,25]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1227"],"URL":"https:\/\/doi.org\/10.1007\/s11235-024-01227-1","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,25]]},"assertion":[{"value":"29 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}