{"id":"https://openalex.org/W4404515207","doi":"https://doi.org/10.1145/3689945.3694808","title":"Oraqle: A Depth-Aware Secure Computation Compiler","display_name":"Oraqle: A Depth-Aware Secure Computation Compiler","publication_year":2023,"publication_date":"2023-11-19","ids":{"openalex":"https://openalex.org/W4404515207","doi":"https://doi.org/10.1145/3689945.3694808"},"language":"en","primary_location":{"id":"doi:10.1145/3689945.3694808","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689945.3694808","pdf_url":null,"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 12th Workshop on Encrypted Computing &amp; Applied Homomorphic Cryptography","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3689945.3694808","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045164258","display_name":"Jelle Vos","orcid":"https://orcid.org/0000-0002-3979-9740"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jelle Vos","raw_affiliation_strings":["Delft University of Technology, Delft, Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-3979-9740","affiliations":[{"raw_affiliation_string":"Delft University of Technology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063847107","display_name":"Mauro Conti","orcid":"https://orcid.org/0000-0002-3612-1934"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Mauro Conti","raw_affiliation_strings":["University of Padua &amp; Delft University of Technology, Padua, Italy"],"raw_orcid":"https://orcid.org/0000-0002-3612-1934","affiliations":[{"raw_affiliation_string":"University of Padua &amp; Delft University of Technology, Padua, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088322463","display_name":"Zekeriya Erkin","orcid":"https://orcid.org/0000-0001-8932-4703"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Zekeriya Erkin","raw_affiliation_strings":["Delft University of Technology, Delft, Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-8932-4703","affiliations":[{"raw_affiliation_string":"Delft University of Technology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5045164258"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":0.3408,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68884591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"50"},"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/T11424","display_name":"Security and Verification in Computing","score":0.9976000189781189,"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.9975000023841858,"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.8037480711936951},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7945535182952881},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.601172924041748},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5006852149963379},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.4395953416824341},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.43799978494644165},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.42070791125297546}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8037480711936951},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7945535182952881},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.601172924041748},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5006852149963379},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.4395953416824341},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.43799978494644165},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.42070791125297546}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3689945.3694808","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689945.3694808","pdf_url":null,"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 12th Workshop on Encrypted Computing &amp; Applied Homomorphic Cryptography","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3689945.3694808","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689945.3694808","pdf_url":null,"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 12th Workshop on Encrypted Computing &amp; Applied Homomorphic Cryptography","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2055580199","https://openalex.org/W2152926062","https://openalex.org/W2942255051","https://openalex.org/W3033581399","https://openalex.org/W3155680838","https://openalex.org/W3169419954","https://openalex.org/W3214408283","https://openalex.org/W4376626897","https://openalex.org/W4390214347"],"related_works":["https://openalex.org/W2069340834","https://openalex.org/W2002505081","https://openalex.org/W2083681681","https://openalex.org/W2550686250","https://openalex.org/W2577630842","https://openalex.org/W1172579163","https://openalex.org/W1488300410","https://openalex.org/W2138790427","https://openalex.org/W3146558274","https://openalex.org/W4246454774"],"abstract_inverted_index":{"In":[0],"the":[1,55,81,87,159,166,179,183,189,204,211,246,254,259,263,266],"past":[2],"decade,":[3],"tens":[4],"of":[5,113,182,241,256,265],"homomorphic":[6,23,68,94,195,237],"encryption":[7,24,69,95,196,238],"compilers":[8,19,73,101,115,142,176,200],"have":[9,80],"been":[10],"released,":[11],"and":[12,60,133,135],"there":[13],"are":[14,145,234],"good":[15],"reasons":[16],"for":[17,37,226,294],"these":[18,72,114,194],"to":[20,39,44,49,64,85,104,124,158,187,193],"exist.":[21],"Firstly,":[22],"is":[25,34,57,92,96,116,269],"a":[26,224,277],"powerful":[27],"secure":[28,45,107],"computation":[29,43,88,108],"technique":[30,56,225],"in":[31,165],"that":[32,93,117,143,154,233,251,282,290],"it":[33],"relatively":[35],"easy":[36],"parties":[38],"switch":[40],"from":[41],"plaintext":[42],"computations":[46,66],"when":[47],"compared":[48],"techniques":[50],"like":[51],"secret":[52],"sharing.":[53],"However,":[54,198],"mathematically":[58],"involved":[59],"requires":[61],"expert":[62],"knowledge":[63],"express":[65],"as":[67,129,206,230],"operations.":[70],"So,":[71],"support":[74],"users":[75,103,123],"who":[76],"might":[77],"otherwise":[78],"not":[79,121,284],"time":[82],"or":[83,161,279],"expertise":[84],"optimize":[86,105],"manually.":[89],"Another":[90],"reason":[91],"still":[97],"computationally":[98],"expensive,":[99],"so":[100],"allow":[102,122],"their":[106],"tasks.":[109],"One":[110],"major":[111],"shortcoming":[112],"they":[118,162,185,272],"often":[119],"do":[120,144],"use":[125],"high-level":[126,228],"primitives,":[127],"such":[128],"equality":[130],"checks,":[131],"comparisons,":[132],"AND":[134],"OR":[136],"operations":[137,232],"between":[138],"many":[139,170,199],"operands.":[140],"The":[141],"either":[146],"based":[147],"on":[148],"TFHE,":[149],"requiring":[150],"large":[151],"bootstrapping":[152,286],"keys":[153],"must":[155,177],"be":[156,274],"sent":[157],"evaluator,":[160],"only":[163,201],"work":[164],"Boolean":[167],"domain,":[168],"excluding":[169],"potentially":[171],"more":[172],"performant":[173],"circuits.":[174],"Moreover,":[175],"reduce":[178],"multiplicative":[180,260],"depth":[181,205,264],"circuits":[184,250,268],"generate":[186],"minimize":[188],"noise":[190],"growth":[191],"inherent":[192],"schemes.":[197],"consider":[202],"reducing":[203],"an":[207],"afterthought.":[208],"We":[209,288],"propose":[210],"Oraqle":[212],"compiler,":[213],"which":[214],"solves":[215],"both":[216],"problems":[217],"at":[218],"once":[219],"by":[220,236],"implementing":[221],"depth-aware":[222],"arithmetization,":[223],"expressing":[227],"primitives":[229],"arithmetic":[231],"executable":[235],"libraries.":[239],"Instead":[240],"generating":[242],"one":[243],"possible":[244],"circuit,":[245],"compiler":[247,292],"generates":[248],"multiple":[249],"trade":[252],"off":[253],"number":[255],"multiplications":[257],"with":[258],"depth.":[261],"If":[262],"resulting":[267],"low":[270],"enough,":[271],"may":[273],"evaluated":[275],"using":[276],"BFV":[278],"BGV":[280],"library":[281],"does":[283],"require":[285],"keys.":[287],"demonstrate":[289],"our":[291],"allows":[293],"significant":[295],"performance":[296],"gains.":[297]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}
