{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T20:22:20Z","timestamp":1769458940918,"version":"3.49.0"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Innovation Fund Project for University Teachers","award":["2023A-041"],"award-info":[{"award-number":["2023A-041"]}]},{"name":"Innovation Fund Project for University Teachers","award":["2023A-041"],"award-info":[{"award-number":["2023A-041"]}]},{"name":"Innovation Fund Project for University Teachers","award":["2023A-041"],"award-info":[{"award-number":["2023A-041"]}]},{"name":"Innovation Fund Project for University Teachers","award":["2023A-041"],"award-info":[{"award-number":["2023A-041"]}]},{"name":"the Young Scholars Science Foundation of Lanzhou Jiaotong University","award":["2022011"],"award-info":[{"award-number":["2022011"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s12083-025-01917-w","type":"journal-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T12:02:37Z","timestamp":1739880157000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A key leakage resistant linearly homomorphic signature scheme and its application"],"prefix":"10.1007","volume":"18","author":[{"given":"Bin","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yahong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaijun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caifen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,18]]},"reference":[{"key":"1917_CR1","doi-asserted-by":"crossref","unstructured":"Jin JQ, Ho T, Viswanathan H (2006) Comparison of network coding and nonnetwork coding schemes for multi-hop wireless networks. In: Proc. IEEE international symposium on information theory, pp 197-201","DOI":"10.1109\/ISIT.2006.261832"},{"issue":"11","key":"1917_CR2","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 SY (2005) Minimum-energy multicast in mobile ad hoc networks using network coding. IEEE Trans Commun 53(11):1906\u20131918","journal-title":"IEEE Trans Commun"},{"issue":"27","key":"1917_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2016.04.009","volume":"634","author":"WB Chen","year":"2016","unstructured":"Chen WB, Lei H, Qi K (2016) Lattice-based linearly homomorphic signatures in the standard model. Theor Comput Sci 634(27):47\u201354","journal-title":"Theor Comput Sci"},{"issue":"2","key":"1917_CR4","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"SYR Li","year":"2003","unstructured":"Li SYR, Yeung R, Cai N (2003) Linear network coding. IEEE Trans Inf Theory 49(2):371\u2013381","journal-title":"IEEE Trans Inf Theory"},{"key":"1917_CR5","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"},{"key":"1917_CR6","doi-asserted-by":"publisher","unstructured":"Hu X, Zheng S, Gong J, et al (9) Enabling Linearly Homomorphic Signatures in Network Coding-based Named Data Networking. In: Proc. CFI 2019, pp 1\u20134. https:\/\/doi.org\/10.1145\/3341188.3341191","DOI":"10.1145\/3341188.3341191"},{"key":"1917_CR7","doi-asserted-by":"crossref","unstructured":"Charles D, Jain K, Lauter K (2006) Signatures for network coding. In: Proc. 40th Annu Conf Inf Sci Syst Mar, IEEE, Princeton, NJ, pp 857\u2013863","DOI":"10.1109\/CISS.2006.286587"},{"key":"1917_CR8","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: Proc. INFOCOM, IEEE, Phoenix, AZ, pp 1409\u20131417","DOI":"10.1109\/INFOCOM.2008.199"},{"key":"1917_CR9","doi-asserted-by":"crossref","unstructured":"Zhang P, Jiang Y, Lin C, Yao H, Wasef A et al (2011) Padding for orthogonality: efficient subspace authentication for network coding. in Proc. IEEE INFOCOM, Shanghai, pp 1026\u20131034","DOI":"10.1109\/INFCOM.2011.5934876"},{"key":"1917_CR10","doi-asserted-by":"crossref","unstructured":"Boneh D, Freeman D, Katz J, Waters J (2009) Signing a Linear Subspace: Signature Schemes for Network Coding. In: Proc. PKC 2009, LNCS, Springer, Berlin, Heidelberg, vol 5443 pp 68\u201387","DOI":"10.1007\/978-3-642-00468-1_5"},{"key":"1917_CR11","doi-asserted-by":"crossref","unstructured":"Zhang Y, Jiang Y, Li B, Zhang M (2017) An efficient identity-based homomorphic signature scheme for network coding. In: Proc. EIDWT 2017, LNCS, Springer, Cham, vol 6 pp 524\u2013531","DOI":"10.1007\/978-3-319-59463-7_52"},{"key":"1917_CR12","doi-asserted-by":"crossref","unstructured":"Sadrhaghighi S, Khorsandi S (2016) An identity-based digital signature scheme to detect pollution attacks in intra-session network coding. In: Proc. ISCISC 2016, Tehran, Iran, pp 7\u201312","DOI":"10.1109\/ISCISC.2016.7736444"},{"key":"1917_CR13","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":"1917_CR14","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":"1917_CR15","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 Trans Serv Comput 15(4):2202\u20132212","journal-title":"IEEE Trans Serv Comput"},{"issue":"13","key":"1917_CR16","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 Sens J 22(13):13707\u201313715","journal-title":"IEEE Sens J"},{"issue":"1","key":"1917_CR17","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 Inf Secur 15(1):131\u2013146","journal-title":"IET Inf Secur"},{"key":"1917_CR18","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 Netw Appl 14:852\u2013872","journal-title":"Peer-to-Peer Netw Appl"},{"key":"1917_CR19","doi-asserted-by":"crossref","unstructured":"Schabh\u00fcser L, Butin D, Buchmann J (2019) Context hiding multi-key linearly homomorphic authenticators. In: Proc. CT-RSA 2019, LNCS, Springer, Cham, vol 11405 pp 493\u2013513","DOI":"10.1007\/978-3-030-12612-4_25"},{"key":"1917_CR20","doi-asserted-by":"crossref","unstructured":"Schabhuser L, Buchmann J, Struck P (2017) A linearly homomorphic signature scheme from weaker assumption. In: Proc. IMACC2017, LNCS, Springer, Cham, vol 10655 pp 261\u2013279","DOI":"10.1007\/978-3-319-71045-7_14"},{"key":"1917_CR21","first-page":"1","volume":"2018","author":"T Li","year":"2018","unstructured":"Li T, Chen W, Tang T, Yan H (2018) A homomorphic network coding signature scheme for multiple sources and its application in IoT. Secur Commun Netwo 2018:1\u20136","journal-title":"Secur Commun Netwo"},{"key":"1917_CR22","doi-asserted-by":"crossref","unstructured":"Lai RW, Tai RK, Wong HW, Chow SS (2018) Multi-key homomorphic signatures unforgeable under insider corruption. In: Proc. ASIACRYPT 2018, LNCS, Springer, Cham, vol 11273 pp 465\u2013492","DOI":"10.1007\/978-3-030-03329-3_16"},{"key":"1917_CR23","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 $$ F_2 $$. Secur Commun Netw 2020:1\u20137","journal-title":"Secur Commun Netw"},{"issue":"15","key":"1917_CR24","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 et al (2022) Provably secure linearly homomorphic aggregate signature scheme for electronic healthcare system. Mathematics 10(15):2588","journal-title":"Mathematics"},{"key":"1917_CR25","doi-asserted-by":"publisher","unstructured":"Wang C, Wu B (2023) A linear homomorphic proxy signature scheme based on blockchain for internet of things. Comput Model Eng Sci. https:\/\/doi.org\/10.32604\/cmes.2023.026153.","DOI":"10.32604\/cmes.2023.026153."},{"key":"1917_CR26","doi-asserted-by":"crossref","unstructured":"Li Y, Yao H, Chen M, Jaggi S et al (2010) RIPPLE authentication for network coding. In: Proc. IEEE INFOCOM, San Diego, CA, USA, pp 1\u20139","DOI":"10.1109\/INFCOM.2010.5462051"},{"issue":"5","key":"1917_CR27","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":"7","key":"1917_CR28","doi-asserted-by":"publisher","first-page":"510251","DOI":"10.1155\/2015\/510251","volume":"11","author":"A Esfahani","year":"2015","unstructured":"Esfahani A, Yang D, Mantas G et al (2015) Dual homomorphic message authentication code scheme for network coding enable wireless sensor networks. Int J Distrib Sens Netw 11(7):510251","journal-title":"Int J Distrib Sens Netw"},{"issue":"1","key":"1917_CR29","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TPDS.2013.24","volume":"25","author":"X Wu","year":"2014","unstructured":"Wu X, Xu Y, Yuen C, Xiang L (2014) A tag encoding scheme against pollution attack to linear network coding. IEEE Trans Parallel Distrib Syst 25(1):33\u201342","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1917_CR30","doi-asserted-by":"crossref","unstructured":"Kehdi K, Li B (2009) Null Keys: limiting malicious attacks via null space properties of network coding. In: Proc. IEEE INFOCOM 2009, Rio de Janeiro, Brazil, pp 1224\u20131232","DOI":"10.1109\/INFCOM.2009.5062036"},{"issue":"5","key":"1917_CR31","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/TIFS.2016.2515517","volume":"11","author":"C Cheng","year":"2016","unstructured":"Cheng C, Lee J, Jiang T, Takagi T (2016) Security analysis and improvements on two homomorphic authentication schemes for network coding. IEEE Trans Inf Forensics Secur 11(5):993\u20131002","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"1917_CR32","doi-asserted-by":"crossref","unstructured":"Boneh D, Freema D (2011) Homomorphic signatures for polynomial functions. In: Proc. AEUROCRYPT 2011, LNCS, Springer, Berlin, Heidelberg, vol 6632 pp 149\u2013168","DOI":"10.1007\/978-3-642-20465-4_10"},{"key":"1917_CR33","doi-asserted-by":"crossref","unstructured":"Catalano D, Fiore D, Warinschi B (2014) Homomorphic signatures with efficient verification for polynomial functions. In: Proc. CRYPTO 2014, LNCS, Springer, Berlin, Heidelberg, vol 8616 pp 371\u2013389","DOI":"10.1007\/978-3-662-44371-2_21"},{"key":"1917_CR34","doi-asserted-by":"crossref","unstructured":"Gorbunov S, Vaikuntanathan V, Wichs D (2015) Leveled fully homomorphic signatures from standard lattices. In: Proc. STOC 2015, LNCS, Springer, Cham vol 9290 pp 469\u2013477","DOI":"10.1145\/2746539.2746576"},{"key":"1917_CR35","doi-asserted-by":"publisher","first-page":"119431","DOI":"10.1109\/ACCESS.2020.3003685","volume":"8","author":"C Wang","year":"2020","unstructured":"Wang C, Wu B, Yao H (2020) Leveled adaptively strong-unforgeable identity-based fully homomorphic signatures. IEEE Access 8:119431\u2013119447","journal-title":"IEEE Access"},{"key":"1917_CR36","doi-asserted-by":"crossref","unstructured":"Fiore D, Pagnin E (2018) Matrioska: A Compiler for Multi-Key Homomorphic Signatures. In: Proc. SCN 2018, LNCS, Springer, Cham, vol 11035 pp.43\u201362","DOI":"10.1007\/978-3-319-98113-0_3"},{"key":"1917_CR37","unstructured":"Fiore D, Mitrokotsa A, Nizzardo L, et al (2016) Multi-key homomorphic authenticators. In Proc. ASIACRYPT 2016, LNCS, Springer, Berlin, Heidelberg, vol 10032 pp 1\u201341"},{"key":"1917_CR38","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2021.08.002","volume":"889","author":"SD Samarin","year":"2021","unstructured":"Samarin SD, Fiore D, Venturi D et al (2021) A compiler for multi-key homomorphic signatures for Turing machines. Theor Comput Sci 889:145\u2013170","journal-title":"Theor Comput Sci"},{"key":"1917_CR39","doi-asserted-by":"crossref","unstructured":"Li S, Liang B, Mitrokotsa A et al (2021) Homomorphic signcryption with public plaintext-result checkability. IET Inf Secur 15(5):333\u2013350","DOI":"10.1049\/ise2.12026"},{"key":"1917_CR40","doi-asserted-by":"crossref","unstructured":"Wang Y, Wang M (2020) A new fully homomorphic signatures from standard lattices. In: Proc. WASA 2020, Qingdao, China, Springer, pp 494\u2013506","DOI":"10.1007\/978-3-030-59016-1_41"},{"key":"1917_CR41","doi-asserted-by":"crossref","unstructured":"Li R, Wang F, Zhang R, et al (2022) NTRU-Based Fully Homomorphic Signature. Secur Commun Netw 2022","DOI":"10.1155\/2022\/9942717"},{"issue":"4","key":"1917_CR42","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1093\/comjnl\/bxab042","volume":"65","author":"S Li","year":"2022","unstructured":"Li S, Wang X, Xue R (2022) Toward both privacy and efficiency of homomorphic MACs for polynomial functions and its applications. Comput J 65(4):1020\u20131028","journal-title":"Comput J"},{"key":"1917_CR43","unstructured":"Anderson R (1997) Two remarks on public-key cryptology. In: Proc. ACM-CCS 1997. http:\/\/wwwcl.cam.ac.uk\/users\/rja14"},{"key":"1917_CR44","doi-asserted-by":"crossref","unstructured":"Bellare M, Miner SK (1999) A forward-secure digital signature scheme. In: Proc. CRYPTO 1999, Santa Barbara, California, USA, pp 431\u2013448","DOI":"10.1007\/3-540-48405-1_28"},{"key":"1917_CR45","doi-asserted-by":"crossref","unstructured":"Fiat A, Shamir A (1986) How to prove yourself: practical solutions to identification and signature problems. In: Proc. CRYPTO 1986, LNCS vol. 263, Santa Barbara, California, USA, pp 186\u2013194","DOI":"10.1007\/3-540-47721-7_12"},{"key":"1917_CR46","doi-asserted-by":"crossref","unstructured":"Abdalla M, Reyzin L (2000) A new forward-secure digital signature scheme. In: Proc. ASIACRYPT 2000, Springer, Kyoto, pp 116\u2013129","DOI":"10.1007\/3-540-44448-3_10"},{"key":"1917_CR47","doi-asserted-by":"crossref","unstructured":"Itkis G, Reyzin L (2001) Forward-secure signatures with optimal signing and verifying. In: Proc. CRYPTO 2001, Springer, Santa Barbara, CA, pp 332\u2013354","DOI":"10.1007\/3-540-44647-8_20"},{"key":"1917_CR48","doi-asserted-by":"crossref","unstructured":"Kozlov A, Reyzin L (2003) Forward-secure signatures with fast key update. In: Proc. SCN 2003, Springer, Berlin, Heidelberg, pp 241\u2013256","DOI":"10.1007\/3-540-36413-7_18"},{"key":"1917_CR49","doi-asserted-by":"crossref","unstructured":"Malkin T, Micciancio D, Miner S (2002) Efficient generic forward-secure signatures with an unbounded number of time periods. In: Proc. EUROCRYPT 2002, Springer, Amsterdam, pp 400\u2013417","DOI":"10.1007\/3-540-46035-7_27"},{"key":"1917_CR50","doi-asserted-by":"crossref","unstructured":"Yu J, Kong F, Cheng X, Hao R, Li G (2008) Construction of yet another forward secure signature scheme using bilinear maps. In: Proc. ProvSec 2008, LNCS, Springer, Berlin, Heidelberg, vol 5324 pp 83-97","DOI":"10.1007\/978-3-540-88733-1_6"},{"key":"1917_CR51","doi-asserted-by":"crossref","unstructured":"Canetti R, Halevi S, Katz J (2003) A forward-secure public-key encryption scheme. In: Proc. EUROCRYPT 2003, LNCS, Warsaw, Poland, Springer, Berlin, Heidelberg, vol 2656 pp 255-271","DOI":"10.1007\/3-540-39200-9_16"},{"key":"1917_CR52","unstructured":"Hu F, Wu CH, Irwin JD (2003) A new forward secure signature scheme using bilinear maps. Cryptology ePrint Archive, Report 2003\/188. http:\/\/eprint.iacr.org\/2003\/188"},{"key":"1917_CR53","unstructured":"Kang BG, Park JH, Hahn SG (2004) A new forward secure signature scheme. Cryptology ePrint Archive, Report 2004\/183. http:\/\/eprint.iacr.org\/2004\/183"},{"key":"1917_CR54","doi-asserted-by":"crossref","unstructured":"Liu Y, Yin X, Qiu L (2008) ID-based forward-secure signature scheme from the bilinear pairings. In: Proc. ISECS 2008, Guangzhou, China, pp 179\u2013183","DOI":"10.1109\/ISECS.2008.220"},{"issue":"3","key":"1917_CR55","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. Inf Sci 181(3):648\u2013660","journal-title":"Inf Sci"},{"issue":"3","key":"1917_CR56","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 et al (2016) Forward secure identity-based signature scheme in untrusted update environments. Wirel Person Commun 86(3):1467\u20131491","journal-title":"Wirel Person Commun"},{"issue":"7","key":"1917_CR57","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. Int J Comput Math 94(7):1390\u20131411","journal-title":"Int J Comput Math"},{"key":"1917_CR58","doi-asserted-by":"crossref","unstructured":"Oh H, Kim J, Shin JS (2018) Forward-Secure ID based Digital Signature Scheme with Forward-Secure Private Key Generator. Inf Sci 454-455","DOI":"10.1016\/j.ins.2018.04.049"},{"issue":"4","key":"1917_CR59","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1093\/comjnl\/bxt141","volume":"58","author":"J Li","year":"2015","unstructured":"Li J, Teng H, Huang X et al (2015) A forward-secure certificate-based signature scheme. Comput J 58(4):853\u2013866","journal-title":"Comput J"},{"key":"1917_CR60","doi-asserted-by":"crossref","unstructured":"Lu Y, Li J (2019) A forward-secure certificate-based signature scheme with enhanced security in the standard model. KSII Trans Int Inf Syst 13(3):1502\u20131522","DOI":"10.3837\/tiis.2019.03.022"},{"key":"1917_CR61","doi-asserted-by":"crossref","unstructured":"Li Z, Wang D (2019) Achieving one-round password-based authenticated key exchange over lattices. IEEE Trans Serv Comput 15(1):308\u2013321","DOI":"10.1109\/TSC.2019.2939836"},{"key":"1917_CR62","doi-asserted-by":"crossref","unstructured":"Li Z, Wang D, Morais E (2020) Quantum-safe round-optimal password authentication for mobile devices. IEEE Trans Dependable Secure Comput 19(3):1885\u20131899","DOI":"10.1109\/TDSC.2020.3040776"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-01917-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-025-01917-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-01917-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T02:32:12Z","timestamp":1746844332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-025-01917-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,18]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1917"],"URL":"https:\/\/doi.org\/10.1007\/s12083-025-01917-w","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,18]]},"assertion":[{"value":"13 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2025","order":3,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"101"}}