{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T05:10:08Z","timestamp":1750050608434,"version":"3.41.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031946769","type":"print"},{"value":"9783031946776","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-94677-6_3","type":"book-chapter","created":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T04:43:57Z","timestamp":1750049037000},"page":"26-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Accountable Storage: An Efficient Protocol for\u00a0Real-Time Cloud Storage Auditing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8943-191X","authenticated-orcid":false,"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7329-9590","authenticated-orcid":false,"given":"Ryuto","family":"Kitagawa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3549-9589","authenticated-orcid":false,"given":"Vinesh","family":"Sridhar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Bohli, J.M., Karame, G.O., Liu, Z., Reuter, C.A.: Outsourced proofs of retrievability. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 831\u2013843 (2014)","DOI":"10.1145\/2660267.2660310"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ateniese, G., et al.: Provable data possession at untrusted stores. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 598\u2013609 (2007)","DOI":"10.1145\/1315245.1315318"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Di\u00a0Pietro, R., Mancini, L.V., Tsudik, G.: Scalable and efficient provable data possession. In: Proceedings of the 4th International Conference on Security and Privacy in Communication Networks, pp. 1\u201310 (2008)","DOI":"10.1145\/1460877.1460889"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Ateniese, G., Goodrich, M.T., Lekakis, V., Papamanthou, C., Paraskevas, E., Tamassia, R.: Accountable storage. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) Applied Cryptography and Network Security. pp. 623\u2013644. Lecture Notes in Computer Science. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_31","DOI":"10.1007\/978-3-319-61204-1_31"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236\u2013250. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054130","DOI":"10.1007\/BFb0054130"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Annual Cryptology Conference, pp. 111\u2013131. Springer (2011)","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Farach-Colton, M., Goodrich, M.T., Koml\u00f3s, H.: History-independent dynamic partitioning: Operation-order privacy in ordered data structures. Proc. ACM Manag. Data 2(2) (2024). https:\/\/doi.org\/10.1145\/3651609","DOI":"10.1145\/3651609"},{"issue":"7","key":"3_CR8","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) Computer Security - ESORICS, pp. 192\u2013206. Springer (2008)","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Cash, D., K\u00fcp\u00e7\u00fc, A., Wichs, D.: Dynamic Proofs of Retrievability Via Oblivious RAM. J. Cryptol. 30(1), 22\u201357 (2015). https:\/\/doi.org\/10.1007\/s00145-015-9216-2","DOI":"10.1007\/s00145-015-9216-2"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5","DOI":"10.1007\/978-3-642-36362-7_5"},{"issue":"12","key":"3_CR12","doi-asserted-by":"publisher","first-page":"3729","DOI":"10.1109\/TKDE.2020.2975777","volume":"33","author":"X Chen","year":"2020","unstructured":"Chen, X., et al.: Publicly verifiable databases with all efficient updating operations. IEEE Trans. Knowl. Data Eng. 33(12), 3729\u20133740 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"3_CR13","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1109\/TDSC.2014.2366471","volume":"12","author":"X Chen","year":"2014","unstructured":"Chen, X., Li, J., Huang, X., Ma, J., Lou, W.: New publicly verifiable databases with efficient updates. IEEE Trans. Dependable Secure Comput. 12(5), 546\u2013556 (2014)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"10","key":"3_CR14","doi-asserted-by":"publisher","first-page":"3184","DOI":"10.1109\/TC.2015.2512870","volume":"65","author":"X Chen","year":"2015","unstructured":"Chen, X., Li, J., Weng, J., Ma, J., Lou, W.: Verifiable computation over large database with incremental updates. IEEE Trans. Comput. 65(10), 3184\u20133195 (2015)","journal-title":"IEEE Trans. Comput."},{"key":"3_CR15","unstructured":"Crosby, S.A., Wallach, D.S.: Efficient data structures for tamper-evident logging. In: USENIX Security Symposium, pp. 317\u2013334 (2009)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Khan, O., Burns, R., Ateniese, G.: MR-PDP: multiple-replica provable data possession. In: 2008 the 28th International Conference on Distributed Computing Systems, pp. 411\u2013420. IEEE (2008)","DOI":"10.1109\/ICDCS.2008.68"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1109\/TKDE.2010.132","volume":"23","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D., Goodrich, M.T.: Straggler identification in round-trip data streams via newton\u2019s identities and invertible bloom filters. IEEE Trans. Knowl. Data Eng. 23(2), 297\u2013306 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/2043164.2018462","volume":"41","author":"D Eppstein","year":"2011","unstructured":"Eppstein, D., Goodrich, M.T., Uyeda, F., Varghese, G.: What\u2019s the difference? Efficient set reconciliation without prior context. ACM SIGCOMM Comput. Commun. Rev. 41(4), 218\u2013229 (2011). https:\/\/doi.org\/10.1145\/2043164.2018462","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Erway, C.C., Kupcu, A., Papamanthou, C., Tamassia, R.: Dynamic Provable Data Possession (2008)","DOI":"10.1145\/1653662.1653688"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Invertible bloom lookup tables. In: 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 792\u2013799 (2011).https:\/\/doi.org\/10.1109\/Allerton.2011.6120248, https:\/\/ieeexplore.ieee.org\/abstract\/document\/6120248","DOI":"10.1109\/Allerton.2011.6120248"},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1109\/TCC.2016.2525998","volume":"6","author":"H Jin","year":"2016","unstructured":"Jin, H., Jiang, H., Zhou, K.: Dynamic and public auditing with fair arbitration for cloud data. IEEE Trans. Cloud Comput. 6(3), 680\u2013693 (2016)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Juels, A., Kaliski\u00a0Jr, B.S.: PORS: proofs of retrievability for large files. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 584\u2013597 (2007)","DOI":"10.1145\/1315245.1315317"},{"key":"3_CR23","unstructured":"Klotz, A.: Google Drive users are reporting the loss of months of data. tom\u2019s HARDWARE (2023). https:\/\/www.tomshardware.com\/software\/cloud-storage\/google-drive-users-are-reporting-the-loss-of-months-of-data"},{"issue":"9","key":"3_CR24","doi-asserted-by":"publisher","first-page":"2234","DOI":"10.1109\/TPDS.2013.191","volume":"25","author":"C Liu","year":"2013","unstructured":"Liu, C., et al.: Authorized public auditing of dynamic big data storage on cloud with efficient verifiable fine-grained updates. IEEE Trans. Parallel Distrib. Syst. 25(9), 2234\u20132244 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR25","unstructured":"Mellor, C.: Google Cloud deleted a large customer\u2019s infrastructure. Blocks & Files (2024). https:\/\/blocksandfiles.com\/2024\/05\/14\/google-cloud-unisuper\/"},{"issue":"2","key":"3_CR26","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/TIFS.2017.2758746","volume":"13","author":"M Miao","year":"2017","unstructured":"Miao, M., Ma, J., Huang, X., Wang, Q.: Efficient verifiable databases with insertion\/deletion operations from delegating polynomial functions. IEEE Trans. Inf. Forensics Secur. 13(2), 511\u2013520 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"3_CR27","unstructured":"Pallardy, C.: UniSuper\u2019s cloud outage and Google\u2019s \u2018one-of-a-kind\u2019 misconfig. Information Week (2024). https:\/\/www.informationweek.com\/cyber-resilience\/lessons-learned-from-the-unisuper-cloud-outage"},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s00145-012-9129-2","volume":"26","author":"H Shacham","year":"2013","unstructured":"Shacham, H., Waters, B.: Compact proofs of retrievability. J. Cryptol. 26(3), 442\u2013483 (2013)","journal-title":"J. Cryptol."},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Shi, E., Stefanov, E., Papamanthou, C.: Practical dynamic proofs of retrievability. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 325\u2013336 (2013)","DOI":"10.1145\/2508859.2516669"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1007\/s00500-016-2311-y","volume":"21","author":"H Tian","year":"2017","unstructured":"Tian, H., et al.: Enabling public auditability for operation behaviors in cloud storage. Soft. Comput. 21, 2175\u20132187 (2017)","journal-title":"Soft. Comput."},{"issue":"4","key":"3_CR31","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1109\/TIFS.2016.2615853","volume":"12","author":"Y Yu","year":"2016","unstructured":"Yu, Y., et al.: Identity-based remote data integrity checking with perfect data privacy preserving for cloud storage. IEEE Trans. Inf. Forensics Secur. 12(4), 767\u2013778 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-94677-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T04:44:00Z","timestamp":1750049040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-94677-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031946769","9783031946776"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-94677-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ALGOCLOUD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Aspects of Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algocloud2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2024\/algocloud\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}