{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T12:43:36Z","timestamp":1745757816114,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T00:00:00Z","timestamp":1655164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T00:00:00Z","timestamp":1655164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100011341","name":"Key Laboratory for Aerosol-Cloud-Precipitation","doi-asserted-by":"publisher","award":["F2021201049"],"award-info":[{"award-number":["F2021201049"]}],"id":[{"id":"10.13039\/501100011341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s11227-022-04598-x","type":"journal-article","created":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T13:07:00Z","timestamp":1655212020000},"page":"18994-19019","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An efficient auditing scheme with a novel structure for multiple replicas"],"prefix":"10.1007","volume":"78","author":[{"given":"Junfeng","family":"Tian","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4662-4615","authenticated-orcid":false,"given":"Qianqian","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,14]]},"reference":[{"key":"4598_CR1","unstructured":"Armknecht F, Barman L, Bohli JM, Karame GO (2016) Mirror: enabling proofs of data replication and retrievability in the cloud. In: Proc 25th USENIX Secur Symp, pp 1051\u20131068"},{"key":"4598_CR2","doi-asserted-by":"publisher","unstructured":"Ateniese G, Burns R, Curtmola R, Herring J, Kissner L, Peterson Z, Song D (2007) Provable data possession at untrusted stores. In: Proc 14th ACM Conf Comput Commun Secur, pp 598\u2013610. https:\/\/doi.org\/10.1145\/1315245.1315318","DOI":"10.1145\/1315245.1315318"},{"key":"4598_CR3","doi-asserted-by":"publisher","unstructured":"Ateniese G, Pietro RD, Mancini LV, Tsudik G (2008) Scalable and efficient provable data possession. In: Proc 4th Int Conf Secur Privacy Commun Netowrks, pp 1\u201310. https:\/\/doi.org\/10.1145\/1460877.1460889","DOI":"10.1145\/1460877.1460889"},{"key":"4598_CR4","doi-asserted-by":"publisher","unstructured":"Erway CC, K\u00fcp\u00e7\u00fc A, Papamanthou C, Tamassia R, Dynamic (2009) provable data possession. In: Proc 16th ACM Conf Comput Commun Secur (CCS), pp 213\u2013222. https:\/\/doi.org\/10.1145\/2699909","DOI":"10.1145\/2699909"},{"issue":"5","key":"4598_CR5","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1109\/TPDS.2010.183","volume":"22","author":"Q Wang","year":"2011","unstructured":"Wang Q, Wang C, Ren K, Lou W, Li J (2011) Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans Parallel Distrib Syst 22(5):847\u2013859. https:\/\/doi.org\/10.1109\/TPDS.2010.183","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4598_CR6","doi-asserted-by":"publisher","unstructured":"Shacham H, Waters B (2008) Compact proofs of retrievability. In: Proc 14th Int Conf Theory Appl Cryptol Inf Secur (ASIACRYPT), pp 90\u2013107. https:\/\/doi.org\/10.1007\/978-3-540-89255-7_7","DOI":"10.1007\/978-3-540-89255-7_7"},{"key":"4598_CR7","doi-asserted-by":"publisher","unstructured":"Zheng Q, Xu S (2011) Fair and dynamic proofs of retrievability. In: Proc 1st ACM Conf Data Appl Secur Priv (CODASPY), pp 237\u2013248. https:\/\/doi.org\/10.1145\/1943513.1943546","DOI":"10.1145\/1943513.1943546"},{"issue":"4","key":"4598_CR8","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1109\/TSC.2015.2481880","volume":"11","author":"Z Ren","year":"2018","unstructured":"Ren Z, Wang L, Wang Q, Xu M (2018) Dynamic proofs of retrievability for coded cloud storage systems. IEEE Trans Serv Comput 11(4):685\u2013698. https:\/\/doi.org\/10.1109\/TSC.2015.2481880","journal-title":"IEEE Trans Serv Comput"},{"key":"4598_CR9","doi-asserted-by":"publisher","unstructured":"Cash D, K\u00fcp\u00e7\u00fc A, Wichs D (2013) Dynamic proofs of retrievability via oblivious RAM. In: Proc 32nd Int Conf Theory Appl Cryptogr Tech (EUROCRYPT) 7881:279\u2013295. https:\/\/doi.org\/10.1007\/978-3-642-38348-9_17","DOI":"10.1007\/978-3-642-38348-9_17"},{"key":"4598_CR10","doi-asserted-by":"publisher","unstructured":"Shi E, Stefanov E, Papamanthou C (2013) Practical dynamic proofs of retrievability. In: Proc 20th ACM Conf Comput Commun Secur (CCS), pp 325\u2013336. https:\/\/doi.org\/10.1145\/2508859.2516669","DOI":"10.1145\/2508859.2516669"},{"issue":"9","key":"4598_CR11","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1109\/TKDE.2011.62","volume":"23","author":"Z Hao","year":"2011","unstructured":"Hao Z, Zhong S, Yu N (2011) A privacy-preserving remote data integrity checking protocol with data dynamics and public verifiability. IEEE Trans Knowl Data Eng 23(9):1432\u20131437. https:\/\/doi.org\/10.1109\/TKDE.2011.62","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"4598_CR12","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/TSC.2015.2512589","volume":"10","author":"H Tian","year":"2017","unstructured":"Tian H, Chen Y, Chang CC, Jiang H, Huang Y, Chen Y, Liu J (2017) Dynamic-hash-table based public auditing for secure cloud storage. IEEE Trans Serv Comput 10(5):701\u2013714. https:\/\/doi.org\/10.1109\/TSC.2015.2512589","journal-title":"IEEE Trans Serv Comput"},{"issue":"2","key":"4598_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/TSC.2011.51","volume":"6","author":"Y Zhu","year":"2013","unstructured":"Zhu Y, Ahn GJ, Hu H, Yau SS, An HG, Hu CJ (2013) Dynamic audit services for outsourced storages in clouds. IEEE Trans Serv Comput 6(2):227\u2013238. https:\/\/doi.org\/10.1109\/TSC.2011.51","journal-title":"IEEE Trans Serv Comput"},{"key":"4598_CR14","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/4186243","author":"L Rao","year":"2018","unstructured":"Rao L, Tu T, Zhang H, Wen Q, Xiao J (2018) Dynamic outsourced proofs of retrievability enabling auditing migration for remote storage security. Wirel Commun Mob Comput. https:\/\/doi.org\/10.1155\/2018\/4186243","journal-title":"Wirel Commun Mob Comput"},{"issue":"4","key":"4598_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2943783","volume":"12","author":"E Esiner","year":"2016","unstructured":"Esiner E, Kachkeev A, Braunfeld S, K\u00fcp\u00e7\u00fc A, Ozkasap O (2016) FlexDPDP: flexlist-based optimized dynamic provable data possession. ACM Trans Storage 12(4):1\u201344. https:\/\/doi.org\/10.1145\/2943783","journal-title":"ACM Trans Storage"},{"key":"4598_CR16","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.future.2019.01.009","volume":"95","author":"W Guo","year":"2019","unstructured":"Guo W, Zhang H, Qin S, Gao F, Jin Z, Li W, Wen Q (2019) Outsourced dynamic provable data possession with batch update for secure cloud storage. Futur Gener Comp Syst 95:309\u2013322. https:\/\/doi.org\/10.1016\/j.future.2019.01.009","journal-title":"Futur Gener Comp Syst"},{"key":"4598_CR17","doi-asserted-by":"publisher","unstructured":"Armknecht F, Bohli JM, Froelicher D, Karame GO (2017) Sharing proofs of retrievability across tenants. In: Proc 12nd ACM Symp Inf Comput Commun Secur (ASIA CCS), pp 275\u2013287. https:\/\/doi.org\/10.1145\/3052973.3052997","DOI":"10.1145\/3052973.3052997"},{"key":"4598_CR18","doi-asserted-by":"publisher","unstructured":"Curtmola R, Khan O, Burns R, Ateniese G (2008) MR-PDP: multiple-replica provable data possession. In: The 28th International Conference on Distributed Computing Systems, pp 411\u2013420. https:\/\/doi.org\/10.1109\/ICDCS.2008.68","DOI":"10.1109\/ICDCS.2008.68"},{"key":"4598_CR19","doi-asserted-by":"publisher","unstructured":"Etemad M, K\u00fcp\u00e7\u00fc A (2013) Transparent, distributed, and replicated dynamic provable data possession. In: Jacobson M, Locasto M, Mohassel P, Safavi-Naini R (eds) Applied Cryptography and Network Security. ACNS 2013. Lecture Notes in Computer Science, vol 7954 pp 1\u201318. https:\/\/doi.org\/10.1007\/978-3-642-38980-1_1","DOI":"10.1007\/978-3-642-38980-1_1"},{"issue":"3","key":"4598_CR20","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1109\/TIFS.2014.2384391","volume":"10","author":"AF Barsoum","year":"2015","unstructured":"Barsoum AF, Hasan MA (2015) Provable multicopy dynamic data possession in cloud computing systems. IEEE Trans Inf Forensics Secur 10(3):485\u2013497. https:\/\/doi.org\/10.1109\/TIFS.2014.2384391","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"4598_CR21","unstructured":"Armknecht F, Barman L, Bohli JM, Karame GO (2016) Mirror: enabling proofs of data replication and retrievability in the cloud. In: Proc 25th USENIX Secur Symp, pp 1051\u20131068."},{"issue":"9","key":"4598_CR22","doi-asserted-by":"publisher","first-page":"2609","DOI":"10.1109\/TC.2014.2375190","volume":"64","author":"C Liu","year":"2015","unstructured":"Liu C, Ranjan R, Yang C, Zhang X, Wang L, Chen J (2015) MuRDPA Top-down level ed multireplica Merkle hash tree based secure public auditing for dynamic big data storage on cloud. IEEE Trans Comput 64(9):2609\u20132622. https:\/\/doi.org\/10.1109\/TC.2014.2375190","journal-title":"IEEE Trans Comput"},{"key":"4598_CR23","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2020.3022812","author":"W Guo","year":"2020","unstructured":"Guo W et al (2020) Dynamic proof of data possession and replication with tree sharing and batch verification in the cloud. IEEE Transactions on Services Computing. https:\/\/doi.org\/10.1109\/TSC.2020.3022812","journal-title":"IEEE Transactions on Services Computing"},{"issue":"1","key":"4598_CR24","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jnth.1996.0068","volume":"58","author":"P Ribenboim","year":"1996","unstructured":"Ribenboim P, McDaniel WL (1996) The square terms in Lucas sequences. J Number Theory 58(1):104\u2013123. https:\/\/doi.org\/10.1006\/jnth.1996.0068","journal-title":"J Number Theory"},{"key":"4598_CR25","doi-asserted-by":"publisher","unstructured":"Armknecht F, Bohli JM, Karame GO, Liu Z, Reuter CA (2014) Outsourced proofs of retrievability. In: ACM CCS, pp 831\u2013843. https:\/\/doi.org\/10.1145\/2660267.2660310","DOI":"10.1145\/2660267.2660310"},{"issue":"5","key":"4598_CR26","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1145\/2660267.2660310","volume":"22","author":"Q Wang","year":"2011","unstructured":"Wang Q, Wang C, Ren K, Lou W, Li J (2011) Enabling public auditability and data dynamics for storage security in cloud computing. IEEE Trans Parallel Distrib Syst 22(5):847\u2013859. https:\/\/doi.org\/10.1145\/2660267.2660310","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4598_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Short signatures from the Weil pairing","author":"D Boneh","year":"2001","unstructured":"Boneh D, Lynn B, Shacham H (2001) Short signatures from the Weil pairing. Springer, Berlin"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04598-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04598-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04598-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T11:27:24Z","timestamp":1666870044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04598-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,14]]},"references-count":27,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["4598"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04598-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,6,14]]},"assertion":[{"value":"10 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2022","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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}