{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T16:50:33Z","timestamp":1783788633868,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T00:00:00Z","timestamp":1414972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","award":["HKU719312E"],"award-info":[{"award-number":["HKU719312E"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-1314857"],"award-info":[{"award-number":["CNS-1314857"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-14-C-0057"],"award-info":[{"award-number":["FA8750-14-C-0057"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,11,3]]},"DOI":"10.1145\/2660267.2660314","type":"proceedings-article","created":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T13:40:05Z","timestamp":1415713205000},"page":"215-226","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":121,"title":["Oblivious Data Structures"],"prefix":"10.1145","author":[{"given":"Xiao Shaun","family":"Wang","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chang","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T-H. Hubert","family":"Chan","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emil","family":"Stefanov","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Huang","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Hardware AES showdown - via padlock vs intel AES-NI vs AMD hexacore. http:\/\/grantmcwilliams.com\/tech\/technology\/item\/532-hardware-aes-showdown-via-padlock-vs-intel-aes-ni-vsamd-hexacore.  Hardware AES showdown - via padlock vs intel AES-NI vs AMD hexacore. http:\/\/grantmcwilliams.com\/tech\/technology\/item\/532-hardware-aes-showdown-via-padlock-vs-intel-aes-ni-vsamd-hexacore."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866341"},{"key":"e_1_3_2_1_3_1","first-page":"4","article-title":"Plongements lipschitziens dans Rn","volume":"111","author":"Assouad P","year":"1983","unstructured":"Assouad , P . Plongements lipschitziens dans Rn . Bull. Soc. Math. France 111 , 4 ( 1983 ), 429--448. Assouad, P. Plongements lipschitziens dans Rn. Bull. Soc. Math. France 111, 4 (1983), 429--448.","journal-title":"Bull. Soc. Math. France"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411514"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"O., Kreveld, M. v., and Overmars, M. Computational Geometry: Algorithms and Applications.","author":"Berg M.","year":"2008","unstructured":"Berg , M. d., Cheong , O., Kreveld, M. v., and Overmars, M. Computational Geometry: Algorithms and Applications. 2008 . Berg, M. d., Cheong, O., Kreveld, M. v., and Overmars, M. Computational Geometry: Algorithms and Applications. 2008."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484341"},{"key":"e_1_3_2_1_8_1","volume-title":"FOCS","author":"Blelloch G. E.","year":"2007","unstructured":"Blelloch , G. E. , and Golovin , D . Strongly history-independent hashing with applications . In FOCS ( 2007 ). Blelloch, G. E., and Golovin, D. Strongly history-independent hashing with applications. In FOCS (2007)."},{"key":"e_1_3_2_1_9_1","unstructured":"Chung K.-M. Liu Z. and Pass R. Statistically-secure oram with O(log2 n) overhead. http:\/\/arxiv.org\/abs\/1307.3699 2013.  Chung K.-M. Liu Z. and Pass R. Statistically-secure oram with O(log2 n) overhead. http:\/\/arxiv.org\/abs\/1307.3699 2013."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009449"},{"key":"e_1_3_2_1_11_1","volume-title":"TCC","author":"Damgard I.","year":"2011","unstructured":"Damgard , I. , Meldgaard , S. , and Nielsen , J. B . Perfectly secure oblivious RAM without random oracles . In TCC ( 2011 ). Damgard, I., Meldgaard, S., and Nielsen, J. B. Perfectly secure oblivious RAM without random oracles. In TCC (2011)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869790.1869796"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382536.2382540"},{"key":"e_1_3_2_1_14_1","volume-title":"Canadian Journal of Mathematics","author":"Ford Jr., L. R.","year":"1956","unstructured":"Ford , Jr., L. R. , and Fulkerson , D. R . Maximal ow through a network . In Canadian Journal of Mathematics ( 1956 ). Ford, Jr., L. R., and Fulkerson, D. R. Maximal ow through a network. In Canadian Journal of Mathematics (1956)."},{"key":"e_1_3_2_1_15_1","volume-title":"PETS","author":"Gentry C.","year":"2013","unstructured":"Gentry , C. , Goldman , K. A. , Halevi , S. , Jutla , C. S. , Raykova , M. , and Wichs , D . Optimizing ORAM and using it effciently for secure computation . In PETS ( 2013 ). Gentry, C., Goldman, K. A., Halevi, S., Jutla, C. S., Raykova, M., and Wichs, D. Optimizing ORAM and using it effciently for secure computation. In PETS (2013)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_18_1","volume-title":"ICALP","author":"Goodrich M. T.","year":"2011","unstructured":"Goodrich , M. T. , and Mitzenmacher , M . Privacy-preserving access of outsourced data via oblivious RAM simulation . In ICALP ( 2011 ). Goodrich, M. T., and Mitzenmacher, M. Privacy-preserving access of outsourced data via oblivious RAM simulation. In ICALP (2011)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046680"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133601.2133604"},{"key":"e_1_3_2_1_21_1","volume-title":"SODA","author":"Goodrich M. T.","year":"2012","unstructured":"Goodrich , M. T. , Mitzenmacher , M. , Ohrimenko , O. , and Tamassia , R . Privacy-preserving group data access via stateless oblivious RAM simulation . In SODA ( 2012 ). Goodrich, M. T., Mitzenmacher, M., Ohrimenko, O., and Tamassia, R. Privacy-preserving group data access via stateless oblivious RAM simulation. In SODA (2012)."},{"key":"e_1_3_2_1_22_1","volume-title":"Data-oblivious graph drawing model and algorithms. CoRR abs\/1209.0756","author":"Goodrich M. T.","year":"2012","unstructured":"Goodrich , M. T. , Ohrimenko , O. , and Tamassia , R . Data-oblivious graph drawing model and algorithms. CoRR abs\/1209.0756 ( 2012 ). Goodrich, M. T., Ohrimenko, O., and Tamassia, R. Data-oblivious graph drawing model and algorithms. CoRR abs\/1209.0756 (2012)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382251"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946308"},{"key":"e_1_3_2_1_25_1","volume-title":"Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium","author":"Huang Y.","year":"2011","unstructured":"Huang , Y. , Evans , D. , Katz , J. , and Malka , L . Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium ( 2011 ). Huang, Y., Evans, D., Katz, J., and Malka, L. Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security Symposium (2011)."},{"key":"e_1_3_2_1_26_1","volume-title":"NDSS","author":"Islam M.","year":"2012","unstructured":"Islam , M. , Kuzu , M. , and Kantarcioglu , M . Access pattern disclosure on searchable encryption: Ramification, attack and mitigation . In NDSS ( 2012 ). Islam, M., Kuzu, M., and Kantarcioglu, M. Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In NDSS (2012)."},{"key":"e_1_3_2_1_28_1","volume-title":"SODA","author":"Kushilevitz E.","year":"2012","unstructured":"Kushilevitz , E. , Lu , S. , and Ostrovsky , R . On the (in)security of hash-based oblivious RAM and a new balancing scheme . In SODA ( 2012 ). Kushilevitz, E., Lu, S., and Ostrovsky, R. On the (in)security of hash-based oblivious RAM and a new balancing scheme. In SODA (2012)."},{"key":"e_1_3_2_1_29_1","series-title":"SIAM Journal on Applied Mathematics","volume-title":"A Separator Theorem for Planar Graphs","author":"Lipton R. J.","year":"1979","unstructured":"Lipton , R. J. , and Tarjan , R. E . A Separator Theorem for Planar Graphs . SIAM Journal on Applied Mathematics ( 1979 ). Lipton, R. J., and Tarjan, R. E. A Separator Theorem for Planar Graphs. SIAM Journal on Applied Mathematics (1979)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2013.11"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.46"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_22"},{"key":"e_1_3_2_1_33_1","volume-title":"EUROCRYPT","author":"Lu S.","year":"2013","unstructured":"Lu , S. , and Ostrovsky , R . How to garble ram programs . In EUROCRYPT ( 2013 ). Lu, S., and Ostrovsky, R. How to garble ram programs. In EUROCRYPT (2013)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516692"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258638"},{"key":"e_1_3_2_1_36_1","volume-title":"STACS","author":"Mitchell J. C.","year":"2014","unstructured":"Mitchell , J. C. , and Zimmerman , J . Data-Oblivious Data Structures . In STACS ( 2014 ). Mitchell, J. C., and Zimmerman, J. Data-Oblivious Data Structures. In STACS (2014)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516751"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258606"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/322123.322138"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.25"},{"key":"e_1_3_2_1_43_1","volume-title":"NDSS","author":"Stefanov E.","year":"2012","unstructured":"Stefanov , E. , Shi , E. , and Song , D . Towards practical oblivious RAM . In NDSS ( 2012 ). Stefanov, E., Shi, E., and Song, D. Towards practical oblivious RAM. In NDSS (2012)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/782814.782838"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/378995.379237"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993859"},{"key":"e_1_3_2_1_49_1","volume-title":"NDSS","author":"Williams P.","year":"2008","unstructured":"Williams , P. , and Sion , R . Usable PIR . In NDSS ( 2008 ). Williams, P., and Sion, R. Usable PIR. In NDSS (2008)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382229"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455790"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382299"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.40"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046772"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254078"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1037187.1024403"}],"event":{"name":"CCS'14: 2014 ACM SIGSAC Conference on Computer and Communications Security","location":"Scottsdale Arizona USA","acronym":"CCS'14","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660267.2660314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:10Z","timestamp":1750229770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,3]]},"references-count":53,"alternative-id":["10.1145\/2660267.2660314","10.1145\/2660267"],"URL":"https:\/\/doi.org\/10.1145\/2660267.2660314","relation":{},"subject":[],"published":{"date-parts":[[2014,11,3]]},"assertion":[{"value":"2014-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}