{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:40:08Z","timestamp":1763458808536,"version":"3.45.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,2,19]],"date-time":"2017-02-19T00:00:00Z","timestamp":1487462400000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"crossref","award":["FA9550-09-1-0223 and FA9550-13-1-0066"],"award-info":[{"award-number":["FA9550-09-1-0223 and FA9550-13-1-0066"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Science Foundation","award":["CNS-1223699 and CNS-1319090"],"award-info":[{"award-number":["CNS-1223699 and CNS-1319090"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2016,3,8]]},"abstract":"<jats:p>\n                    The emergence and wide availability of remote storage service providers prompted work in the security community that allows clients to verify integrity and availability of the data that they outsourced to a not fully trusted remote storage server at a relatively low cost. Most recent solutions to this problem allow clients to read and update (i.e., insert, modify, or delete) stored data blocks while trying to lower the overhead associated with verifying the integrity of the stored data. In this work, we develop a novel scheme, performance of which favorably compares with the existing solutions. Our solution additionally enjoys a number of new features, such as a natural support for operations on ranges of blocks, revision control, and support for multiple user access to shared content. The performance guarantees that we achieve stem from a novel data structure called a\n                    <jats:italic toggle=\"yes\">balanced update tree<\/jats:italic>\n                    and removing the need for interaction during update operations in addition to communicating the updates themselves.\n                  <\/jats:p>","DOI":"10.1145\/2747877","type":"journal-article","created":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T08:07:16Z","timestamp":1456128436000},"page":"1-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Efficient Dynamic Provable Possession of Remote Data via Update Trees"],"prefix":"10.1145","volume":"12","author":[{"given":"Yihua","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Notre Dame, Notre Dame, IN"}]},{"given":"Marina","family":"Blanton","sequence":"additional","affiliation":[{"name":"University of Notre Dame, Notre Dame, IN"}]}],"member":"320","published-online":{"date-parts":[[2016,2,19]]},"reference":[{"volume-title":"Proceedings of the USSR Academy of Sciences. 263--266","author":"Adelson-Velskii G.","key":"e_1_2_1_1_1","unstructured":"G. Adelson-Velskii and E. M. Landis. 1962. An algorithm for the organization of information. In Proceedings of the USSR Academy of Sciences. 263--266."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/648025.744371"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315318"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","unstructured":"G. Ateniese R. Di Pietro L. Mancini and G. Tsudik. 2008. Scalable and efficient provable data possession. In Security and Privacy in Communication Networks (SecureComm\u201908). 9:1--9:10. 10.1145\/1460877.1460889","DOI":"10.1145\/1460877.1460889"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","unstructured":"G. Ateniese S. Kamara and J. Katz. 2009. Proofs of storage from homomorphic identification protocols. In Advances in Cryptology -- ASIACRYPT. 319--333. 10.1007\/978-3-642-10366-7_19","DOI":"10.1007\/978-3-642-10366-7_19"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90117-0"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653686"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1655008.1655015"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","unstructured":"E. Chang and J. Xu. 2008. Remote integrity check with dishonest storage server. In ESORICS. 223--237. 10.1007\/978-3-540-88313-5_15","DOI":"10.1007\/978-3-540-88313-5_15"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.68"},{"issue":"1","key":"e_1_2_1_11_1","first-page":"212","article-title":"Interval trees. In Computational Geometry (2nd ed.). Springer-Verlag","volume":"10","author":"de Berg M.","year":"2000","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. 2000. Interval trees. In Computational Geometry (2nd ed.). Springer-Verlag, Chapter 10.1, 212--217.","journal-title":"Chapter"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Y. Dodis S. Dadhan and D. Wichs. 2009. Proofs of retrievability via hardness amplification. In TCC. 10.1007\/978-3-642-00457-5_8","DOI":"10.1007\/978-3-642-00457-5_8"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1416944.1416949"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1973355.1973370"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","unstructured":"C. Ellis and S. Gibbs. 1989. Concurrency control in groupware systems. In SIGMOD. 399--407. 10.1145\/67544.66963","DOI":"10.1145\/67544.66963"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653688"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85886-7_6"},{"volume-title":"DARPA Information Survivability Conference and Exposition.","author":"Goodrich M.","key":"e_1_2_1_18_1","unstructured":"M. Goodrich, R. Tamassia, and A. Schwerin. 2001. Implementation of an authenticated dictionary with skip lists and commutative hashing. In DARPA Information Survivability Conference and Exposition."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","unstructured":"A. Heitzmann B. Palazzi C. Papamanthou and R. Tamassia. 2008. Efficient integrity checking of untrusted network storage. In StorageSS. 43--54. 10.1145\/1456469.1456479","DOI":"10.1145\/1456469.1456479"},{"key":"e_1_2_1_20_1","volume-title":"IT Cloud Services User Survey, pt. 2: Top Benefits & Challenges. Retrieved","author":"DC.","year":"2016","unstructured":"IDC. 2008. IT Cloud Services User Survey, pt. 2: Top Benefits & Challenges. Retrieved January 9, 2016 from http:\/\/blogs.idc.com\/ie\/?p&equals;&equals;210."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","unstructured":"A. Juels and B. Kaliski. 2007. PORs: Proofs of retrievability for large files. In CCS. 584--597. 10.1145\/1315245.1315317","DOI":"10.1145\/1315245.1315317"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251254.1251263"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.331"},{"volume-title":"IEEE ICC Communication and Information Systems Security Symposium.","author":"Mo Z.","key":"e_1_2_1_25_1","unstructured":"Z. Mo, Y. Zhou, and S. Chen. 2012. A dynamic proof of retrievability (PoR) scheme with O(log n) complexity. In IEEE ICC Communication and Information Systems Security Symposium."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1362903.1362916"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1785001.1785003"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2002181.2002212"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190647"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","unstructured":"H. Shacham and B. Waters. 2008. Compact proofs of retrievability. In ASIACRYPT. 90--107. 10.1007\/978-3-540-89255-7_7","DOI":"10.1007\/978-3-540-89255-7_7"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2420950.2420985"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31284-7_30"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2012.46"},{"volume-title":"IEEE International Conference on Computer Communications (INFOCOM\u201913)","author":"Wang B.","key":"e_1_2_1_35_1","unstructured":"B. Wang, B. Li, and H. Li. 2013. Public auditing for shared data with efficient user revocation in the cloud. In IEEE International Conference on Computer Communications (INFOCOM\u201913). 2904--2912."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.245"},{"volume-title":"International Workshop on Quality of Service. 1--9.","author":"Wang C.","key":"e_1_2_1_37_1","unstructured":"C. Wang, Q. Wang, K. Ren, and W. Lou. 2009b. Ensuring data storage security in cloud computing. In International Workshop on Quality of Service. 1--9."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Q. Wang C. Wang J. Li K. Ren and W. Lou. 2009a. Enabling public verifiability and data dynamics for storage security in cloud computing. In ESORICS. 355--370.","DOI":"10.5555\/1813084.1813114"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2010.36"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","unstructured":"K. Zeng. 2008. Publicly verifiable remote data integrity. In ICICS. 419--434. 10.1007\/978-3-540-88625-9_28","DOI":"10.1007\/978-3-540-88625-9_28"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","unstructured":"Q. Zheng and S. Xu. 2011. Fair and dynamic proofs of retrievability. In CODASPY. 237--248. 10.1145\/1943513.1943546","DOI":"10.1145\/1943513.1943546"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2747877","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2747877","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2747877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:35:36Z","timestamp":1763458536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2747877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,19]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3,8]]}},"alternative-id":["10.1145\/2747877"],"URL":"https:\/\/doi.org\/10.1145\/2747877","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2016,2,19]]},"assertion":[{"value":"2014-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-03-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-02-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}