{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T15:10:39Z","timestamp":1770217839198,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439500","type":"print"},{"value":"9783662439517","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_47","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"556-567","source":"Crossref","is-referenced-by-count":34,"title":["The Melbourne Shuffle: Improving Oblivious Storage in the Cloud"],"prefix":"10.1007","author":[{"given":"Olga","family":"Ohrimenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An O(n logn) sorting network. In: ACM Symp on Theory of Computing (STOC), pp. 1\u20139 (1983)","DOI":"10.1145\/800061.808726"},{"issue":"5","key":"47_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.2307\/2323590","volume":"93","author":"D. Aldous","year":"1986","unstructured":"Aldous, D., Diaconis, P.: Shuffling cards and stopping times. The American Mathematical Monthly\u00a093(5), 333\u2013348 (1986)","journal-title":"The American Mathematical Monthly"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proc. 1968 Spring Joint Computer Conf., pp. 307\u2013314. AFIPS Press (1968)","DOI":"10.1145\/1468075.1468121"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Towards a theory of software protection and simulation by oblivious RAMs. In: ACM Symp. on Theory of Computing. pp. 182\u2013194 (1987)","DOI":"10.1145\/28395.28416"},{"issue":"3","key":"47_CR5","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM\u00a043(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T.: Randomized Shellsort: A simple oblivious sorting algorithm. In: Proc. ACM-SIAM Sump. on Discrete Algorithms (SODA), pp. 1\u201316 (2010)","DOI":"10.1137\/1.9781611973075.101"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T.: Zig-zag Sort: A Deterministic Data-Oblivious Sorting Algorithm Running in O(nlogn) Time. In: ACM Symp. on Theory of Computing (2014)","DOI":"10.1145\/2591796.2591830"},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-642-22012-8_46","volume-title":"Automata, Languages and Programming","author":"M.T. Goodrich","year":"2011","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 576\u2013587. Springer, Heidelberg (2011)"},{"key":"47_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-642-31585-5_49","volume-title":"Automata, Languages, and Programming","author":"M.T. Goodrich","year":"2012","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Anonymous card shuffling and its applications to parallel mixnets. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 549\u2013560. Springer, Heidelberg (2012)"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Oblivious RAM simulation with efficient worst-case access overhead. In: Proc. ACM Workshop on Cloud Computing Security (CCSW), pp. 95\u2013100 (2011)","DOI":"10.1145\/2046660.2046680"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Practical oblivious storage. In: ACM Conf. on Data and Application Security and Privacy (CODASPY), pp. 13\u201324 (2012)","DOI":"10.1145\/2133601.2133604"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Privacy-preserving group data access via stateless oblivious RAM simulation. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 157\u2013167 (2012)","DOI":"10.1137\/1.9781611973099.14"},{"key":"47_CR13","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In: NDSS (2012)"},{"key":"47_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-14992-4_13","volume-title":"Financial Cryptography and Data Security","author":"S. Kamara","year":"2010","unstructured":"Kamara, S., Lauter, K.: Cryptographic cloud storage. In: Sion, R., Curtmola, R., Dietrich, S., Kiayias, A., Miret, J.M., Sako, K., Seb\u00e9, F. (eds.) RLCPS, WECSR, and WLC 2010. LNCS, vol.\u00a06054, pp. 136\u2013149. Springer, Heidelberg (2010)"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lu, S., Ostrovsky, R.: On the (in)security of hash-based oblivious RAM and a new balancing scheme. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 143\u2013156 (2012)","DOI":"10.1137\/1.9781611973099.13"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511813603"},{"key":"47_CR17","doi-asserted-by":"crossref","unstructured":"Ohrimenko, O., Goodrich, M.T., Tamassia, R., Upfal, E.: The Melbourne shuffle: Improving oblivious storage in the cloud. CoRR abs\/1402.5524 (2014)","DOI":"10.1007\/978-3-662-43951-7_47"},{"key":"47_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-14623-7_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"B. Pinkas","year":"2010","unstructured":"Pinkas, B., Reinman, T.: Oblivious RAM revisited. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 502\u2013519. Springer, Heidelberg (2010)"},{"key":"47_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-25385-0_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"E. Shi","year":"2011","unstructured":"Shi, E., Chan, T.-H.H., Stefanov, E., Li, M.: Oblivious RAM with o((logn)3) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 197\u2013214. Springer, Heidelberg (2011)"},{"key":"47_CR20","doi-asserted-by":"crossref","unstructured":"Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., Devadas, S.: Path ORAM: An Extremely Simple Oblivious RAM Protocol. In: ACM Conf. on Computer and Communications Security, CCS (2013)","DOI":"10.1145\/2508859.2516660"},{"key":"47_CR21","unstructured":"Stefanov, E., Shi, E., Song, D.: Towards Practical Oblivious RAM. In: Proc. Network and Distributed System Security Symposium (NDSS) (2012)"},{"key":"47_CR22","doi-asserted-by":"crossref","unstructured":"Williams, P., Sion, R.: Single round access privacy on outsourced storage. In: ACM Conf. on Computer and Communications Security, pp. 293\u2013304 (2012)","DOI":"10.1145\/2382196.2382229"},{"key":"47_CR23","doi-asserted-by":"crossref","unstructured":"Williams, P., Sion, R., Carbunar, B.: Building castles out of mud: practical access pattern privacy and correctness on untrusted storage. In: ACM Conference on Computer and Communications Security (CCS), pp. 139\u2013148 (2008)","DOI":"10.1145\/1455770.1455790"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:13:54Z","timestamp":1558908834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}