{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:50:49Z","timestamp":1767340249192,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:00:00Z","timestamp":1508803200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1161541","1526707","1318572"],"award-info":[{"award-number":["1161541","1526707","1318572"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"N","award":["1526102"],"award-info":[{"award-number":["1526102"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,10,24]]},"DOI":"10.1145\/2976749.2989062","type":"proceedings-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T08:46:35Z","timestamp":1477385195000},"page":"1754-1756","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["POSTER"],"prefix":"10.1145","author":[{"given":"Anrin","family":"Chakraborti","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]},{"given":"Radu","family":"Sion","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"unstructured":"E. Boyle K.-M. Chung and R. Pass. Oblivious parallel ram and applications. Cryptology ePrint Archive Report 2014\/594 2014. http:\/\/eprint.iacr.org\/.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","volume-title":"Statistically-secure ORAM with ~\u00d8(log2 n) overhead. CoRR, abs\/1307.3699","author":"Chung K.","year":"2013","unstructured":"K. Chung, Z. Liu, and R. Pass. Statistically-secure ORAM with ~\u00d8(log2 n) overhead. CoRR, abs\/1307.3699, 2013."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_4_1","volume-title":"in Network and Distributed System Security Symposium (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 in Network and Distributed System Security Symposium (NDSS, 2012."},{"key":"e_1_3_2_1_5_1","volume-title":"Taostore: Overcoming asynchronicity in oblivious data storage","author":"Lin C. S. V. Z. A. E. A. H. R.","year":"2016","unstructured":"C. S. V. Z. A. E. A. H. R. Lin and S. Tessaro. Taostore: Overcoming asynchronicity in oblivious data storage. IEEE Security and Privacy(Oakland), 2016."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.5555\/2831143.2831170"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/978-3-642-25385-0_11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/2508859.2516660"},{"unstructured":"B. C. H. L. S. Tessaro. Oblivious parallel ram: Improved efficiency and generic constructions. Cryptology ePrint Archive Report 2015\/1053 2015. http:\/\/eprint.iacr.org\/.","key":"e_1_3_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/2382196.2382299"}],"event":{"sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"acronym":"CCS'16","name":"CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security","location":"Vienna Austria"},"container-title":["Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2989062","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2989062","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2989062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:24:16Z","timestamp":1763457856000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2989062"}},"subtitle":["ConcurORAM: High-Throughput Parallel Multi-Client ORAM"],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":10,"alternative-id":["10.1145\/2976749.2989062","10.1145\/2976749"],"URL":"https:\/\/doi.org\/10.1145\/2976749.2989062","relation":{},"subject":[],"published":{"date-parts":[[2016,10,24]]},"assertion":[{"value":"2016-10-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}