{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:53:56Z","timestamp":1764132836462},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642546303"},{"type":"electronic","value":"9783642546310"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54631-0_8","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T05:04:17Z","timestamp":1392872657000},"page":"131-148","source":"Crossref","is-referenced-by-count":46,"title":["Verifiable Oblivious Storage"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Apon","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Aishwarya","family":"Thiruvengadam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Apon, D., Katz, J., Shi, E., Thiruvengadam, A.: Verifiable oblivious storage. Online technical report version of this paper (2013), \n                    \n                      http:\/\/www.cs.umd.edu\/~elaine\/docs\/vos.pdf","key":"8_CR1","DOI":"10.1007\/978-3-642-54631-0_8"},{"doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E.: Fast reductions from rams to delegatable succinct constraint satisfaction problems: extended abstract. In: ITCS (2013)","key":"8_CR2","DOI":"10.1145\/2422436.2422481"},{"doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: ITCS (2012)","key":"8_CR3","DOI":"10.1145\/2090236.2090263"},{"doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for snarks and proof-carrying data. In: STOC (2013)","key":"8_CR4","DOI":"10.1145\/2488608.2488623"},{"doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: ITCS (2012)","key":"8_CR5","DOI":"10.1145\/2090236.2090262"},{"doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS (2011)","key":"8_CR6","DOI":"10.1109\/FOCS.2011.12"},{"doi-asserted-by":"crossref","unstructured":"Braun, B., Feldman, A.J., Ren, Z., Setty, S., Blumberg, A.J., Walfish, M.: Verifying computations with state. In: SOSP (2013)","key":"8_CR7","DOI":"10.1145\/2517349.2522733"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-38348-9_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"D. Cash","year":"2013","unstructured":"Cash, D., K\u00fcp\u00e7\u00fc, A., Wichs, D.: Dynamic proofs of retrievability via oblivious RAM. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 279\u2013295. Springer, Heidelberg (2013)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/978-3-642-54242-8_21","volume-title":"TCC 2014","author":"N. Chandran","year":"2014","unstructured":"Chandran, N., Kanukurthi, B., Ostrovsky, R.: Locally updatable and locally decodable codes. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 489\u2013514. Springer, Heidelberg (2014)"},{"doi-asserted-by":"crossref","unstructured":"Chor, B., Gilboa, N.: Computationally private information retrieval (extended abstract). In: STOC (1997)","key":"8_CR11","DOI":"10.1145\/258533.258609"},{"unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 41\u201350 (1995)","key":"8_CR12"},{"unstructured":"Chung, K.-M., Pass, R.: A simple oram (2013), \n                    \n                      https:\/\/eprint.iacr.org\/2013\/243.pdf","key":"8_CR13"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19571-6_10","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2011","unstructured":"Damg\u00e5rd, I., Meldgaard, S., Nielsen, J.B.: Perfectly secure oblivious RAM without random oracles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 144\u2013163. Springer, Heidelberg (2011)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R. Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 626\u2013645. Springer, Heidelberg (2013)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-39077-7_1","volume-title":"Privacy Enhancing Technologies","author":"C. Gentry","year":"2013","unstructured":"Gentry, C., Goldman, K.A., Halevi, S., Julta, C., Raykova, M., Wichs, D.: Optimizing ORAM and using it efficiently for secure computation. In: De Cristofaro, E., Wright, M. (eds.) PETS 2013. LNCS, vol.\u00a07981, pp. 1\u201318. Springer, Heidelberg (2013)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"C. Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 465\u2013482. Springer, Heidelberg (2012)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C. Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 803\u2013815. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: STOC (1987)","key":"8_CR19","DOI":"10.1145\/28395.28416"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM (1996)","key":"8_CR20","DOI":"10.1145\/233551.233553"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-642-22012-8_46","volume-title":"Automata, Languages and Programming","author":"M.T. Goodrich","year":"2011","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Privacy-preserving access of outsourced data via oblivious RAM simulation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 576\u2013587. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Oblivious RAM simulation with efficient worst-case access overhead. In: CCSW (2011)","key":"8_CR22","DOI":"10.1145\/2046660.2046680"},{"doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Privacy-preserving group data access via stateless oblivious RAM simulation. In: SODA (2012)","key":"8_CR23","DOI":"10.1137\/1.9781611973099.14"},{"doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Katz, J., Kolesnikov, V., Krell, F., Malkin, T., Raykova, M., Vahlis, Y.: Secure two-party computation in sublinear (amortized) time. In: ACM CCS (2012)","key":"8_CR24","DOI":"10.1145\/2382196.2382251"},{"doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lu, S., Ostrovsky, R.: On the (in)security of hash-based oblivious RAM and a new balancing scheme. In: SODA (2012)","key":"8_CR25","DOI":"10.1137\/1.9781611973099.13"},{"unstructured":"Mayberry, T., Blass, E.-O., Chan, A.: Efficient private file retrieval by combining oram and pir (2013), \n                    \n                      http:\/\/eprint.iacr.org\/2013\/086","key":"8_CR26"},{"doi-asserted-by":"crossref","unstructured":"Ostrovsky, R.: Efficient computation on oblivious RAMs. In: STOC (1990)","key":"8_CR27","DOI":"10.1145\/100216.100289"},{"doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage (extended abstract). In: STOC (1997)","key":"8_CR28","DOI":"10.1145\/258533.258606"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-14623-7_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"B. Pinkas","year":"2010","unstructured":"Pinkas, B., Reinman, T.: Oblivious RAM revisited. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 502\u2013519. Springer, Heidelberg (2010)"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-25385-0_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"E. Shi","year":"2011","unstructured":"Shi, E., Chan, T.-H.H., Stefanov, E., Li, M.: Oblivious RAM with o((logn)3) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 197\u2013214. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Shi, E., Stefanov, E., Papamanthou, C.: Practical dynamic proofs of retrievability. In: ACM CCS (2013)","key":"8_CR31","DOI":"10.1145\/2508859.2516669"},{"unstructured":"Stefanov, E., Shi, E., Song, D.: Towards practical oblivious RAM. In: NDSS (2012)","key":"8_CR32"},{"doi-asserted-by":"crossref","unstructured":"Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., Devadas, S.: Path oram: An extremely simple oblivious ram protocol. In: ACM CCS (2013)","key":"8_CR33","DOI":"10.1145\/2508859.2516660"},{"unstructured":"Williams, P., Sion, R.: Usable PIR. In: NDSS (2008)","key":"8_CR34"},{"doi-asserted-by":"crossref","unstructured":"Williams, P., Sion, R.: Single round access privacy on outsourced storage. In: CCS (2012)","key":"8_CR35","DOI":"10.1145\/2382196.2382229"},{"doi-asserted-by":"crossref","unstructured":"Williams, P., Sion, R., Carbunar, B.: Building castles out of mud: practical access pattern privacy and correctness on untrusted storage. In: ACM CCS (2008)","key":"8_CR36","DOI":"10.1145\/1455770.1455790"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54631-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T04:45:12Z","timestamp":1558845912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54631-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546303","9783642546310"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54631-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}