{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:05:53Z","timestamp":1775469953581,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T00:00:00Z","timestamp":1193529600000},"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":[],"published-print":{"date-parts":[[2007,10,28]]},"DOI":"10.1145\/1315245.1315317","type":"proceedings-article","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T14:30:20Z","timestamp":1195137020000},"page":"584-597","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1203,"title":["Pors"],"prefix":"10.1145","author":[{"given":"Ari","family":"Juels","sequence":"first","affiliation":[{"name":"RSA Laboratories, Bedford, MA"}]},{"suffix":"Jr.","given":"Burton S.","family":"Kaliski","sequence":"additional","affiliation":[{"name":"EMC Corporation, Hopkintion, MA"}]}],"member":"320","published-online":{"date-parts":[[2007,10,28]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Amazon simple storage service (Amazon S3)","year":"2007","unstructured":"Amazon.com. Amazon simple storage service (Amazon S3) , 2007 . Referenced 2007 at aws.amazon.com\/s3. Amazon.com. Amazon simple storage service (Amazon S3), 2007. Referenced 2007 at aws.amazon.com\/s3."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"e_1_3_2_1_3_1","volume-title":"Provable data possession at untrusted stores","author":"Ateniese G.","year":"2007","unstructured":"G. Ateniese , R. Burns , R. Curtmola , J. Herring , L. Kissner , Z. Peterson , and D. Song . Provable data possession at untrusted stores , 2007 . To appear. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song. Provable data possession at untrusted stores, 2007. To appear."},{"key":"e_1_3_2_1_4_1","first-page":"405","volume-title":"Non-skipping timestamps for Byzantine data storage systems","author":"Bazzi R.","year":"2004","unstructured":"R. Bazzi and Y. Ding . Non-skipping timestamps for Byzantine data storage systems . In R. Guerraoui, editor, DISC '04, pages 405 -- 419 . Springer , 2004 . LNCS vol. 3274. R. Bazzi and Y. Ding. Non-skipping timestamps for Byzantine data storage systems. In R. Guerraoui, editor, DISC '04, pages 405--419. Springer, 2004. LNCS vol. 3274."},{"key":"e_1_3_2_1_5_1","first-page":"390","volume-title":"On defining proofs of knowledge","author":"Bellare M.","year":"1992","unstructured":"M. Bellare and O. Goldreich . On defining proofs of knowledge . In E. F. Brickell, editor, CRYPTO '92, pages 390 -- 420 . Springer , 1992 . LNCS vol. 740. M. Bellare and O. Goldreich. On defining proofs of knowledge. In E. F. Brickell, editor, CRYPTO '92, pages 390--420. Springer, 1992. LNCS vol. 740."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_17"},{"key":"e_1_3_2_1_7_1","first-page":"114","volume-title":"Ciphers with arbitrary finite domains","author":"Black J.","year":"2002","unstructured":"J. Black and P. Rogaway . Ciphers with arbitrary finite domains . In B. Preneel, editor, CT-RSA '02, pages 114 -- 130 . Springer , 2002 . LNCS vol. 2271. J. Black and P. Rogaway. Ciphers with arbitrary finite domains. In B. Preneel, editor, CT-RSA '02, pages 114--130. Springer, 2002. LNCS vol. 2271."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185212"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2005.9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2006.56"},{"key":"e_1_3_2_1_11_1","first-page":"139","volume-title":"Towards constant bandwidth overhead integrity checking of untrusted data","author":"Clarke D. E.","year":"2005","unstructured":"D. E. Clarke , G. E. Suh , B. Gassend , A. Sudan , M. van Dijk , and S. Devadas . Towards constant bandwidth overhead integrity checking of untrusted data . In IEEE S & P '05, pages 139 -- 153 , 2005 . D. E. Clarke, G. E. Suh, B. Gassend, A. Sudan, M. van Dijk, and S. Devadas. Towards constant bandwidth overhead integrity checking of untrusted data. In IEEE S & P '05, pages 139--153, 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/506309.506310"},{"key":"e_1_3_2_1_13_1","first-page":"426","volume-title":"On memory-bound functions for fighting spam","author":"Dwork C.","year":"2003","unstructured":"C. Dwork , A. Goldberg , and M. Naor . On memory-bound functions for fighting spam . In D. Boneh, editor, CRYPTO '03, pages 426 -- 444 . Springer , 2003 . LNCS vol. 2729. C. Dwork, A. Goldberg, and M. Naor. On memory-bound functions for fighting spam. In D. Boneh, editor, CRYPTO '03, pages 426--444. Springer, 2003. LNCS vol. 2729."},{"key":"e_1_3_2_1_14_1","volume-title":"Gantz et al. The Expanding Digital Universe: A Forecast of Worldwide Information Growth through","author":"I. D. C. J.","year":"2010","unstructured":"I. D. C. J. F. Gantz et al. The Expanding Digital Universe: A Forecast of Worldwide Information Growth through 2010 , March 2007. Whitepaper . I. D. C. J. F. Gantz et al. The Expanding Digital Universe: A Forecast of Worldwide Information Growth through 2010, March 2007. Whitepaper."},{"key":"e_1_3_2_1_15_1","volume-title":"IEEE Information Theory Workshop (ITW), 2006","author":"Feldman J.","year":"2007","unstructured":"J. Feldman . Using many machines to handle an enormous error-correcting code . In IEEE Information Theory Workshop (ITW), 2006 . Referenced 2007 at http:\/\/www.columbia.edu\/~jf2189\/pubs\/bigcode.pdf. J. Feldman. Using many machines to handle an enormous error-correcting code. In IEEE Information Theory Workshop (ITW), 2006. Referenced 2007 at http:\/\/www.columbia.edu\/~jf2189\/pubs\/bigcode.pdf."},{"key":"e_1_3_2_1_16_1","volume-title":"Demonstrating data possession and uncheatable data transfer","author":"Filho D. L. G.","year":"2006","unstructured":"D. L. G. Filho and P. S. L. M. Barreto . Demonstrating data possession and uncheatable data transfer , 2006 . IACR eArchive 2006\/150. Referenced 2007 at http:\/\/eprint.iacr.org\/2006\/150.pdf. D. L. G. Filho and P. S. L. M. Barreto. Demonstrating data possession and uncheatable data transfer, 2006. IACR eArchive 2006\/150. Referenced 2007 at http:\/\/eprint.iacr.org\/2006\/150.pdf."},{"key":"e_1_3_2_1_17_1","first-page":"377","volume-title":"A Half-Century Survey on The Universal Turing Machine","author":"Goldreich O.","year":"1988","unstructured":"O. Goldreich . Randomness , interactive proofs, and zero-knowledge - a survey . In A Half-Century Survey on The Universal Turing Machine , pages 377 -- 405 . Oxford University Press , 1988 . O. Goldreich. Randomness, interactive proofs, and zero-knowledge - a survey. In A Half-Century Survey on The Universal Turing Machine, pages 377--405. Oxford University Press, 1988."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_19_1","first-page":"120","volume-title":"Financial Cryptography '02","author":"Golle P.","year":"2002","unstructured":"P. Golle , S. Jarecki , and I. Mironov . Cryptographic primitives enforcing communication and storage complexity . In M. Blaze, editor, Financial Cryptography '02 , pages 120 -- 135 . Springer , 2002 . LNCS vol. 2357. P. Golle, S. Jarecki, and I. Mironov. Cryptographic primitives enforcing communication and storage complexity. In M. Blaze, editor, Financial Cryptography '02, pages 120--135. Springer, 2002. LNCS vol. 2357."},{"key":"e_1_3_2_1_20_1","first-page":"425","volume-title":"Uncheatable distributed computations","author":"Golle P.","year":"2001","unstructured":"P. Golle and I. Mironov . Uncheatable distributed computations . In D. Naccache, editor, CT-RSA '01, pages 425 -- 440 . Springer , 2001 . LNCS vol. 2020. P. Golle and I. Mironov. Uncheatable distributed computations. In D. Naccache, editor, CT-RSA '01, pages 425--440. Springer, 2001. LNCS vol. 2020."},{"key":"e_1_3_2_1_21_1","first-page":"258","volume-title":"Communications and Multimedia Security","author":"Jakobsson M.","year":"1999","unstructured":"M. Jakobsson and A. Juels . Proofs of work and bread pudding protocols . In B. Preneel, editor, Communications and Multimedia Security , pages 258 -- 272 . Kluwer , 1999 . M. Jakobsson and A. Juels. Proofs of work and bread pudding protocols. In B. Preneel, editor, Communications and Multimedia Security, pages 258--272. Kluwer, 1999."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103780.1103783"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796363"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786228"},{"key":"e_1_3_2_1_25_1","first-page":"29","volume-title":"USENIX Annual Technical Conference, General Track 2003","author":"Lillibridge M.","year":"2003","unstructured":"M. Lillibridge , S. Elnikety , A. Birrell , M. Burrows , and M. Isard . A cooperative Internet backup scheme . In USENIX Annual Technical Conference, General Track 2003 , pages 29 -- 41 , 2003 . M. Lillibridge, S. Elnikety, A. Birrell, M. Burrows, and M. Isard. A cooperative Internet backup scheme. In USENIX Annual Technical Conference, General Track 2003, pages 29--41, 2003."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11556992_23"},{"key":"e_1_3_2_1_27_1","first-page":"31","volume-title":"Tweakable block ciphers","author":"Liskov M.","year":"2002","unstructured":"M. Liskov , R. L. Rivest , and D. Wagner . Tweakable block ciphers . In M. Yung, editor, CRYPTO '02, pages 31 -- 46 . Springer , 2002 . LNCS vol. 2442. M. Liskov, R. L. Rivest, and D. Wagner. Tweakable block ciphers. In M. Yung, editor, CRYPTO '02, pages 31--46. Springer, 2002. LNCS vol. 2442."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217022"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.842262"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/645959.676126"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.71"},{"key":"e_1_3_2_1_32_1","volume-title":"Storage Networking World (SNW) '07","author":"St. Pierre E.","year":"2007","unstructured":"E. St. Pierre . ILM : Tiered services and the need for classification . In Storage Networking World (SNW) '07 , April 2007 . Slide presentation. E. St. Pierre. ILM: Tiered services and the need for classification. In Storage Networking World (SNW) '07, April 2007. Slide presentation."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"key":"e_1_3_2_1_34_1","unstructured":"R. Rivest. The pure crypto project's hash function. Cryptography Mailing List Posting. Referenced 2007 at http:\/\/diswww.mit.edu\/bloom-picayune\/crypto\/13190.  R. Rivest. The pure crypto project's hash function. Cryptography Mailing List Posting. Referenced 2007 at http:\/\/diswww.mit.edu\/bloom-picayune\/crypto\/13190."},{"key":"e_1_3_2_1_35_1","first-page":"16","volume-title":"Efficient instantiations of tweakable blockciphers and refinements to modes OCB and PMAC","author":"Rogaway P.","year":"2004","unstructured":"P. Rogaway . Efficient instantiations of tweakable blockciphers and refinements to modes OCB and PMAC . In P. J. Lee, editor, ASIACRYPT '04, pages 16 -- 31 . Springer , 2004 . LNCS vol. 3329. P. Rogaway. Efficient instantiations of tweakable blockciphers and refinements to modes OCB and PMAC. In P. J. Lee, editor, ASIACRYPT '04, pages 16--31. Springer, 2004. LNCS vol. 3329."},{"key":"e_1_3_2_1_36_1","first-page":"246","volume-title":"On the discrepancy between serial and parallel of zero-knowledge protocols (extended abstract)","author":"Sakurai K.","year":"1992","unstructured":"K. Sakurai and T. Itoh . On the discrepancy between serial and parallel of zero-knowledge protocols (extended abstract) . In E. F. Brickell, editor, CRYPTO '92, page 246 -- 259 . Springer , 1992 . LNCS vol. 740. K. Sakurai and T. Itoh. On the discrepancy between serial and parallel of zero-knowledge protocols (extended abstract). In E. F. Brickell, editor, CRYPTO '92, page 246--259. Springer, 1992. LNCS vol. 740."},{"key":"e_1_3_2_1_37_1","volume-title":"HotOS XI","author":"Shah M. A.","year":"2007","unstructured":"M. A. Shah , M. Baker , J. C. Mogul , and R. Swaminathan . Auditing to keep online storage services honest, 2007 . Presented at HotOS XI , May 2007 . Referenced 2007 at http:\/\/www.hpl.hp.com\/ personal\/Mehul_Shah\/papers\/hotos11_2007_shah.pdf. M. A. Shah, M. Baker, J. C. Mogul, and R. Swaminathan. Auditing to keep online storage services honest, 2007. Presented at HotOS XI, May 2007. Referenced 2007 at http:\/\/www.hpl.hp.com\/ personal\/Mehul_Shah\/papers\/hotos11_2007_shah.pdf."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023584319229"},{"key":"e_1_3_2_1_39_1","volume-title":"Network and Distributed Systems Security Symposium (NDSS) '07","author":"Sion R.","year":"2007","unstructured":"R. Sion and B. Carbunar . On the computational practicality of private information retrieval . In Network and Distributed Systems Security Symposium (NDSS) '07 , 2007 . To appear. R. Sion and B. Carbunar. On the computational practicality of private information retrieval. In Network and Distributed Systems Security Symposium (NDSS) '07, 2007. To appear."},{"key":"e_1_3_2_1_40_1","first-page":"196","volume-title":"EUROCRYPT '89","author":"Yung M.","year":"1989","unstructured":"M. Yung . Zero-knowledge proofs of computational power (extended summary). In J. J. Quisquater and J. Vandewalle, editors, EUROCRYPT '89 , pages 196 -- 207 . Springer , 1989 . LNCS vol. 434. M. Yung. Zero-knowledge proofs of computational power (extended summary). In J. J. Quisquater and J. Vandewalle, editors, EUROCRYPT '89, pages 196--207. Springer, 1989. LNCS vol. 434."}],"event":{"name":"CCS07: 14th ACM Conference on Computer and Communications Security 2007","location":"Alexandria Virginia USA","acronym":"CCS07","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 14th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1315245.1315317","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1315245.1315317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:21Z","timestamp":1750258701000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1315245.1315317"}},"subtitle":["proofs of retrievability for large files"],"short-title":[],"issued":{"date-parts":[[2007,10,28]]},"references-count":40,"alternative-id":["10.1145\/1315245.1315317","10.1145\/1315245"],"URL":"https:\/\/doi.org\/10.1145\/1315245.1315317","relation":{},"subject":[],"published":{"date-parts":[[2007,10,28]]},"assertion":[{"value":"2007-10-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}