{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:49:00Z","timestamp":1764305340012,"version":"3.40.5"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662456071"},{"type":"electronic","value":"9783662456088"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","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-662-45608-8_4","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:46:39Z","timestamp":1415961999000},"page":"62-81","source":"Crossref","is-referenced-by-count":33,"title":["Statistically-secure ORAM with $\\tilde{O}(\\log^2 n)$ Overhead"],"prefix":"10.1007","author":[{"given":"Kai-Min","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Oblivious RAMs without cryptogrpahic assumptions. In: STOC, pp. 181\u2013190 (2010)","DOI":"10.1145\/1806689.1806716"},{"key":"4_CR2","unstructured":"Boneh, D., Mazieres, D., Popa, R.A.: Remote oblivious storage: Making oblivious RAM practical. CSAIL Technical Report: MIT-CSAIL-TR-2011-018 (2012)"},{"key":"4_CR3","unstructured":"Chung, K.M., Lam, H., Liu, Z., Mitzenmacher, M.: Chernoff-Hoeffding bounds for Markov chains: Generalized and simplified. In: Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS (2012)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Liu, Z., Pass, R.: Statistically-secure ORAM with \\tilde{O}(\\log^2 n overhead. CoRR, abs\/1307.3699 (2013)","DOI":"10.1007\/978-3-662-45608-8_4"},{"key":"4_CR5","unstructured":"Chung, K.-M., Pass, R.: A simple ORAM. Cryptology ePrint Archive, Report 2013\/243 (2013)"},{"key":"4_CR6","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)"},{"issue":"5","key":"4_CR7","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TSE.1986.6312961","volume":"12","author":"D.L. Eager","year":"1986","unstructured":"Eager, D.L., Lazowska, E.D., Zahorjan, J.: Lazowska, and John Zahorjan. Adaptive load sharing in homogeneous distributed systems. IEEE Trans. Software Eng.\u00a012(5), 662\u2013675 (1986)","journal-title":"IEEE Trans. Software Eng."},{"key":"4_CR8","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":"4_CR9","doi-asserted-by":"crossref","unstructured":"Gillman, D.: A Chernoff bound for random walks on expander graphs. SIAM Journal on Computing\u00a027(4) (1997)","DOI":"10.1137\/S0097539794268765"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: STOC, pp. 182\u2013194 (1987)","DOI":"10.1145\/28395.28416"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM\u00a043(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Privacy-preserving access of outsourced data via oblivious RAM simulation. In: ICALP, vol. (2), pp. 576\u2013587 (2011)","DOI":"10.1007\/978-3-642-22012-8_46"},{"key":"4_CR13","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, pp. 157\u2013167 (2012)","DOI":"10.1137\/1.9781611973099.14"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Kahale, N.: Large deviation bounds for Markov chains. Combinatorics, Probability, and Computing\u00a06(4) (1997)","DOI":"10.1017\/S0963548397003209"},{"key":"4_CR15","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, pp. 143\u2013156 (2012)","DOI":"10.1137\/1.9781611973099.13"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1214\/aoap\/1028903453","volume":"8","author":"P. Lezaud","year":"1998","unstructured":"Lezaud, P.: Chernoff-type bound for finite Markov chains. Annals of Applied Probability\u00a08(3), 849\u2013867 (1998)","journal-title":"Annals of Applied Probability"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-36594-2_22","volume-title":"Theory of Cryptography","author":"S. Lu","year":"2013","unstructured":"Lu, S., Ostrovsky, R.: Distributed oblivious RAM for secure two-party computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 377\u2013396. Springer, Heidelberg (2013)"},{"key":"4_CR18","first-page":"311","volume-title":"CCS 2013","author":"M. Maas","year":"2013","unstructured":"Maas, M., Love, E., Stefanov, E., Tiwari, M., Shi, E., Asanovic, K., Kubiatowicz, J., Song, D.: Phantom: Practical oblivious computation in a secure processor. In: CCS 2013, pp. 311\u2013324. ACM Press, New York (2013)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511813603"},{"issue":"10","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/71.963420","volume":"12","author":"M. Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M.: The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst.\u00a012(10), 1094\u20131104 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Prabhakar, B., Shah, D.: Load balancing with memory. In: FOCS, pp. 799\u2013808 (2002)","DOI":"10.1109\/SFCS.2002.1182005"},{"key":"4_CR22","first-page":"746","volume":"2008","author":"M. Mitzenmacher","year":"2008","unstructured":"Mitzenmacher, M., Vadhan, S.: Why simple hash functions work: exploiting the entropy in a data stream. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 746\u2013755 (2008)","journal-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA"},{"key":"4_CR23","first-page":"326","volume":"37","author":"M. Mitzenmacher","year":"1999","unstructured":"Mitzenmacher, M., Vocking, B.: The asymptotics of selecting the shortest of two, improved. Proceedings of the Annual Allerton Conference on Communication Control and Computing\u00a037, 326\u2013327 (1999)","journal-title":"Proceedings of the Annual Allerton Conference on Communication Control and Computing"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage (extended abstract). In: STOC, pp. 294\u2013303 (1997)","DOI":"10.1145\/258533.258606"},{"key":"4_CR25","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":"4_CR26","doi-asserted-by":"crossref","unstructured":"Shah, D., Prabhakar, B.: The use of memory in randomized load balancing. Proceedingsof the 2002 IEEE International Symposium on Information Theory, p. 125. IEEE (2002)","DOI":"10.1109\/ISIT.2002.1023397"},{"key":"4_CR27","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)"},{"key":"4_CR28","unstructured":"Stefanov, E., Shi, E.: Path O-RAM: An extremely simple oblivious RAM protocol. CoRR, abs\/1202.5150v1 (2012)"},{"key":"4_CR29","unstructured":"Stefanov, E., Shi, E., Song, D.: Towards practical oblivious RAM. In: NDSS (2012)"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., Devadas, S.: Path O-RAM: An extremely simple oblivious RAM protocol. In: CCS (2013)","DOI":"10.1145\/2508859.2516660"},{"issue":"1","key":"4_CR31","first-page":"20","volume":"32","author":"N.D. Vvedenskaya","year":"1996","unstructured":"Vvedenskaya, N.D., Dobrushin, R.L., Karpelevich, F.I.: Queueing system with selection of the shortest of two queues: An asymptotic approach. Problemy Peredachi Informatsii\u00a032(1), 20\u201334 (1996)","journal-title":"Problemy Peredachi Informatsii"},{"key":"4_CR32","unstructured":"Williams, P., Sion, R.: Usable PIR. In: NDSS (2008)"},{"key":"4_CR33","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 Conference on Computer and Communications Security, pp. 139\u2013148 (2008)","DOI":"10.1145\/1455770.1455790"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45608-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:56:01Z","timestamp":1747158961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45608-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662456071","9783662456088"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45608-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}