{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:07:46Z","timestamp":1780049266224,"version":"3.53.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T00:00:00Z","timestamp":1442880000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00145-015-9216-2","type":"journal-article","created":{"date-parts":[[2015,9,23]],"date-time":"2015-09-23T01:16:35Z","timestamp":1442970995000},"page":"22-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":82,"title":["Dynamic Proofs of Retrievability Via Oblivious RAM"],"prefix":"10.1007","volume":"30","author":[{"given":"David","family":"Cash","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alptekin","family":"K\u00fcp\u00e7\u00fc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,22]]},"reference":[{"key":"9216_CR1","doi-asserted-by":"crossref","unstructured":"G.\u00a0Ateniese, R.C. Burns, R.\u00a0Curtmola, J.\u00a0Herring, L.\u00a0Kissner, Z.N.J. Peterson, D.\u00a0Song. Provable data possession at untrusted stores, in P.\u00a0Ning, S.D.C. di Vimercati, P.F. Syverson, editors, ACM CCS 07 (ACM Press, 2007), pp. 598\u2013609.","DOI":"10.1145\/1315245.1315318"},{"key":"9216_CR2","unstructured":"G.\u00a0Ateniese, S.\u00a0Kamara, and J.\u00a0Katz. Proofs of storage from homomorphic identification protocols, in M.\u00a0Matsui, editor, ASIACRYPT 2009, vol. 5912 of LNCS (Springer, 2009), pp. 319\u2013333."},{"key":"9216_CR3","unstructured":"G.\u00a0Ateniese, R.D. Pietro, L.V. Mancini, G.\u00a0Tsudik. Scalable and efficient provable data possession. Cryptology ePrint Archive, Report 2008\/114 (2008). http:\/\/eprint.iacr.org\/ ."},{"key":"9216_CR4","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare and O.\u00a0Goldreich. On defining proofs of knowledge, in E.F. Brickell, editor, CRYPTO\u201992, vol. 740 of LNCS (Springer, 1993), pp. 390\u2013420.","DOI":"10.1007\/3-540-48071-4_28"},{"issue":"2\/3","key":"9216_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01185212","volume":"12","author":"M Blum","year":"1994","unstructured":"M.\u00a0Blum, W.S. Evans, P.\u00a0Gemmell, S.\u00a0Kannan, M.\u00a0Naor. Checking the correctness of memories. Algorithmica, 12(2\/3):225\u2013244, (1994).","journal-title":"Algorithmica"},{"key":"9216_CR6","doi-asserted-by":"crossref","unstructured":"K.\u00a0D. Bowers, A.\u00a0Juels, A.\u00a0Oprea. HAIL: a high-availability and integrity layer for cloud storage. in E.\u00a0Al-Shaer, S.\u00a0Jha, A.D. Keromytis, editors, ACM CCS 09 (ACM Press, 2009), pp. 187\u2013198.","DOI":"10.1145\/1653662.1653686"},{"key":"9216_CR7","doi-asserted-by":"crossref","unstructured":"K.D. Bowers, A.\u00a0Juels, A.\u00a0Oprea. Proofs of retrievability: theory and implementation, in R.\u00a0Sion and D.\u00a0Song, editors, CCSW (ACM, 2009), pp. 43\u201354.","DOI":"10.1145\/1655008.1655015"},{"key":"9216_CR8","doi-asserted-by":"crossref","unstructured":"D.\u00a0Cash, A.\u00a0K\u00fcp\u00e7\u00fc, D.\u00a0Wichs. Dynamic proofs of retrievability via oblivious ram, in EUROCRYPT, (2013).","DOI":"10.1007\/978-3-642-38348-9_17"},{"key":"9216_CR9","doi-asserted-by":"crossref","unstructured":"N.\u00a0Chandran, B.\u00a0Kanukurthi, R.\u00a0Ostrovsky. Locally updatable and locally decodable codes, in TCC, (2014).","DOI":"10.1007\/978-3-642-54242-8_21"},{"key":"9216_CR10","doi-asserted-by":"crossref","unstructured":"B.\u00a0Chen, R.\u00a0Curtmola, G.\u00a0Ateniese, R.C. Burns. Remote data checking for network coding-based distributed storage systems, in A.\u00a0Perrig and R.\u00a0Sion, editors, CCSW (ACM, 2010), pp. 31\u201342.","DOI":"10.1145\/1866835.1866842"},{"key":"9216_CR11","unstructured":"R.\u00a0Curtmola, O.\u00a0Khan, R.\u00a0Burns, G.\u00a0Ateniese. Mr-pdp: Multiple-replica provable data possession, in ICDCS, (2008)."},{"key":"9216_CR12","unstructured":"Y.\u00a0Dodis, S.P. Vadhan, D.\u00a0Wichs. Proofs of retrievability via hardness amplification, in O.\u00a0Reingold, editor, TCC\u00a02009, vol. 5444 of LNCS (Springer, 2009), pp. 109\u2013127."},{"key":"9216_CR13","unstructured":"C.\u00a0Dwork, M.\u00a0Naor, G.N. Rothblum, V.\u00a0Vaikuntanathan. How efficient can memory checking be? in O.\u00a0Reingold, editor, TCC\u00a02009, vol. 5444 of LNCS (Springer, 2009), pp. 503\u2013520."},{"key":"9216_CR14","doi-asserted-by":"crossref","unstructured":"C.C. Erway, A. K\u00fcp\u00e7\u00fc, C.\u00a0Papamanthou, R.\u00a0Tamassia. Dynamic provable data possession, in E.\u00a0Al-Shaer, S.\u00a0Jha, A.D. Keromytis, editors, ACM CCS 09 (ACM Press, 2009), pp. 213\u2013222.","DOI":"10.1145\/1653662.1653688"},{"key":"9216_CR15","doi-asserted-by":"crossref","unstructured":"M.\u00a0Etemad, A.\u00a0K\u00fcp\u00e7\u00fc. Transparent, distributed, and replicated dynamic provable data possession, in ACNS (2013).","DOI":"10.1007\/978-3-642-38980-1_1"},{"issue":"3","key":"9216_CR16","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"O.\u00a0Goldreich and R.\u00a0Ostrovsky. Software protection and simulation on oblivious RAMs. Journal of the ACM, 43(3):431\u2013473, 1996.","journal-title":"Journal of the ACM"},{"issue":"1","key":"9216_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"S.\u00a0Goldwasser, S.\u00a0Micali, and C.\u00a0Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186\u2013208, 1989.","journal-title":"SIAM Journal on Computing"},{"key":"9216_CR18","unstructured":"M.T. Goodrich, M.\u00a0Mitzenmacher. Privacy-preserving access of outsourced data via oblivious RAM simulation, in L.\u00a0Aceto, M.\u00a0Henzinger, and J.\u00a0Sgall, editors, ICALP 2011, Part II, vol. 6756 of LNCS (Springer, 2011), pp. 576\u2013587."},{"key":"9216_CR19","unstructured":"M.T. Goodrich, M.\u00a0Mitzenmacher, O.\u00a0Ohrimenko, R.\u00a0Tamassia. Oblivious RAM simulation with efficient worst-case access overhead, in CCSW (2011), pp. 95\u2013100."},{"key":"9216_CR20","unstructured":"M.T. Goodrich, M.\u00a0Mitzenmacher, O.\u00a0Ohrimenko, R.\u00a0Tamassia. Privacy-preserving group data access via stateless oblivious ram simulation, in SODA (2012), pp. 157\u2013167."},{"issue":"301","key":"9216_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"W.\u00a0Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13\u201330, 1963.","journal-title":"Journal of the American Statistical Association"},{"key":"9216_CR22","doi-asserted-by":"crossref","unstructured":"A.\u00a0Juels, B.S. Kaliski Jr. Pors: proofs of retrievability for large files, in P.\u00a0Ning, S.D.C. di Vimercati, P.F. Syverson, editors, ACM CCS 07 (ACM Press, 2007), pp. 584\u2013597.","DOI":"10.1145\/1315245.1315317"},{"issue":"4","key":"9216_CR23","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1137\/080728743","volume":"39","author":"A Kirsch","year":"2009","unstructured":"A.\u00a0Kirsch, M.\u00a0Mitzenmacher, and U.\u00a0Wieder. More robust hashing: Cuckoo hashing with a stash. SIAM J. Comput., 39(4):1543\u20131561, 2009.","journal-title":"SIAM J. Comput."},{"key":"9216_CR24","unstructured":"A.\u00a0K\u00fcp\u00e7\u00fc. Efficient Cryptography for the Next Generation Secure Cloud. Ph.D. thesis, Brown University (2010)."},{"key":"9216_CR25","unstructured":"A.\u00a0K\u00fcp\u00e7\u00fc. Efficient Cryptography for the Next Generation Secure Cloud: Protocols, Proofs, and Implementation. (Lambert Academic Publishing, 2010)."},{"key":"9216_CR26","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor, G.N. Rothblum. The complexity of online memory checking, in 46th FOCS (IEEE Computer Society Press, 2005), pp. 573\u2013584.","DOI":"10.1109\/SFCS.2005.71"},{"key":"9216_CR27","doi-asserted-by":"crossref","unstructured":"R.\u00a0Ostrovsky, V.\u00a0Shoup. Private information storage (extended abstract), in 29th ACM STOC (ACM Press, 1997), pp. 294\u2013303.","DOI":"10.1145\/258533.258606"},{"issue":"2","key":"9216_CR28","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"R.\u00a0Pagh and F.\u00a0F. Rodler. Cuckoo hashing. J. Algorithms, 51(2):122\u2013144, 2004.","journal-title":"J. Algorithms"},{"key":"9216_CR29","unstructured":"B.\u00a0Pinkas, T.\u00a0Reinman. Oblivious RAM revisited. In T.\u00a0Rabin, editor, CRYPTO, vol. 6223 of LNCS (Springer, 2010), pp. 502\u2013519."},{"key":"9216_CR30","unstructured":"H.\u00a0Shacham, B.\u00a0Waters. Compact proofs of retrievability, in J.\u00a0Pieprzyk, editor, ASIACRYPT 2008, vol. 5350 of LNCS (Springer, 2008), pp. 90\u2013107."},{"key":"9216_CR31","unstructured":"E.\u00a0Shi, T.-H.H. Chan, E.\u00a0Stefanov, M.\u00a0Li. Oblivious ram with o((logn)3) worst-case cost, in D.H. Lee, X.\u00a0Wang, editors, ASIACRYPT, vol. 7073 of Lecture Notes in Computer Science (Springer, 2011), pp. 197\u2013214."},{"key":"9216_CR32","doi-asserted-by":"crossref","unstructured":"E.\u00a0Shi, E.\u00a0Stefanov, C.\u00a0Papamanthou. Practical dynamic proofs of retrievability, in ACM CCS (2013).","DOI":"10.1145\/2508859.2516669"},{"key":"9216_CR33","unstructured":"E.\u00a0Stefanov, M.\u00a0van Dijk, A.\u00a0Oprea, A.\u00a0Juels. Iris: a scalable cloud file system with efficient integrity checks. Cryptology ePrint Archive, Report 2011\/585 (2011). http:\/\/eprint.iacr.org\/ ."},{"key":"9216_CR34","unstructured":"E.\u00a0Stefanov, M.\u00a0van Dijk, E.\u00a0Shi, C.\u00a0Fletcher, L.\u00a0Ren, X.\u00a0Yu, S.\u00a0Devadas. Path oram: An extremely simple oblivious ram protocol, in Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, CCS \u201913 (2013), pp. 299\u2013310."},{"key":"9216_CR35","unstructured":"Q.\u00a0Wang, C.\u00a0Wang, J.\u00a0Li, K.\u00a0Ren, W.\u00a0Lou. Enabling public verifiability and data dynamics for storage security in cloud computing. In M.\u00a0Backes, P.\u00a0Ning, editors, ESORICS\u00a02009, vol. 5789 of LNCS (Springer, 2009), pp. 355\u2013370."},{"key":"9216_CR36","doi-asserted-by":"crossref","unstructured":"P.\u00a0Williams, R.\u00a0Sion, B.\u00a0Carbunar. Building castles out of mud: practical access pattern privacy and correctness on untrusted storage, in P.\u00a0Ning, P.F. Syverson, S.\u00a0Jha, editors, ACM CCS 08 (ACM Press, 2008), pp. 139\u2013148.","DOI":"10.1145\/1455770.1455790"},{"key":"9216_CR37","doi-asserted-by":"crossref","unstructured":"C. C. Erway, A. K\u00fcp\u00e7\u00fc, C. Papamanthou, R. Tamassia. Dynamic provable data possession. ACM Trans. Inf. Syst. Secur., 17(4):15, 2015.","DOI":"10.1145\/2699909"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9216-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9216-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9216-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9216-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T19:17:04Z","timestamp":1748632624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9216-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,22]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9216"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9216-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,22]]},"assertion":[{"value":"7 June 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}