{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:55Z","timestamp":1759639015094,"version":"3.37.3"},"reference-count":37,"publisher":"Oxford University Press (OUP)","issue":"8","license":[{"start":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T00:00:00Z","timestamp":1577923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672110","61671082","61976024","61972048","61502044"],"award-info":[{"award-number":["61672110","61671082","61976024","61972048","61502044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2019XD-A01"],"award-info":[{"award-number":["2019XD-A01"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,8,20]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>For a high level of data availability and reliability, a common strategy for cloud service providers is to rely on replication, i.e. storing several replicas onto different servers. To provide cloud users with a strong guarantee that all replicas required by them are actually stored, many multi-replica integrity auditing schemes were proposed. However, most existing solutions are not resource economical since users need to create and upload replicas of their files by themselves. A multi-replica solution called Mirror is presented to overcome the problems, but we find that it is vulnerable to storage saving attack, by which a dishonest provider can considerably save storage costs compared to the costs of storing all the replicas honestly\u2014while still can pass any challenge successfully. In addition, we also find that Mirror is easily subject to substitution attack and forgery attack, which pose new security risks for cloud users. To address the problems, we propose some simple yet effective countermeasures and an improved proofs of retrievability and replication scheme, which can resist the aforesaid attacks and maintain the advantages of Mirror, such as economical bandwidth and efficient verification. Experimental results show that our scheme exhibits comparable performance with Mirror while achieving high security.<\/jats:p>","DOI":"10.1093\/comjnl\/bxz151","type":"journal-article","created":{"date-parts":[[2019,12,30]],"date-time":"2019-12-30T12:07:37Z","timestamp":1577707657000},"page":"1216-1230","source":"Crossref","is-referenced-by-count":18,"title":["Improved Proofs Of Retrievability And Replication For Data Availability In Cloud Storage"],"prefix":"10.1093","volume":"63","author":[{"given":"Wei","family":"Guo","sequence":"first","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China"},{"name":"State Key Laboratory of Cryptology, P.O. Box 5159, Beijing, 100878, China"}]},{"given":"Sujuan","family":"Qin","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China"}]},{"given":"Jun","family":"Lu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China"}]},{"given":"Fei","family":"Gao","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China"}]},{"given":"Zhengping","family":"Jin","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China"}]},{"given":"Qiaoyan","family":"Wen","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China"}]}],"member":"286","published-online":{"date-parts":[[2020,1,2]]},"reference":[{"key":"2020081712164635600_ref1","first-page":"136","article-title":"Cryptographic Cloud Storage","volume-title":"Proc. FC 10 Workshops","author":"Kamara","year":"2010"},{"key":"2020081712164635600_ref2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.jnca.2014.04.011","article-title":"A review on remote data auditing in single cloud server: taxonomy and open issues","volume":"43","author":"Sookhak","year":"2014","journal-title":"J. Netw. Comput. Appl."},{"key":"2020081712164635600_ref3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MSP.2017.16","article-title":"Cloud data auditing techniques with a focus on privacy and security","volume":"15","author":"Kolhar","year":"2014","journal-title":"IEEE Secur. Priv."},{"key":"2020081712164635600_ref4","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1145\/1315245.1315318","article-title":"Provable Data Possession at Untrusted Stores","volume-title":"Proc. CCS 07","author":"Ateniese","year":"2007"},{"key":"2020081712164635600_ref5","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1145\/1315245.1315317","article-title":"PORs: Proofs of Retrievability for Large Files","volume-title":"Proc. CCS 07","author":"Juels","year":"2007"},{"key":"2020081712164635600_ref6","first-page":"90","article-title":"Compact Proofs of Retrievability","volume-title":"Proc. ASIACRYPT 08","author":"Shacham","year":"2008"},{"key":"2020081712164635600_ref7","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/1653662.1653688","article-title":"Dynamic Provable Data Possession","volume-title":"Proc. CCS 09","author":"Erway","year":"2009"},{"key":"2020081712164635600_ref8","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1109\/TPDS.2010.183","article-title":"Enabling public auditability and data dynamics for storage security in cloud computing","volume":"22","author":"Wang","year":"2011","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2020081712164635600_ref9","first-page":"325","article-title":"Practical Dynamic Proofs of Retrievability","volume-title":"Proc. CCS 13","author":"Shi","year":"2013"},{"key":"2020081712164635600_ref10","article-title":"Dynamic outsourced auditing services for cloud storage based on batch-leaves-authenticated Merkle hash tree","author":"Rao","year":"2017","journal-title":"IEEE Trans. Serv. Comput."},{"key":"2020081712164635600_ref11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.future.2019.01.009","article-title":"Outsourced dynamic provable data possession with batch update for secure cloud storage","volume":"95","author":"Guo","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"2020081712164635600_ref12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/945445.945450","article-title":"The Google File System","volume-title":"Proc. SOSP 03","author":"Ghemawat","year":"2003"},{"key":"2020081712164635600_ref13","first-page":"143","article-title":"Glacier: Highly Durable, Decentralized Storage Despite Massive Correlated Failures","volume-title":"Proc. NSDI 05","author":"Haeberlen","year":"2005"},{"author":"Amazon S3 service level agreement","key":"2020081712164635600_ref14"},{"key":"2020081712164635600_ref15","first-page":"411","article-title":"MR-PDP: Multiple-Replica Provable Data Possession","volume-title":"Proc. ICDCS 08","author":"Curtmola","year":"2008"},{"key":"2020081712164635600_ref16","first-page":"1","article-title":"Transparent, Distributed, and Replicated Dynamic Provable Data Possession","volume-title":"Proc. ACNS 13","author":"Etemad","year":"2013"},{"key":"2020081712164635600_ref17","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1109\/TIFS.2014.2384391","article-title":"Provable multicopy dynamic data possession in cloud computing systems","volume":"10","author":"Barsoum","year":"2015","journal-title":"IEEE Trans. Inf. Forensics Security"},{"key":"2020081712164635600_ref18","doi-asserted-by":"crossref","first-page":"2609","DOI":"10.1109\/TC.2014.2375190","article-title":"MuR-DPA: top-down levelled multi-replica Merkle hash tree based secure public auditing for dynamic big data storage on cloud","volume":"64","author":"Liu","year":"2015","journal-title":"IEEE Trans. Comput."},{"author":"Amazon S3 introduces cross-region replication","key":"2020081712164635600_ref19"},{"author":"Amazon S3 pricing","key":"2020081712164635600_ref20"},{"key":"2020081712164635600_ref21","first-page":"1051","article-title":"Mirror: Enabling Proofs of Data Replication and Retrievability in the Cloud","volume-title":"Proc. USENIX Security 16","author":"Armknecht","year":"2016"},{"key":"2020081712164635600_ref22","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1394127.1394131","article-title":"Distributed computing economics","volume":"6","author":"Gray","year":"2008","journal-title":"ACM Queue"},{"key":"2020081712164635600_ref23","first-page":"585","article-title":"Proofs of Space","volume-title":"Proc. CRYPTO 15","author":"Dziembowski","year":"2015"},{"key":"2020081712164635600_ref24","first-page":"59:1","article-title":"Proofs of Catalytic Space","volume-title":"Proc. ITCS 19","author":"Pietrzak","year":"2019"},{"year":"2018","author":"Fisch","article-title":"Tight proofs of space and replication","key":"2020081712164635600_ref25"},{"key":"2020081712164635600_ref26","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/3176258.3176315","article-title":"Secure Storage with Replication and Transparent Deduplication","volume-title":"Proc. CODASPY 18","author":"Leontiadis","year":"2018"},{"year":"2018","author":"Damg\u00e5rd","article-title":"Proofs of replicated storage without timing assumptions","key":"2020081712164635600_ref27"},{"key":"2020081712164635600_ref28","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/2382196.2382227","article-title":"Hourglass Schemes: How to Prove that Cloud Files are Encrypted","volume-title":"Proc. CCS 12","author":"van Dijk","year":"2012"},{"key":"2020081712164635600_ref29","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/2381913.2381926","article-title":"LoSt: Location Based storage","volume-title":"Proc. CCSW 12","author":"Watson","year":"2012"},{"volume-title":"Time-Lock Puzzles and Timed-Release Crypto","year":"1996","author":"Rivest","key":"2020081712164635600_ref30"},{"key":"2020081712164635600_ref31","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/1030083.1030117","article-title":"New Client Puzzle Outsourcing Techniques for DoS Resistance","volume-title":"Proc. CCS 04","author":"Waters","year":"2004"},{"key":"2020081712164635600_ref32","first-page":"679","article-title":"Low-Cost Client Puzzles Based on Modular Exponentiation","volume-title":"Proc. ESORICS 10","author":"Karame","year":"2010"},{"volume-title":"Introduction to Finite Fields and Their Applications","year":"1986","author":"Lidl","key":"2020081712164635600_ref33"},{"key":"2020081712164635600_ref34","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/2435349.2435402","article-title":"Towards Self-Repairing Replication-Based Storage Systems Using Untrusted Clouds","volume-title":"Proc. CODASPY 13","author":"Chen","year":"2013"},{"author":"Charm","key":"2020081712164635600_ref35"},{"key":"2020081712164635600_ref36","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s13389-013-0057-3","article-title":"Charm: a framework for rapidly prototyping cryptosystems","volume":"3","author":"Akinyele","year":"2013","journal-title":"J. Cryptogr. Eng."},{"key":"2020081712164635600_ref37","article-title":"A Proposal for an ISO Standard for Public Key Encryption (Version. 2.1)","author":"Shoup","year":"2001","journal-title":"IBM Zurich Research Lab Technical Report"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/63\/8\/1216\/33657151\/bxz151.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/63\/8\/1216\/33657151\/bxz151.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T16:37:28Z","timestamp":1597682248000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/63\/8\/1216\/5686324"}},"subtitle":[],"editor":[{"given":"Daniele","family":"Sgandurra","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,1,2]]},"references-count":37,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2020,1,2]]},"published-print":{"date-parts":[[2020,8,20]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxz151","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2020,8]]},"published":{"date-parts":[[2020,1,2]]}}}