{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:26Z","timestamp":1750221326008,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EPSRC","award":["EP\/M013286\/1"],"award-info":[{"award-number":["EP\/M013286\/1"]}]},{"name":"H2020 PANORAMIX","award":["653497"],"award-info":[{"award-number":["653497"]}]},{"name":"NII MOU Grant"},{"name":"Microsoft Research"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3139550.3139569","type":"proceedings-article","created":{"date-parts":[[2017,10,31]],"date-time":"2017-10-31T12:31:37Z","timestamp":1509453097000},"page":"51-61","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Mix-ORAM"],"prefix":"10.1145","author":[{"given":"Raphael R.","family":"Toledo","sequence":"first","affiliation":[{"name":"University College London, London, United Kingdom"}]},{"given":"George","family":"Danezis","sequence":"additional","affiliation":[{"name":"University College London, London, United Kingdom"}]},{"given":"Isao","family":"Echizen","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s Ajtai. 2010. Oblivious RAMs without cryptographic assumptions Proceedings of the forty-second ACM symposium on Theory of computing. ACM 181--190.  Mikl\u00f3s Ajtai. 2010. Oblivious RAMs without cryptographic assumptions Proceedings of the forty-second ACM symposium on Theory of computing. ACM 181--190.","DOI":"10.1145\/1806689.1806716"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/2323590"},{"key":"e_1_3_2_1_4_1","unstructured":"Michael Backes Amir Herzberg Aniket Kate and Ivan Pryvalov. [n. d.]. Anonymous RAM. ( [n. d.]).  Michael Backes Amir Herzberg Aniket Kate and Ivan Pryvalov. [n. d.]. Anonymous RAM. ( [n. d.])."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Stephanie Bayer and Jens Groth. 2012. Efficient zero-knowledge argument for correctness of a shuffle Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer 263--280.  Stephanie Bayer and Jens Groth. 2012. Efficient zero-knowledge argument for correctness of a shuffle Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer 263--280.","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Vincent Bindschaedler Muhammad Naveed Xiaorui Pan XiaoFeng Wang and Yan Huang. 2015. Practicing oblivious access on cloud storage: the gap the fallacy and the new way forward Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM 837--849.  Vincent Bindschaedler Muhammad Naveed Xiaorui Pan XiaoFeng Wang and Yan Huang. 2015. Practicing oblivious access on cloud storage: the gap the fallacy and the new way forward Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM 837--849.","DOI":"10.1145\/2810103.2813649"},{"key":"e_1_3_2_1_8_1","unstructured":"Dan Boneh David Mazieres and Raluca Ada Popa. 2011. Remote oblivious storage: Making oblivious RAM practical. (2011).  Dan Boneh David Mazieres and Raluca Ada Popa. 2011. Remote oblivious storage: Making oblivious RAM practical. (2011)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_10_1","unstructured":"Joan Daemen and Vincent Rijmen. 2013. The design of Rijndael: AES-the advanced encryption standard. Springer Science & Business Media.  Joan Daemen and Vincent Rijmen. 2013. The design of Rijndael: AES-the advanced encryption standard. Springer Science & Business Media."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd Sigurd Meldgaard and Jesper Buus Nielsen. 2011. Perfectly secure oblivious RAM without random oracles Theory of Cryptography Conference. Springer 144--163.  Ivan Damg\u00e5rd Sigurd Meldgaard and Jesper Buus Nielsen. 2011. Perfectly secure oblivious RAM without random oracles Theory of Cryptography Conference. Springer 144--163.","DOI":"10.1007\/978-3-642-19571-6_10"},{"volume-title":"Proceedings. 2003 Symposium on. IEEE, 2--15","year":"2003","author":"Danezis George","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.15"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029179.1029198"},{"volume-title":"International Conference on Financial Cryptography and Data Security. Springer, 127--140","year":"2011","author":"Franz Martin","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. 1987. Towards a theory of software protection and simulation by oblivious RAMs Proceedings of the nineteenth annual ACM symposium on Theory of computing. ACM 182--194.  Oded Goldreich. 1987. Towards a theory of software protection and simulation by oblivious RAMs Proceedings of the nineteenth annual ACM symposium on Theory of computing. ACM 182--194.","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","doi-asserted-by":"crossref","unstructured":"Michael T. Goodrich. 2010. Randomized shellsort: A simple oblivious sorting algorithm Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics 1262--1277.  Michael T. Goodrich. 2010. Randomized shellsort: A simple oblivious sorting algorithm Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics 1262--1277.","DOI":"10.1137\/1.9781611973075.101"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Michael T. Goodrich. 2014. Zig-zag sort: A simple deterministic data-oblivious sorting algorithm running in O(n log n) time Proceedings of the 46th Annual ACM Symposium on Theory of Computing. ACM 684--693.  Michael T. Goodrich. 2014. Zig-zag sort: A simple deterministic data-oblivious sorting algorithm running in O(n log n) time Proceedings of the 46th Annual ACM Symposium on Theory of Computing. ACM 684--693.","DOI":"10.1145\/2591796.2591830"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Michael T. Goodrich and Michael Mitzenmacher. 2012. Anonymous card shuffling and its applications to parallel mixnets International Colloquium on Automata Languages and Programming. Springer 549--560.  Michael T. Goodrich and Michael Mitzenmacher. 2012. Anonymous card shuffling and its applications to parallel mixnets International Colloquium on Automata Languages and Programming. Springer 549--560.","DOI":"10.1007\/978-3-642-31585-5_49"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Michael T. Goodrich Michael Mitzenmacher Olga Ohrimenko and Roberto Tamassia. 2012. Privacy-preserving group data access via stateless oblivious RAM simulation Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms. SIAM 157--167.  Michael T. Goodrich Michael Mitzenmacher Olga Ohrimenko and Roberto Tamassia. 2012. Privacy-preserving group data access via stateless oblivious RAM simulation Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms. SIAM 157--167.","DOI":"10.1137\/1.9781611973099.14"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Jens Groth and Steve Lu 2007natexlaba. A non-interactive shuffle with pairing based verifiability International Conference on the Theory and Application of Cryptology and Information Security. Springer 51--67.  Jens Groth and Steve Lu 2007natexlaba. A non-interactive shuffle with pairing based verifiability International Conference on the Theory and Application of Cryptology and Information Security. Springer 51--67.","DOI":"10.1007\/978-3-540-76900-2_4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_25"},{"key":"e_1_3_2_1_24_1","unstructured":"Markus Jakobsson Ari Juels and Ronald L Rivest. 2002. Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking. USENIX security symposium. San Francisco USA 339--353.  Markus Jakobsson Ari Juels and Ronald L Rivest. 2002. Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking. USENIX security symposium. San Francisco USA 339--353."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Jonathan Katz and Yehuda Lindell. 2014. Introduction to modern cryptography. CRC press.  Jonathan Katz and Yehuda Lindell. 2014. Introduction to modern cryptography. CRC press.","DOI":"10.1201\/b17668"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Hugo Krawczyk. 2010. Cryptographic extraction and key derivation: The HKDF scheme Annual Cryptology Conference. Springer 631--648.  Hugo Krawczyk. 2010. Cryptographic extraction and key derivation: The HKDF scheme Annual Cryptology Conference. Springer 631--648.","DOI":"10.1007\/978-3-642-14623-7_34"},{"key":"e_1_3_2_1_27_1","unstructured":"Grant McWilliams. 2014. Hardware aes showdown-via padlock vs intel aes-ni vs amd hexacore. (2014).  Grant McWilliams. 2014. Hardware aes showdown-via padlock vs intel aes-ni vs amd hexacore. (2014)."},{"key":"e_1_3_2_1_28_1","unstructured":"Ulf M\u00f6ller Lance Cottrell Peter Palfrader and Len Sassaman. 2003. Mixmaster protocol - version 2. Draft July Vol. 154 (2003).  Ulf M\u00f6ller Lance Cottrell Peter Palfrader and Len Sassaman. 2003. Mixmaster protocol - version 2. Draft July Vol. 154 (2003)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Olga Ohrimenko Michael T Goodrich Roberto Tamassia and Eli Upfal 2014. The Melbourne shuffle: Improving oblivious storage in the cloud International Colloquium on Automata Languages and Programming. Springer 556--567.  Olga Ohrimenko Michael T Goodrich Roberto Tamassia and Eli Upfal 2014. The Melbourne shuffle: Improving oblivious storage in the cloud International Colloquium on Automata Languages and Programming. Springer 556--567.","DOI":"10.1007\/978-3-662-43951-7_47"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100289"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840378"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_27"},{"key":"e_1_3_2_1_33_1","first-page":"997","article-title":"Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM","volume":"2014","author":"Ren Ling","year":"2014","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_11"},{"key":"e_1_3_2_1_35_1","unstructured":"Emil Stefanov Elaine Shi and Dawn Song. 2011. Towards practical oblivious RAM. arXiv preprint arXiv:1106.3652 (2011).  Emil Stefanov Elaine Shi and Dawn Song. 2011. Towards practical oblivious RAM. arXiv preprint arXiv:1106.3652 (2011)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Emil Stefanov Marten Van Dijk Elaine Shi Christopher Fletcher Ling Ren Xiangyao Yu and Srinivas Devadas. 2013. Path ORAM: an extremely simple oblivious RAM protocol Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security. ACM 299--310.  Emil Stefanov Marten Van Dijk Elaine Shi Christopher Fletcher Ling Ren Xiangyao Yu and Srinivas Devadas. 2013. Path ORAM: an extremely simple oblivious RAM protocol Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security. ACM 299--310.","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_1_37_1","unstructured":"Sameer Wagh Paul Cuff and Prateek Mittal. 2016. Root ORAM: A Tunable Differentially Private Oblivious RAM. arXiv preprint arXiv:1601.03378 (2016).  Sameer Wagh Paul Cuff and Prateek Mittal. 2016. Root ORAM: A Tunable Differentially Private Oblivious RAM. arXiv preprint arXiv:1601.03378 (2016)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_24"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455790"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Dallas Texas USA","acronym":"CCS '17"},"container-title":["Proceedings of the 2017 on Workshop on Privacy in the Electronic Society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3139550.3139569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3139550.3139569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:14:02Z","timestamp":1750212842000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3139550.3139569"}},"subtitle":["Using Delegated Shuffles."],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":39,"alternative-id":["10.1145\/3139550.3139569","10.1145\/3139550"],"URL":"https:\/\/doi.org\/10.1145\/3139550.3139569","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}