{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T09:54:51Z","timestamp":1768730091195,"version":"3.49.0"},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2011,5]]},"abstract":"<jats:p>\n            We introduce a model for\n            <jats:italic>provable data possession<\/jats:italic>\n            (PDP) that can be used for remote data checking: A client that has stored data at an untrusted server can verify that the server possesses the original data without retrieving it. The model generates probabilistic proofs of possession by sampling random sets of blocks from the server, which drastically reduces I\/O costs. The client maintains a constant amount of metadata to verify the proof. The challenge\/response protocol transmits a small, constant amount of data, which minimizes network communication. Thus, the PDP model for remote data checking is lightweight and supports large data sets in distributed storage systems. The model is also robust in that it incorporates mechanisms for mitigating arbitrary amounts of data corruption.\n          <\/jats:p>\n          <jats:p>We present two provably-secure PDP schemes that are more efficient than previous solutions. In particular, the overhead at the server is low (or even constant), as opposed to linear in the size of the data. We then propose a generic transformation that adds robustness to any remote data checking scheme based on spot checking. Experiments using our implementation verify the practicality of PDP and reveal that the performance of PDP is bounded by disk I\/O and not by cryptographic computation. Finally, we conduct an in-depth experimental evaluation to study the tradeoffs in performance, security, and space overheads when adding robustness to a remote data checking scheme.<\/jats:p>","DOI":"10.1145\/1952982.1952994","type":"journal-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:51:38Z","timestamp":1307361098000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":270,"title":["Remote data checking using provable data possession"],"prefix":"10.1145","volume":"14","author":[{"given":"Giuseppe","family":"Ateniese","sequence":"first","affiliation":[{"name":"The Johns Hopkins University"}]},{"given":"Randal","family":"Burns","sequence":"additional","affiliation":[{"name":"The Johns Hopkins University"}]},{"given":"Reza","family":"Curtmola","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology"}]},{"given":"Joseph","family":"Herring","sequence":"additional","affiliation":[{"name":"The Johns Hopkins University"}]},{"given":"Osama","family":"Khan","sequence":"additional","affiliation":[{"name":"The Johns Hopkins University"}]},{"given":"Lea","family":"Kissner","sequence":"additional","affiliation":[{"name":"Google, Inc."}]},{"given":"Zachary","family":"Peterson","sequence":"additional","affiliation":[{"name":"Naval Postgraduate School"}]},{"given":"Dawn","family":"Song","sequence":"additional","affiliation":[{"name":"University of California, Berkeley"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Proceedings of the Theory of Cryptography.","author":"Abe M.","unstructured":"Abe , M. and Fehr , S . 2007. Perfect NIZK with adaptive soundness . In Proceedings of the Theory of Cryptography. Abe, M. and Fehr, S. 2007. Perfect NIZK with adaptive soundness. In Proceedings of the Theory of Cryptography."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315318"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460877.1460889"},{"key":"e_1_2_2_4_1","volume-title":"Advances of Cryptology (EUROCRYPT '98)","volume":"1403","author":"Bellare M.","unstructured":"Bellare , M. , Garay , J. , and Rabin , T . 1998. Fast batch verification for modular exponentiation and digital signatures . In Advances of Cryptology (EUROCRYPT '98) . Lecture Notes in Computer Science , vol. 1403 , Springer, Berlin, 236--250. Bellare, M., Garay, J., and Rabin, T. 1998. Fast batch verification for modular exponentiation and digital signatures. In Advances of Cryptology (EUROCRYPT '98). Lecture Notes in Computer Science, vol. 1403, Springer, Berlin, 236--250."},{"key":"e_1_2_2_5_1","volume-title":"Proceedings of CRYPTO'92","author":"Bellare M.","unstructured":"Bellare , M. and Goldreich , O . 1992. On defining proofs of knowledge . In Proceedings of CRYPTO'92 . Bellare, M. and Goldreich, O. 1992. On defining proofs of knowledge. In Proceedings of CRYPTO'92."},{"key":"e_1_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Bellare M.\n     and \n      Palacio A\n  . \n  2004\n  a. The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In Advances in Cryptology (CRYPTO'04) Lecture Notes in Computer Science vol. \n  3152 Springer Berlin 227--232.  Bellare M. and Palacio A. 2004a. The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In Advances in Cryptology (CRYPTO'04) Lecture Notes in Computer Science vol. 3152 Springer Berlin 227--232.","DOI":"10.1007\/978-3-540-28628-8_17"},{"key":"e_1_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Bellare M.\n     and \n      Palacio A\n  . \n  2004\n  b. Towards plaintext-aware public-key encryption without random oracles. In Advances in Cryptology (ASIACRYPT'04) Lecture Notes in Computer Science vol. \n  3329 Springer Berlin 48--62.  Bellare M. and Palacio A. 2004b. Towards plaintext-aware public-key encryption without random oracles. In Advances in Cryptology (ASIACRYPT'04) Lecture Notes in Computer Science vol. 3329 Springer Berlin 48--62.","DOI":"10.1007\/978-3-540-30539-2_4"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Bellare M.\n     and \n      Rogaway P\n  . \n  1996\n  . The exact security of digital signatures\u2014How to sign with RSA and Rabin. In Advances in Cryptology (EUROCRYPT'96) Lecture Notes in Computer Science vol. \n  1070 Springer Berlin 399--416.   Bellare M. and Rogaway P. 1996. The exact security of digital signatures\u2014How to sign with RSA and Rabin. In Advances in Cryptology (EUROCRYPT'96) Lecture Notes in Computer Science vol. 1070 Springer Berlin 399--416.","DOI":"10.1007\/3-540-68339-9_34"},{"key":"e_1_2_2_10_1","volume-title":"PSS: Provably secure encoding method for digital signatures","author":"Bellare M.","year":"1998","unstructured":"Bellare , M. and Rogaway , P . 1998 . PSS: Provably secure encoding method for digital signatures . IEEE P1363a: Provably secure signatures. Bellare, M. and Rogaway, P. 1998. PSS: Provably secure encoding method for digital signatures. IEEE P1363a: Provably secure signatures."},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Black J.\n     and \n      Rogaway P\n  . \n  2002\n  . Ciphers with arbitrary finite domains. In Topics in Cryptology (CT-RSA) Lecture Notes in Computer Science vol. \n  2271 Springer Berlin 185--203.   Black J. and Rogaway P. 2002. Ciphers with arbitrary finite domains. In Topics in Cryptology (CT-RSA) Lecture Notes in Computer Science vol. 2271 Springer Berlin 185--203.","DOI":"10.1007\/3-540-45760-7_9"},{"key":"e_1_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Boneh D. Gentry C. Lynn B. and \n      Shacham H\n  . \n  2003\n  . Aggregate and verifiably encrypted signatures from bilinear maps. In Advances in Cryptology (EUROCRYPT'03) Lecture Notes in Computer Science vol. \n  2656 Springer Berlin 416--432.   Boneh D. Gentry C. Lynn B. and Shacham H. 2003. Aggregate and verifiably encrypted signatures from bilinear maps. In Advances in Cryptology (EUROCRYPT'03) Lecture Notes in Computer Science vol. 2656 Springer Berlin 416--432.","DOI":"10.1007\/3-540-39200-9_26"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653686"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1655008.1655015"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/285243.285258"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866835.1866842"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1456469.1456481"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.68"},{"key":"e_1_2_2_19_1","volume-title":"Advances in Cryptology (CRYPTO'91)","author":"Damgard I.","unstructured":"Damgard , I. 1992. Towards practical public key systems secure against chosen ciphertext attacks . In Advances in Cryptology (CRYPTO'91) , J. Feigenbaum Ed., Lecture Notes in Computer Science, vol. 576 , Springer , Berlin, 445--456. Damgard, I. 1992. Towards practical public key systems secure against chosen ciphertext attacks. In Advances in Cryptology (CRYPTO'91), J. Feigenbaum Ed., Lecture Notes in Computer Science, vol. 576, Springer, Berlin, 445--456."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_18"},{"key":"e_1_2_2_21_1","unstructured":"Dent A. W. 2006b. The hardness of the DHK problem in the generic group model. Cryptology ePrint Archive rep. 2006\/156. http:\/\/eprint.iacr.org\/2006\/156.  Dent A. W. 2006b. The hardness of the DHK problem in the generic group model. Cryptology ePrint Archive rep. 2006\/156. http:\/\/eprint.iacr.org\/2006\/156."},{"key":"e_1_2_2_22_1","volume-title":"Proceedings of the IFIP TC11\/WG11","volume":"140","author":"Deswarte Y.","year":"2004","unstructured":"Deswarte , Y. , Quisquater , J.-J. , and Saidane , A . 2003. Remote integrity checking . In Proceedings of the IFIP TC11\/WG11 .5 6th Working Conference on Integrity and Internal Control in Information Systems (IICIS). IFIP International Federation for Information Processing , 2004 , vol. 140 , 1--11. Deswarte, Y., Quisquater, J.-J., and Saidane, A. 2003. Remote integrity checking. In Proceedings of the IFIP TC11\/WG11.5 6th Working Conference on Integrity and Internal Control in Information Systems (IICIS). IFIP International Federation for Information Processing, 2004, vol. 140, 1--11."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653688"},{"key":"e_1_2_2_24_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology (CRYPTO'89)","author":"Fiat A.","unstructured":"Fiat , A. 1990. Batch RSA . In Advances in Cryptology (CRYPTO'89) , Lecture Notes in Computer Science , vol. 435 , Springer , Berlin ,175--185. Fiat, A. 1990. Batch RSA. In Advances in Cryptology (CRYPTO'89), Lecture Notes in Computer Science, vol. 435, Springer, Berlin,175--185."},{"key":"e_1_2_2_25_1","volume-title":"M","author":"Filho D. L. G.","year":"2006","unstructured":"Filho , D. L. G. and Baretto , P. S. L . M . 2006 . Demonstrating data possession and uncheatable data transfer. IACR ePrint Archive . rep. 2006\/150, http:\/\/eprint.iacr.org\/2006\/150. Filho, D. L. G. and Baretto, P. S. L. M. 2006. Demonstrating data possession and uncheatable data transfer. IACR ePrint Archive. rep. 2006\/150, http:\/\/eprint.iacr.org\/2006\/150."},{"key":"e_1_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Golle P. Jarecki S. and \n      Mironov I\n  . \n  2002\n  . Cryptographic primitives enforcing communication and storage complexity. In Financial Cryptography Lecture Notes in Computer Science vol. \n  2357 Springer Berlin 120--135.   Golle P. Jarecki S. and Mironov I. 2002. Cryptographic primitives enforcing communication and storage complexity. In Financial Cryptography Lecture Notes in Computer Science vol. 2357 Springer Berlin 120--135.","DOI":"10.1007\/3-540-36504-4_9"},{"key":"e_1_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Hada S.\n     and \n      Tanaka T\n  . \n  1998\n  . On the existence of 3-round zero-knowledge protocols. In Advances In Cryptology (CRYPTO'98) Lecture Notes in Computer Science vol. \n  1462 Springer Berlin 197--202.   Hada S. and Tanaka T. 1998. On the existence of 3-round zero-knowledge protocols. In Advances In Cryptology (CRYPTO'98) Lecture Notes in Computer Science vol. 1462 Springer Berlin 197--202.","DOI":"10.1007\/BFb0055744"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:19980833"},{"key":"e_1_2_2_29_1","unstructured":"Iozone. Iozone filesystem benchmark. http:\/\/www.iozone.org\/.  Iozone. Iozone filesystem benchmark. http:\/\/www.iozone.org\/."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315317"},{"key":"e_1_2_2_31_1","volume-title":"Proceedings of the 2nd USENIX Conference on File and Storage Technologies (FAST'03)","author":"Kallahalla M.","unstructured":"Kallahalla , M. , Riedel , E. , Swaminathan , R. , Wang , Q. , and Fu , K . 2003. Plutus: Scalable secure file sharing on untrusted storage . In Proceedings of the 2nd USENIX Conference on File and Storage Technologies (FAST'03) . USENIX Association Berkeley, CA. Kallahalla, M., Riedel, E., Swaminathan, R., Wang, Q., and Fu, K. 2003. Plutus: Scalable secure file sharing on untrusted storage. In Proceedings of the 2nd USENIX Conference on File and Storage Technologies (FAST'03). USENIX Association Berkeley, CA."},{"key":"e_1_2_2_32_1","volume-title":"Proceedings of the USENIX Annual Technical Conference (ATC'07)","author":"Kotla R.","unstructured":"Kotla , R. , Alvisi , L. , and Dahlin , M . 2007. Safestore: A durable and practical storage system . In Proceedings of the USENIX Annual Technical Conference (ATC'07) . USENIX Association Berkeley, CA. Kotla, R., Alvisi, L., and Dahlin, M. 2007. Safestore: A durable and practical storage system. In Proceedings of the USENIX Annual Technical Conference (ATC'07). USENIX Association Berkeley, CA."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_33"},{"key":"e_1_2_2_34_1","volume-title":"Proceedings of the ACM 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'00)","author":"Kubiatowicz J.","unstructured":"Kubiatowicz , J. , Bindel , D. , Chen , Y. , Eaton , P. , Geels , D. , Gummadi , R. , Rhea , S. , Weatherspoon , H. , Weimer , W. , Wells , C. , and Zhao , B . 2000 . In Proceedings of the ACM 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'00) . ACM, New York. Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. 2000. In Proceedings of the ACM 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'00). ACM, New York."},{"key":"e_1_2_2_35_1","volume-title":"Proceedings of the 6th Conference on the Symposium on Operating Systems Design &amp; Implementation (OSDI'04)","volume":"6","author":"Li J.","unstructured":"Li , J. , Krohn , M. , Mazeres , D. , and Shasha , D . 2004. Secure untrusted data repository (SUNDR) . In Proceedings of the 6th Conference on the Symposium on Operating Systems Design &amp; Implementation (OSDI'04) . vol. 6 , USENIX Association, Berkeley, CA. Li, J., Krohn, M., Mazeres, D., and Shasha, D. 2004. Secure untrusted data repository (SUNDR). In Proceedings of the 6th Conference on the Symposium on Operating Systems Design &amp; Implementation (OSDI'04). vol. 6, USENIX Association, Berkeley, CA."},{"key":"e_1_2_2_36_1","volume-title":"Proceedings of the 4th Conference on Symposium on Operating System Design &amp; Implementation (OSDI'00)","volume":"4","author":"Maheshwari U.","unstructured":"Maheshwari , U. , Vingralek , R. , and Shapiro , W . 2000. How to build a trusted database system on untrusted storage . In Proceedings of the 4th Conference on Symposium on Operating System Design &amp; Implementation (OSDI'00) . vol. 4 , USENIX Association, Berkeley, CA. Maheshwari, U., Vingralek, R., and Shapiro, W. 2000. How to build a trusted database system on untrusted storage. In Proceedings of the 4th Conference on Symposium on Operating System Design &amp; Implementation (OSDI'00). vol. 4, USENIX Association, Berkeley, CA."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1047915.1047917"},{"key":"e_1_2_2_38_1","volume-title":"Online codes","author":"Maymounkov P.","year":"2003","unstructured":"Maymounkov , P. 2003. Online codes . New York University , Tech . rep. TR 2003 -883. Maymounkov, P. 2003. Online codes. New York University, Tech. rep. TR2003-883."},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502017"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80043-8"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1149976.1149977"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.71"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/48012.48246"},{"key":"e_1_2_2_44_1","volume-title":"Proceedings of the NDSS Symposium.","author":"Oprea A.","unstructured":"Oprea , A. , Reiter , M. K. , and Yang , K . 2005. Space-efficient block storage integrity . In Proceedings of the NDSS Symposium. Oprea, A., Reiter, M. K., and Yang, K. 2005. Space-efficient block storage integrity. In Proceedings of the NDSS Symposium."},{"key":"e_1_2_2_45_1","volume-title":"USENIX FAST'05","author":"Plank J. S.","year":"2005","unstructured":"Plank , J. S. 2005 . Erasure codes for storage applications. Tutorial Slides , USENIX FAST'05 . Plank, J. S. 2005. Erasure codes for storage applications. Tutorial Slides, USENIX FAST'05."},{"key":"e_1_2_2_46_1","volume-title":"Jerasure: A library in C\/C++ facilitating erasure coding for storage applications, Version 1.2. Tech. rep. CS-08-627","author":"Plank J. S.","year":"2008","unstructured":"Plank , J. S. , Simmerman , S. , and Schuman , C. D . 2008 . Jerasure: A library in C\/C++ facilitating erasure coding for storage applications, Version 1.2. Tech. rep. CS-08-627 , University of Tennessee . Plank, J. S., Simmerman, S., and Schuman, C. D. 2008. Jerasure: A library in C\/C++ facilitating erasure coding for storage applications, Version 1.2. Tech. rep. CS-08-627, University of Tennessee."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2006.43"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.80"},{"key":"e_1_2_2_49_1","volume-title":"-J","author":"Sebe F.","year":"2004","unstructured":"Sebe , F. , Martinez-Balleste , A. , Deswarte , Y. , Domingo-Ferrer , J. , and Quisquater , J . -J . 2004 . Time bounded remote file integrity checking. Tech. rep. 04429, LAAS. Sebe, F., Martinez-Balleste, A., Deswarte, Y., Domingo-Ferrer, J., and Quisquater, J.-J. 2004. Time bounded remote file integrity checking. Tech. rep. 04429, LAAS."},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89255-7_7"},{"key":"e_1_2_2_51_1","volume-title":"Proceedings of the 11th USENIX Workshop on Hot Topics in Operating Systems (HOTOS'07)","author":"Shah M.","unstructured":"Shah , M. , Baker , M. , Mogul , J. C. , and Swaminathan , R . 2007. Auditing to keep online storage services honest . In Proceedings of the 11th USENIX Workshop on Hot Topics in Operating Systems (HOTOS'07) , USENIX Association, Berkeley, CA. Shah, M., Baker, M., Mogul, J. C., and Swaminathan, R. 2007. Auditing to keep online storage services honest. In Proceedings of the 11th USENIX Workshop on Hot Topics in Operating Systems (HOTOS'07), USENIX Association, Berkeley, CA."},{"key":"e_1_2_2_52_1","unstructured":"Shah M. A. Swaminathan R. and Baker M. 2008. Privacy-preserving audit and extraction of digital contents. ePrint Archive rep. 2008\/186.  Shah M. A. Swaminathan R. and Baker M. 2008. Privacy-preserving audit and extraction of digital contents. ePrint Archive rep. 2008\/186."},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/357353.357357"},{"key":"e_1_2_2_54_1","volume-title":"Proceedings of the 17th International Workshop on Quality of Service (IWQoS), IEEE","author":"Wang C.","unstructured":"Wang , C. , Wang , Q. , Ren , K. , and Lou , W . 2009. Ensuring data storage security in cloud computing . In Proceedings of the 17th International Workshop on Quality of Service (IWQoS), IEEE , Los Alamitos, CA, 1--9. Wang, C., Wang, Q., Ren, K., and Lou, W. 2009. Ensuring data storage security in cloud computing. In Proceedings of the 17th International Workshop on Quality of Service (IWQoS), IEEE, Los Alamitos, CA, 1--9."},{"key":"e_1_2_2_55_1","volume-title":"ISEC2005-48","author":"Yamamoto G.","unstructured":"Yamamoto , G. , Fujisaki , E. , and Abe , M . 2005. An efficiently-verifiable zero-knowledge argument for proofs of knowledge. Tech. rep . ISEC2005-48 , IEICE. Yamamoto, G., Fujisaki, E., and Abe, M. 2005. An efficiently-verifiable zero-knowledge argument for proofs of knowledge. Tech. rep. ISEC2005-48, IEICE."},{"key":"e_1_2_2_56_1","volume-title":"Proceedings of SPEED'07","author":"Yamamoto G.","unstructured":"Yamamoto , G. , Oda , S. , and Aoki , K . 2007. Fast integrity for large data . In Proceedings of SPEED'07 . Yamamoto, G., Oda, S., and Aoki, K. 2007. Fast integrity for large data. In Proceedings of SPEED'07."},{"key":"e_1_2_2_57_1","volume-title":"Proceedings of the Workshop Record on Fast Integrity for Large Data (FAST'07)","author":"Yumerefendi A. Y.","unstructured":"Yumerefendi , A. Y. and Chase , J . 2007. Strong accountability for network storage . In Proceedings of the Workshop Record on Fast Integrity for Large Data (FAST'07) . Yumerefendi, A. Y. and Chase, J. 2007. Strong accountability for network storage. In Proceedings of the Workshop Record on Fast Integrity for Large Data (FAST'07)."}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1952982.1952994","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1952982.1952994","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:41Z","timestamp":1750244381000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1952982.1952994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["10.1145\/1952982.1952994"],"URL":"https:\/\/doi.org\/10.1145\/1952982.1952994","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"value":"1094-9224","type":"print"},{"value":"1557-7406","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5]]},"assertion":[{"value":"2010-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}