{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T16:08:44Z","timestamp":1765728524283,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_19","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"241-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Data-Oblivious Graph Algorithms in Outsourced External Memory"],"prefix":"10.1007","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph A.","family":"Simons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Blanton, M., Steele, A., Aliasgari, M.: Data-oblivious graph algorithms for secure computation and outsourcing. In: ASIACCS, pp. 207\u2013218 (2013)","DOI":"10.1145\/2484313.2484341"},{"key":"19_CR2","unstructured":"Chiang, Y.J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Symposium on Discrete Algorithms (SODA), pp. 139\u2013149 (1995)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19571-6_10","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2011","unstructured":"Damg\u00e5rd, I., Meldgaard, S., Nielsen, J.B.: Perfectly secure oblivious ram without random oracles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 144\u2013163. Springer, Heidelberg (2011)"},{"key":"19_CR4","unstructured":"Emil Stefanov, E.S., Song, D.: Towards practical oblivious RAM. In: Sion, R. (ed.) NDSS 2012 (2012)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-39077-7_1","volume-title":"Privacy Enhancing Technologies","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Goldman, K.A., Halevi, S., Julta, C., Raykova, M., Wichs, D.: Optimizing ORAM and using it efficiently for secure computation. In: De Cristofaro, E., Wright, M. (eds.) PETS 2013. LNCS, vol. 7981, pp. 1\u201318. Springer, Heidelberg (2013)"},{"issue":"3","key":"19_CR6","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 43(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"19_CR7","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":"MT 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. 6756, pp. 576\u2013587. Springer, Heidelberg (2011)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Oblivious RAM simulation with efficient worst-case access overhead. In: CCSW, pp. 95\u2013100 (2011)","DOI":"10.1145\/2046660.2046680"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Practical oblivious storage. In: CODASPY, pp. 13\u201324 (2012)","DOI":"10.1145\/2133601.2133604"},{"key":"19_CR10","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: Symposium on Discrete Algorithms (SODA), pp. 157\u2013167 (2012)","DOI":"10.1137\/1.9781611973099.14"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-36763-2_5","volume-title":"Graph Drawing","author":"MT Goodrich","year":"2013","unstructured":"Goodrich, M.T., Ohrimenko, O., Tamassia, R.: Graph drawing in the cloud: privately visualizing relational data using small working storage. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 43\u201354. Springer, Heidelberg (2013)"},{"key":"19_CR12","unstructured":"Goodrich, M.T., Simons, J.: Data-oblivious graph algorithms in outsourced external memory. ArXiv 1409.0597 (2014). http:\/\/arxiv.org\/abs\/1409.0597"},{"issue":"3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","volume":"47","author":"Y Maon","year":"1986","unstructured":"Maon, Y., Schieber, B., Vishkin, U.: Parallel ear decomposition search (EDS) and st-numbering in graphs. Theor. Comput. Sci. 47(3), 277\u2013298 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"19_CR14","first-page":"315","volume":"40","author":"M Mare\u0161","year":"2004","unstructured":"Mare\u0161, M.: Two linear time algorithms for MST on minor closed graph classes. Arch. Math. (Brno) 40(3), 315\u2013320 (2004)","journal-title":"Arch. Math. (Brno)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Miller, G.L., Reif, J.H.: Parallel tree contraction and its application. In: FOCS, pp. 478\u2013489 (1985)","DOI":"10.1109\/SFCS.1985.43"},{"issue":"6","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput. 17(6), 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Stefanov, E., van Dijk, M., Shi, E., Fletcher, C.W., Ren, L., Yu, X., Devadas, S.: Path ORAM: an extremely simple oblivious RAM protocol. IACR Cryptology ePrint Archive 2013, p. 280 (2013)","DOI":"10.1145\/2508859.2516660"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Shi, E.: Oblivistore: high performance oblivious cloud storage. In: IEEE Security and Privacy, pp. 253\u2013267 (2013)","DOI":"10.1109\/SP.2013.25"},{"issue":"4","key":"19_CR19","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"RE Tarjan","year":"1985","unstructured":"Tarjan, R.E., Vishkin, U.: An efficient parallel biconnectivity algorithm. SIAM J. Comput. 14(4), 862\u2013874 (1985)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"19_CR20","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(85)90025-0","volume":"20","author":"U Vishkin","year":"1985","unstructured":"Vishkin, U.: On efficient parallel strong orientation. Inf. Process. Lett. 20(5), 235\u2013240 (1985)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T12:17:50Z","timestamp":1675253870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}