{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:43:19Z","timestamp":1758267799773,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":62,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662543641"},{"type":"electronic","value":"9783662543658"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54365-8_5","type":"book-chapter","created":{"date-parts":[[2017,2,25]],"date-time":"2017-02-25T09:12:23Z","timestamp":1488013943000},"page":"91-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Asymptotically Tight Bounds for Composing ORAM with PIR"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher W.","family":"Fletcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Pinkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,26]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Oblivious RAMs without cryptogrpahic assumptions. In: Proceedings of the forty-second ACM symposium on Theory of computing, pp. 181\u2013190. ACM (2010)","DOI":"10.1145\/1806689.1806716"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-54631-0_8","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"D Apon","year":"2014","unstructured":"Apon, D., Katz, J., Shi, E., Thiruvengadam, A.: Verifiable oblivious storage. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 131\u2013148. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54631-0_8"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bindschaedler, V., Naveed, M., Pan, X., Wang, X., Huang, Y.: Practicing oblivious access on cloud storage: the gap, the fallacy, and the new way forward. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 837\u2013849. ACM (2015)","DOI":"10.1145\/2810103.2813649"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-662-49099-0_7","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2016","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: Oblivious parallel RAM and applications. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 175\u2013204. Springer, Heidelberg (2016)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Boyle, E., Naor, M.: Is there an oblivious RAM lower bound? In: Proceedings of the ACM Conference on Innovations in Theoretical Computer Science, pp. 357\u2013368. ACM (2016)","DOI":"10.1145\/2840728.2840761"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"C Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402\u2013414. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48910-X_28"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-662-49099-0_8","volume-title":"Theory of Cryptography","author":"B Chen","year":"2016","unstructured":"Chen, B., Lin, H., Tessaro, S.: Oblivious parallel RAM: improved efficiency and generic constructions. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 205\u2013234. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49099-0_8"},{"issue":"6","key":"5_CR8","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM (JACM) 45(6), 965\u2013981 (1998)","journal-title":"J. ACM (JACM)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-662-45608-8_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"K-M Chung","year":"2014","unstructured":"Chung, K.-M., Liu, Z., Pass, R.: Statistically-secure ORAM with $$\\tilde{O}(\\log ^2 n)$$ overhead. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 62\u201381. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45608-8_4"},{"key":"5_CR10","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. 6597, pp. 144\u2013163. Springer, Heidelberg (2011)"},{"key":"5_CR11","unstructured":"Dautrich, J., Stefanov, E., Shi, E.: Burst ORAM: Minimizing ORAM response times for bursty access patterns. In: 23rd USENIX Security Symposium (USENIX Security 14), pp. 749\u2013764 (2014)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-49099-0_6","volume-title":"Theory of Cryptography","author":"S Devadas","year":"2016","unstructured":"Devadas, S., Dijk, M., Fletcher, C.W., Ren, L., Shi, E., Wichs, D.: Onion ORAM: a constant bandwidth blowup oblivious RAM. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 145\u2013174. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49099-0_6"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Dvir., Z., Gopi, S.: 2-server PIR with sub-polynomial communication. In: Servedio, R.A., Rubinfeld, R. (eds.) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC, Portland, OR, USA, 14\u201317 June, pp. 577\u2013584. ACM (2015)","DOI":"10.1145\/2746539.2746546"},{"key":"5_CR14","unstructured":"Fletcher, C., Naveed, M., Ren, L., Shi, E., Stefanov, E.: Bucket ORAM: single online roundtrip, constant bandwidth oblivious RAM. Technical report (2015)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Fletcher, C.W., Dijk, M.V., Devadas, S.: A secure processor architecture for encrypted computation on untrusted programs. In: Proceedings of the Seventh ACM Workshop on Scalable Trusted Computing, pp. 3\u20138. ACM (2012)","DOI":"10.1145\/2382536.2382540"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Fletcher, C.W., Ren, L., Kwon, A., van Dijk, M., Devadas, S.: Freecursive ORAM: [nearly] free recursion and integrity verification for position-based oblivious RAM. In: ACM SIGPLAN Notices, vol. 50, pp. 103\u2013116. ACM (2015)","DOI":"10.1145\/2775054.2694353"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Fletcher, C.W., Ren, L., Kwon, A., van Dijk, M., Stefanov, E., Serpanos, D., Devadas, S.: A low-latency, low-area hardware oblivious RAM controller. In: IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), pp. 215\u2013222. IEEE (2015)","DOI":"10.1109\/FCCM.2015.58"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Garg, S., Mohassel, P., Papamanthou, C., Tworam: Round-optimal oblivious RAM with applications to searchable encryption. Cryptology ePrint Archive, Report 2015\/1010 (2015)","DOI":"10.1007\/978-3-662-53015-3_20"},{"key":"5_CR19","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: Cristofaro, E., Wright, M. (eds.) PETS 2013. LNCS, vol. 7981, pp. 1\u201318. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39077-7_1"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-28166-7_9","volume-title":"Applied Cryptography and Network Security","author":"C Gentry","year":"2015","unstructured":"Gentry, C., Halevi, S., Jutla, C., Raykova, M.: Private database access with HE-over-ORAM architecture. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 172\u2013191. Springer, Cham (2015). doi: 10.1007\/978-3-319-28166-7_9"},{"key":"5_CR21","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. 3580, pp. 803\u2013815. Springer, Heidelberg (2005)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp. 182\u2013194. ACM (1987)","DOI":"10.1145\/28395.28416"},{"issue":"3","key":"5_CR23","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 (JACM) 43(3), 431\u2013473 (1996)","journal-title":"J. ACM (JACM)"},{"key":"5_CR24","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":"MT 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. LNCS, vol. 6756, pp. 576\u2013587. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22012-8_46"},{"key":"5_CR25","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: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 157\u2013167. SIAM (2012)","DOI":"10.1137\/1.9781611973099.14"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-662-45608-8_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"M Keller","year":"2014","unstructured":"Keller, M., Scholl, P.: Efficient, oblivious data structures for MPC. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 506\u2013525. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45608-8_27"},{"key":"5_CR27","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: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 143\u2013156. SIAM (2012)","DOI":"10.1137\/1.9781611973099.13"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19\u201322 October, pp. 364\u2013373. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11556992_23","volume-title":"Information Security","author":"H Lipmaa","year":"2005","unstructured":"Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Zhou, J., Lopez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314\u2013328. Springer, Heidelberg (2005). doi: 10.1007\/11556992_23"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Liu, C., Harris, A., Maas, M., Hicks, M., Tiwari, M., Shi, E.: GhostRider: a hardware-software system for memory trace oblivious computation. In: ACM SIGARCH Computer Architecture News, vol. 43, pp. 87\u2013101. ACM (2015)","DOI":"10.1145\/2786763.2694385"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Liu, C., Huang, Y., Shi, E., Katz, J., Hicks, M.: Automating efficient RAM-model secure computation. In: 2014 IEEE Symposium on Security and Privacy, pp. 623\u2013638. IEEE (2014)","DOI":"10.1109\/SP.2014.46"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Liu, C., Wang, X.S., Nayak, K., Huang, Y., Shi, E.: ObliVM: a programming framework for secure computation. In: 2015 IEEE Symposium on Security and Privacy, pp. 359\u2013376. IEEE (2015)","DOI":"10.1109\/SP.2015.29"},{"key":"5_CR33","unstructured":"Lorch, J.R., Parno, B., Mickens, J., Raykova, M., Schiffman, J.: Shroud: ensuring private access to large-scale data in the data center. In: Presented as part of the 11th USENIX Conference on File and Storage Technologies (FAST 2013), pp. 199\u2013213 (2013)"},{"key":"5_CR34","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. 7785, pp. 377\u2013396. Springer, Heidelberg (2013)"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-38348-9_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Lu","year":"2013","unstructured":"Lu, S., Ostrovsky, R.: How to garble RAM programs? In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 719\u2013734. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38348-9_42"},{"key":"5_CR36","doi-asserted-by":"crossref","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 Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, pp. 311\u2013324. ACM (2013)","DOI":"10.1145\/2508859.2516692"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Mayberry, T., Blass, E.-O., Chan, A.H.: Efficient private file retrieval by combining ORAM and PIR. In: NDSS, Citeseer (2014)","DOI":"10.14722\/ndss.2014.23033"},{"key":"5_CR38","unstructured":"Mitchell, J.C., Zimmerman, J.: Data-oblivious data structures. In: Theoretical Aspects of Computer Science (STACS) (2014)"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Moataz, T., Blass, E.-O., Mayberry, T.: CHf-ORAM: a constant communication ORAM without homomorphic encryption. Cryptology ePrint Archive, Report 2015\/1116 (2015)","DOI":"10.1145\/2810103.2813701"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Moataz, T., Mayberry, T., Blass, E.-O.: Constant communication ORAM with small blocksize. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 862\u2013873. ACM (2015)","DOI":"10.1145\/2810103.2813701"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 294\u2013303. ACM (1997)","DOI":"10.1145\/258533.258606"},{"key":"5_CR42","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. 6223, pp. 502\u2013519. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14623-7_27"},{"key":"5_CR43","unstructured":"Rane, A., Lin, C., Tiwari, M.: Raccoon: closing digital side-channels through obfuscated execution. In: 24th USENIX Security Symposium (USENIX Security 15), pp. 431\u2013446 (2015)"},{"key":"5_CR44","unstructured":"Ren, L., Fletcher, C., Kwon, A., Stefanov, E., Shi, E., Van Dijk, M., Devadas, S., Constants count: practical improvements to oblivious RAM. In 24th USENIX Security Symposium (USENIX Security 15), pp. 415\u2013430 (2015)"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Ren, L., Fletcher, C.W., Yu, X., Van Dijk, M., Devadas, S.: Integrity verification for path oblivious-ram. In: High Performance Extreme Computing Conference (HPEC). Institute of Electrical and Electronics Engineers (IEEE) (2013)","DOI":"10.1109\/HPEC.2013.6670339"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Ren, L., Yu, X., Fletcher, C.W., Van Dijk, M., Devadas, S.: Design space exploration and optimization of path oblivious RAM in secure processors. In: ACM SIGARCH Computer Architecture News, vol. 41, pp. 571\u2013582. ACM (2013)","DOI":"10.1145\/2508148.2485971"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Sahin, C., Zakhary, V., El Abbadi, A., Lin, H.R., Tessaro, S.: TaoStore: overcoming asynchronicity in oblivious data storage. In: IEEE Symposium on Security and Privacy (SP) (2016)","DOI":"10.1109\/SP.2016.20"},{"key":"5_CR48","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. 7073, pp. 197\u2013214. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25385-0_11"},{"key":"5_CR49","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Shi, E.: Multi-cloud oblivious storage. In Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, pp. 247\u2013258. ACM (2013)","DOI":"10.1145\/2508859.2516673"},{"key":"5_CR50","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Shi, E.: ObliviStore: high performance oblivious cloud storage. In: IEEE Symposium on Security and Privacy (SP), pp. 253\u2013267. IEEE (2013)","DOI":"10.1109\/SP.2013.25"},{"key":"5_CR51","unstructured":"Stefanov, E., Shi, E., Song, D.X.: Towards practical oblivious RAM. In: NDSS, The Internet Society (2012)"},{"key":"5_CR52","unstructured":"Stefanov, E., van Dijk, M., Shi, E., Chan, T.-H.H., Fletcher, C., Ren, L., Yu, X., Devadas, S.: Path ORAM: an extremely simple oblivious RAM protocol. Cryptology ePrint Archive, Report 2013\/280 v. 3 (2013). http:\/\/eprint.iacr.org\/2013\/280"},{"key":"5_CR53","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: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, pp. 299\u2013310. ACM (2013)","DOI":"10.1145\/2508859.2516660"},{"key":"5_CR54","doi-asserted-by":"crossref","unstructured":"Wang, X., Chan, H., Shi, E.: Circuit ORAM: on tightness of the Goldreich-Ostrovsky lower bound. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 850\u2013861. ACM (2015)","DOI":"10.1145\/2810103.2813634"},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Wang, X.S., Huang, Y., Chan, T.-H.H., Shelat, A., Shi, E.: SCORAM: oblivious RAM for secure computation. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, CCS 2014, pp. 191\u2013202, New York, NY, USA. ACM (2014)","DOI":"10.1145\/2660267.2660365"},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"Wang, X.S., Nayak, K., Liu, C., Chan, T., Shi, E., Stefanov, E., Huang, Y.: Oblivious data structures. In: Proceedings of the ACM SIGSAC Conference on Computer and Communications Security, pp. 215\u2013226. ACM (2014)","DOI":"10.1145\/2660267.2660314"},{"key":"5_CR57","unstructured":"Williams, P., Sion, R.: SR-ORAM: single round-trip oblivious RAM. ACNS, industrial track, pp. 19\u201333 (2012)"},{"key":"5_CR58","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: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 139\u2013148. ACM (2008)","DOI":"10.1145\/1455770.1455790"},{"key":"5_CR59","doi-asserted-by":"crossref","unstructured":"Williams, P., Sion, R., Tomescu, A.: PrivateFS: a parallel oblivious file system. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 977\u2013988. ACM (2012)","DOI":"10.1145\/2382196.2382299"},{"key":"5_CR60","doi-asserted-by":"crossref","unstructured":"Zahur, S., Wang, X.S., Raykova, M., Gasc\u00f3n, A., Doerner, J., Evans, D., Katz, J.: Revisiting square-root ORAM: efficient random access in multi-party computation. In: IEEE Symposium on Security and Privacy, SP, San Jose, CA, USA, 22\u201326 May, pp. 218\u2013234 (2016)","DOI":"10.1109\/SP.2016.21"},{"key":"5_CR61","unstructured":"Zhang, J., Ma, Q., Zhang, W., Qiao, D.: KT-ORAM: a bandwidth-efficient ORAM built on K-ary tree of PIR nodes (2014)"},{"key":"5_CR62","unstructured":"Zhang, J., Ma, Q., Zhang, W., Qiao, D.: MSKT-ORAM: a constant bandwidth ORAM without homomorphic encryption. IACR Cryptology ePrint Archive, Report 2016\/882 (2016)"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2017"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54365-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T18:59:43Z","timestamp":1750013983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-54365-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662543641","9783662543658"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54365-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"26 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Workshop on Public Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iacr.org\/workshops\/pkc2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}