{"id":"https://openalex.org/W1993131747","doi":"https://doi.org/10.1145/2810103.2813701","title":"Constant Communication ORAM with Small Blocksize","display_name":"Constant Communication ORAM with Small Blocksize","publication_year":2015,"publication_date":"2015-10-06","ids":{"openalex":"https://openalex.org/W1993131747","doi":"https://doi.org/10.1145/2810103.2813701","mag":"1993131747"},"language":"en","primary_location":{"id":"doi:10.1145/2810103.2813701","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2810103.2813701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077407635","display_name":"Tarik Moataz","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tarik Moataz","raw_affiliation_strings":["Colorado State University &amp; Telecom Bretagne, IMT, Fort Collins, CO, USA","Colorado State University & Telecom Bretagne, IMT, Fort Collins, CO, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Colorado State University &amp; Telecom Bretagne, IMT, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]},{"raw_affiliation_string":"Colorado State University & Telecom Bretagne, IMT, Fort Collins, CO, USA#TAB#","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072280100","display_name":"Travis Mayberry","orcid":null},"institutions":[{"id":"https://openalex.org/I189158971","display_name":"United States Naval Academy","ror":"https://ror.org/00znex860","country_code":"US","type":"education","lineage":["https://openalex.org/I1330347796","https://openalex.org/I189158971","https://openalex.org/I3130687028"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Travis Mayberry","raw_affiliation_strings":["United States Naval Academy, Annapolis, MD, USA"],"affiliations":[{"raw_affiliation_string":"United States Naval Academy, Annapolis, MD, USA","institution_ids":["https://openalex.org/I189158971"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045932031","display_name":"Erik-Oliver Bla\u00df","orcid":"https://orcid.org/0009-0008-2791-1564"},"institutions":[{"id":"https://openalex.org/I4210136903","display_name":"Airbus (Germany)","ror":"https://ror.org/04a3akw68","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210121748","https://openalex.org/I4210136903"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Erik-Oliver Blass","raw_affiliation_strings":["Airbus Group Innovations, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Airbus Group Innovations, Munich, Germany","institution_ids":["https://openalex.org/I4210136903"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077407635"],"corresponding_institution_ids":["https://openalex.org/I92446798"],"apc_list":null,"apc_paid":null,"fwci":12.0803,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.98513704,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"862","last_page":"873"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998999834060669,"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":0.9998999834060669,"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.9800000190734863,"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"}},{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.965499997138977,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/homomorphic-encryption","display_name":"Homomorphic encryption","score":0.9459816217422485},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.702568531036377},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6753647327423096},{"id":"https://openalex.org/keywords/block-size","display_name":"Block size","score":0.5929771065711975},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5370287895202637},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5055427551269531},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.4645632803440094},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.4575561285018921},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.4538381099700928},{"id":"https://openalex.org/keywords/homomorphic-secret-sharing","display_name":"Homomorphic secret sharing","score":0.4393608868122101},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4230210781097412},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.422495573759079},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41925686597824097},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4130632281303406},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4015583097934723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2769091725349426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22351375222206116},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20519089698791504},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.13138648867607117},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11037904024124146},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10917744040489197}],"concepts":[{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.9459816217422485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.702568531036377},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6753647327423096},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.5929771065711975},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5370287895202637},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5055427551269531},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.4645632803440094},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.4575561285018921},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.4538381099700928},{"id":"https://openalex.org/C132161212","wikidata":"https://www.wikidata.org/wiki/Q5891458","display_name":"Homomorphic secret sharing","level":4,"score":0.4393608868122101},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4230210781097412},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.422495573759079},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41925686597824097},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4130632281303406},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4015583097934723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2769091725349426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22351375222206116},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20519089698791504},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.13138648867607117},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11037904024124146},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10917744040489197},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2810103.2813701","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2810103.2813701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W116648389","https://openalex.org/W148817282","https://openalex.org/W1511913323","https://openalex.org/W1545698365","https://openalex.org/W1565007622","https://openalex.org/W1678962037","https://openalex.org/W1684309424","https://openalex.org/W1704895987","https://openalex.org/W1821700043","https://openalex.org/W1988374166","https://openalex.org/W1995227741","https://openalex.org/W2000461888","https://openalex.org/W2004839833","https://openalex.org/W2005756274","https://openalex.org/W2019356824","https://openalex.org/W2037357643","https://openalex.org/W2048994663","https://openalex.org/W2076623138","https://openalex.org/W2139829638","https://openalex.org/W2152926062","https://openalex.org/W2154654620","https://openalex.org/W2170993700","https://openalex.org/W2262397100","https://openalex.org/W2268503241","https://openalex.org/W2951013082","https://openalex.org/W2951525008","https://openalex.org/W3122301743","https://openalex.org/W3124240744","https://openalex.org/W4225591807"],"related_works":["https://openalex.org/W4316659877","https://openalex.org/W3035389378","https://openalex.org/W2607647996","https://openalex.org/W3111147403","https://openalex.org/W2967222818","https://openalex.org/W3183645941","https://openalex.org/W2911298733","https://openalex.org/W3100960533","https://openalex.org/W2949835517","https://openalex.org/W2585986919"],"abstract_inverted_index":{"There":[0],"have":[1],"been":[2,24],"several":[3],"attempts":[4],"recently":[5],"at":[6],"using":[7],"homomorphic":[8,69,92,105,117],"encryption":[9,134],"to":[10,84,102],"increase":[11],"the":[12,20,80,91,121,130,143],"efficiency":[13],"of":[14,19,47,67,90,124],"Oblivious":[15],"RAM":[16],"protocols.":[17],"One":[18],"most":[21,89],"successful":[22],"has":[23,38],"Onion":[25,136],"ORAM,":[26],"which":[27,115],"achieves":[28],"O(1)":[29,96],"communication":[30,97],"overhead":[31],"with":[32,52,108],"polylogarithmic":[33,60],"server":[34,148],"computation.":[35,149],"However,":[36],"it":[37,57],"two":[39],"drawbacks.":[40],"It":[41],"requires":[42],"a":[43,109],"large":[44,53],"block":[45,82,145],"size":[46,83,146],"B":[48],"=":[49],"\u03a9(log6":[50],"N)":[51],"constants.":[54],"Moreover,":[55],"while":[56,94],"only":[58],"needs":[59],"computation":[61,64],"complexity,":[62],"that":[63,135],"consists":[65],"mostly":[66],"expensive":[68],"multiplications.":[70],"In":[71,126],"this":[72,128],"work,":[73],"we":[74],"address":[75],"these":[76],"problems":[77],"and":[78,119,140,147],"reduce":[79],"required":[81],"\u03a9(log4":[85],"N).":[86],"We":[87],"remove":[88],"multiplications":[93,118],"maintaining":[95],"complexity.":[98],"Our":[99],"idea":[100],"is":[101],"replace":[103],"their":[104],"eviction":[106,114],"routine":[107],"new,":[110],"much":[111],"cheaper":[112],"permute-and-merge":[113],"eliminates":[116],"maintains":[120],"same":[122],"level":[123],"security.":[125],"turn,":[127],"removes":[129],"need":[131],"for":[132],"layered":[133],"ORAM":[137],"relies":[138],"on":[139],"reduces":[141],"both":[142],"minimum":[144]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
