{"id":"https://openalex.org/W4388856956","doi":"https://doi.org/10.1145/3576915.3623125","title":"FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM","display_name":"FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM","publication_year":2023,"publication_date":"2023-11-15","ids":{"openalex":"https://openalex.org/W4388856956","doi":"https://doi.org/10.1145/3576915.3623125"},"language":"en","primary_location":{"id":"doi:10.1145/3576915.3623125","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3576915.3623125","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3576915.3623125","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3576915.3623125","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042677137","display_name":"Gilad Asharov","orcid":"https://orcid.org/0000-0002-0846-9773"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gilad Asharov","raw_affiliation_strings":["Bar-Ilan University, Ramat Gan, Israel"],"raw_orcid":"https://orcid.org/0000-0002-0846-9773","affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032483797","display_name":"Ilan Komargodski","orcid":"https://orcid.org/0000-0002-1647-2112"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilan Komargodski","raw_affiliation_strings":["Hebrew University & NTT Research, Jerusalem, Israel"],"raw_orcid":"https://orcid.org/0000-0002-1647-2112","affiliations":[{"raw_affiliation_string":"Hebrew University & NTT Research, Jerusalem, Israel","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5093307563","display_name":"Yehuda Michelson","orcid":"https://orcid.org/0009-0007-8924-1896"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yehuda Michelson","raw_affiliation_strings":["Bar-Ilan University, Ramat Gan, Israel"],"raw_orcid":"https://orcid.org/0009-0007-8924-1896","affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3313","last_page":"3327"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8121470212936401},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5754358768463135},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5638369917869568},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5203185081481934},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.508192777633667},{"id":"https://openalex.org/keywords/square-root","display_name":"Square root","score":0.4909978210926056},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.48172977566719055},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.46802788972854614},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.46616631746292114},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4259389042854309},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.3420277237892151},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3277183175086975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3246515691280365},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17762702703475952},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14147621393203735}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8121470212936401},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5754358768463135},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5638369917869568},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5203185081481934},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.508192777633667},{"id":"https://openalex.org/C11577676","wikidata":"https://www.wikidata.org/wiki/Q134237","display_name":"Square root","level":2,"score":0.4909978210926056},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.48172977566719055},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.46802788972854614},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.46616631746292114},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4259389042854309},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3420277237892151},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3277183175086975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3246515691280365},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17762702703475952},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14147621393203735},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3576915.3623125","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3576915.3623125","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3576915.3623125","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3576915.3623125","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3576915.3623125","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3576915.3623125","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G1282474943","display_name":null,"funder_award_id":"2439/20","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G566354793","display_name":"Private Machine Learning","funder_award_id":"891234","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7361187543","display_name":null,"funder_award_id":"1774/20","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321950","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4388856956.pdf","grobid_xml":"https://content.openalex.org/works/W4388856956.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1545698365","https://openalex.org/W1987015607","https://openalex.org/W1988374166","https://openalex.org/W2000461888","https://openalex.org/W2005756274","https://openalex.org/W2019356824","https://openalex.org/W2033165262","https://openalex.org/W2051576234","https://openalex.org/W2061619267","https://openalex.org/W2067768229","https://openalex.org/W2076458424","https://openalex.org/W2117241830","https://openalex.org/W2120202298","https://openalex.org/W2143020967","https://openalex.org/W2155720185","https://openalex.org/W2160222995","https://openalex.org/W2166247408","https://openalex.org/W2170993700","https://openalex.org/W2296585978","https://openalex.org/W2350778671","https://openalex.org/W2537304608","https://openalex.org/W2603398316","https://openalex.org/W2766170121","https://openalex.org/W2769094878","https://openalex.org/W2809996417","https://openalex.org/W2902751186","https://openalex.org/W3013772464","https://openalex.org/W3021651652","https://openalex.org/W3029037520","https://openalex.org/W3189270234","https://openalex.org/W4206427541","https://openalex.org/W4253677642","https://openalex.org/W4306179313","https://openalex.org/W6601760687"],"related_works":["https://openalex.org/W1975289146","https://openalex.org/W2389267936","https://openalex.org/W2010941966","https://openalex.org/W140150844","https://openalex.org/W2099873975","https://openalex.org/W2105887828","https://openalex.org/W2122599759","https://openalex.org/W4236520801","https://openalex.org/W2217961521","https://openalex.org/W4235558922"],"abstract_inverted_index":{"Oblivious":[0],"RAM":[1],"(ORAM)":[2],"is":[3,13],"a":[4,14],"general-purpose":[5],"technique":[6],"for":[7,39,52],"hiding":[8],"memory":[9],"access":[10],"patterns.":[11],"This":[12],"fundamental":[15],"task":[16],"underlying":[17],"many":[18,40],"secure":[19],"computation":[20],"applications.":[21,42],"While":[22],"known":[23],"ORAM":[24,47,57],"schemes":[25,48],"provide":[26],"optimal":[27],"asymptotic":[28],"complexity,":[29],"despite":[30],"extensive":[31],"efforts,":[32],"their":[33],"concrete":[34],"costs":[35],"remain":[36],"prohibitively":[37],"expensive":[38],"interesting":[41],"The":[43],"current":[44],"state-of-the-art":[45],"practical":[46],"are":[49],"suitable":[50],"only":[51],"somewhat":[53],"small":[54],"memories":[55],"(Square-Root":[56],"or":[58],"Path":[59],"ORAM).":[60]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-25T15:57:00.446498","created_date":"2025-10-10T00:00:00"}