{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:40:05Z","timestamp":1750207205579,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:00:00Z","timestamp":1559001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,5,28]]},"DOI":"10.1145\/3322431.3325101","type":"proceedings-article","created":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:37:16Z","timestamp":1559306236000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["CAOS"],"prefix":"10.1145","author":[{"given":"Mihai","family":"Ordean","sequence":"first","affiliation":[{"name":"University of Birmingham, Birmingham, United Kingdom"}]},{"given":"Mark","family":"Ryan","sequence":"additional","affiliation":[{"name":"University of Birmingham, Birmingham, United Kingdom"}]},{"given":"David","family":"Galindo","sequence":"additional","affiliation":[{"name":"University of Birmingham & Fetch.AI, Birmingham, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2019,5,28]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"n. d.}. CAOS Souce Code. https:\/\/github.com\/meehien\/caos  n. d.}. CAOS Souce Code. https:\/\/github.com\/meehien\/caos"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1986.11971821"},{"key":"e_1_3_2_1_3_1","unstructured":"David Aldous and Jim Fill. 2002. Reversible Markov chains and random walks on graphs.  David Aldous and Jim Fill. 2002. Reversible Markov chains and random walks on graphs."},{"key":"e_1_3_2_1_4_1","unstructured":"Fredrik Back\u00e5ker. 2012. The Google Markov Chain: convergence speed and eigenvalues. Ph.D. Dissertation. Master Thesis Uppsala University Sweden.  Fredrik Back\u00e5ker. 2012. The Google Markov Chain: convergence speed and eigenvalues. Ph.D. Dissertation. Master Thesis Uppsala University Sweden."},{"key":"e_1_3_2_1_5_1","volume-title":"Relations Among Notions of Security for Public-Key Encryption Schemes. In Advances in Cryptology - CRYPTO '98","volume":"1462","author":"Bellare Mihir","year":"1998"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796270"},{"key":"e_1_3_2_1_7_1","unstructured":"Cloud Security Alliance. 2016. The Treacherous 12 - Cloud Computing Top Threats in 2016. Technical Report.  Cloud Security Alliance. 2016. The Treacherous 12 - Cloud Computing Top Threats in 2016. Technical Report."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"David Cash Stanislaw Jarecki Charanjit Jutla Hugo Krawczyk Marcel Rosu and Michael Steiner. {n. d.}. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. In Advances in Cryptology (CRYPTO '13). 353--373.  David Cash Stanislaw Jarecki Charanjit Jutla Hugo Krawczyk Marcel Rosu and Michael Steiner. {n. d.}. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. In Advances in Cryptology (CRYPTO '13). 353--373.","DOI":"10.1007\/978-3-642-40041-4_20"},{"volume-title":"Theory of Cryptography","author":"Devadas Srinivas","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Persi Diaconis James Allen Fill and Jim Pitman. 1992. Analysis of top to random shuffles. Combinatorics probability and computing Vol. 1 02 (1992) 135--155.  Persi Diaconis James Allen Fill and Jim Pitman. 1992. Analysis of top to random shuffles. Combinatorics probability and computing Vol. 1 02 (1992) 135--155.","DOI":"10.1017\/S0963548300000158"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_14_1","first-page":"12","article-title":"Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation","volume":"20","author":"Islam Mohammad Saiful","year":"2012","journal-title":"NDSS"},{"key":"e_1_3_2_1_15_1","unstructured":"Seny Kamara. 2014. Applied Crypto Highlights: Restricted Oblivious RAMs and Hidden Volume Encryption. http:\/\/outsourcedbits.org\/2014\/12\/09\/applied-crypto-highlights-restricted-oblivious-rams-and-hidden-volume-encryption\/.  Seny Kamara. 2014. Applied Crypto Highlights: Restricted Oblivious RAMs and Hidden Volume Encryption. http:\/\/outsourcedbits.org\/2014\/12\/09\/applied-crypto-highlights-restricted-oblivious-rams-and-hidden-volume-encryption\/."},{"key":"e_1_3_2_1_16_1","unstructured":"Ling Ren Christopher Fletcher Albert Kwon Emil Stefanov Elaine Shi Marten Van Dijk and Srinivas Devadas. 2015. Constants count: practical improvements to Oblivious RAM. In USENIX Security 15. 415--430.   Ling Ren Christopher Fletcher Albert Kwon Emil Stefanov Elaine Shi Marten Van Dijk and Srinivas Devadas. 2015. Constants count: practical improvements to Oblivious RAM. In USENIX Security 15. 415--430."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.20"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Seny Kamara and Charalampos Papamanthou. 2013. Parallel and Dynamic Searchable Symmetric Encryption.  Seny Kamara and Charalampos Papamanthou. 2013. Parallel and Dynamic Searchable Symmetric Encryption.","DOI":"10.1007\/978-3-642-39884-1_22"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.29"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.25"},{"key":"e_1_3_2_1_21_1","unstructured":"Emil Stefanov Elaine Shi and Dawn Song. 2012. Towards practical Oblivious RAM. Vol. 20 (2012) 12.  Emil Stefanov Elaine Shi and Dawn Song. 2012. Towards practical Oblivious RAM. Vol. 20 (2012) 12."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382299"}],"event":{"name":"SACMAT '19: The 24th ACM Symposium on Access Control Models and Technologies","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Toronto ON Canada","acronym":"SACMAT '19"},"container-title":["Proceedings of the 24th ACM Symposium on Access Control Models and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3322431.3325101","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3322431.3325101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:27Z","timestamp":1750206327000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3322431.3325101"}},"subtitle":["Concurrent-Access Obfuscated Store"],"short-title":[],"issued":{"date-parts":[[2019,5,28]]},"references-count":23,"alternative-id":["10.1145\/3322431.3325101","10.1145\/3322431"],"URL":"https:\/\/doi.org\/10.1145\/3322431.3325101","relation":{},"subject":[],"published":{"date-parts":[[2019,5,28]]},"assertion":[{"value":"2019-05-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}