{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T02:11:41Z","timestamp":1784167901605,"version":"3.55.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,8]]},"abstract":"<jats:p>Many companies choose the cloud as their data and IT infrastructure platform. The remote access of the data brings the issue of trust. Despite the use of strong encryption schemes, adversaries can still learn valuable information regarding encrypted data by observing the data access patterns. To that end, one can hide the access patterns, which may leak sensitive information, using Oblivious RAMs (ORAMs). Numerous works have proposed different ORAM constructions, but they have never been thoroughly compared against and tested on large databases. There are also no open source implementation of these schemes.<\/jats:p>\n          <jats:p>These limitations make it difficult for researchers and practitioners to choose and adopt a suitable ORAM for their applications. To address this issue, we provide a thorough study over several practical ORAM constructions, and implement them under the same library. We perform extensive experiments to provide insights into their performance characteristics with respect to efficiency, scalability, and communication cost.<\/jats:p>","DOI":"10.14778\/2994509.2994528","type":"journal-article","created":{"date-parts":[[2016,9,6]],"date-time":"2016-09-06T15:27:03Z","timestamp":1473175623000},"page":"1113-1124","source":"Crossref","is-referenced-by-count":49,"title":["Oblivious RAM"],"prefix":"10.14778","volume":"9","author":[{"given":"Zhao","family":"Chang","sequence":"first","affiliation":[{"name":"University of Utah"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Xie","sequence":"additional","affiliation":[{"name":"University of Utah"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feifei","family":"Li","sequence":"additional","affiliation":[{"name":"University of Utah"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808726"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467797"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113304"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588893"},{"key":"e_1_2_1_5_1","first-page":"26","volume-title":"ICDT","author":"Arasu A.","year":"2014","unstructured":"A. Arasu and R. Kaushik . Oblivious query processing . In ICDT , pages 26 -- 37 , 2014 . A. Arasu and R. Kaushik. Oblivious query processing. In ICDT, pages 26--37, 2014."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592585"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.38"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/364520.364540"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28416"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_2_1_15_1","first-page":"1262","volume-title":"SODA","author":"Goodrich M. T.","year":"2010","unstructured":"M. T. Goodrich . Randomized Shellsort : A simple oblivious sorting algorithm . In SODA , pages 1262 -- 1277 , 2010 . M. T. Goodrich. Randomized Shellsort: A simple oblivious sorting algorithm. In SODA, pages 1262--1277, 2010."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2027223.2027282"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133601.2133604"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095130"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564717"},{"key":"e_1_2_1_20_1","volume-title":"NDSS","author":"Islam M. S.","year":"2012","unstructured":"M. S. Islam , M. Kuzu , and M. Kantarcioglu . Access pattern disclosure on searchable encryption: Ramification, attack and mitigation . In NDSS , 2012 . M. S. Islam, M. Kuzu, and M. Kantarcioglu. Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In NDSS, 2012."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095129"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497553"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.29"},{"key":"e_1_2_1_24_1","first-page":"199","volume-title":"FAST","author":"Lorch J. R.","year":"2013","unstructured":"J. R. Lorch , B. Parno , J. W. Mickens , M. Raykova , and J. Schiffman . Shroud: Ensuring private access to large-scale data in the data center . In FAST , pages 199 -- 214 , 2013 . J. R. Lorch, B. Parno, J. W. Mickens, M. Raykova, and J. Schiffman. Shroud: Ensuring private access to large-scale data in the data center. In FAST, pages 199--214, 2013."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212352"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100289"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881447"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.25"},{"key":"e_1_2_1_32_1","volume-title":"NDSS","author":"Stefanov E.","year":"2012","unstructured":"E. Stefanov , E. Shi , and D. X. Song . Towards practical oblivious RAM . In NDSS , 2012 . E. Stefanov, E. Shi, and D. X. Song. Towards practical oblivious RAM. In NDSS, 2012."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488336"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660365"},{"key":"e_1_2_1_36_1","volume-title":"NDSS","author":"Williams P.","year":"2008","unstructured":"P. Williams and R. Sion . Usable PIR . In NDSS , 2008 . P. Williams and R. Sion. Usable PIR. In NDSS, 2008."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382299"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498254"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544870"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2994509.2994528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:53:43Z","timestamp":1672224823000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2994509.2994528"}},"subtitle":["a dissection and experimental evaluation"],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":37,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.14778\/2994509.2994528"],"URL":"https:\/\/doi.org\/10.14778\/2994509.2994528","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}