{"id":"https://openalex.org/W2155783532","doi":"https://doi.org/10.1145/2364527.2364556","title":"Efficient lookup-table protocol in secure multiparty computation","display_name":"Efficient lookup-table protocol in secure multiparty computation","publication_year":2012,"publication_date":"2012-09-09","ids":{"openalex":"https://openalex.org/W2155783532","doi":"https://doi.org/10.1145/2364527.2364556","mag":"2155783532"},"language":"en","primary_location":{"id":"doi:10.1145/2364527.2364556","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2364527.2364556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"},"type":"conference-paper","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/A5087115618","display_name":"John Launchbury","orcid":null},"institutions":[{"id":"https://openalex.org/I4210140281","display_name":"Galois (United States)","ror":"https://ror.org/03g8y8161","country_code":"US","type":"company","lineage":["https://openalex.org/I4210140281"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Launchbury","raw_affiliation_strings":["Galois, Inc., Portland, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Galois, Inc., Portland, OR, USA","institution_ids":["https://openalex.org/I4210140281"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078168035","display_name":"Iavor S. Diatchki","orcid":"https://orcid.org/0009-0000-7795-4708"},"institutions":[{"id":"https://openalex.org/I4210140281","display_name":"Galois (United States)","ror":"https://ror.org/03g8y8161","country_code":"US","type":"company","lineage":["https://openalex.org/I4210140281"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iavor S. Diatchki","raw_affiliation_strings":["Galois, Inc., Portland, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Galois, Inc., Portland, OR, USA","institution_ids":["https://openalex.org/I4210140281"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052180121","display_name":"Thomas Dubuisson","orcid":null},"institutions":[{"id":"https://openalex.org/I4210140281","display_name":"Galois (United States)","ror":"https://ror.org/03g8y8161","country_code":"US","type":"company","lineage":["https://openalex.org/I4210140281"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas DuBuisson","raw_affiliation_strings":["Galois, Inc., Portland, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Galois, Inc., Portland, OR, USA","institution_ids":["https://openalex.org/I4210140281"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007954294","display_name":"Andy Adams-Moran","orcid":null},"institutions":[{"id":"https://openalex.org/I4210140281","display_name":"Galois (United States)","ror":"https://ror.org/03g8y8161","country_code":"US","type":"company","lineage":["https://openalex.org/I4210140281"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andy Adams-Moran","raw_affiliation_strings":["Galois, Inc., Portland, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Galois, Inc., Portland, OR, USA","institution_ids":["https://openalex.org/I4210140281"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210140281"],"apc_list":null,"apc_paid":null,"fwci":4.9432,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.96289465,"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":"189","last_page":"200"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8453088998794556},{"id":"https://openalex.org/keywords/lookup-table","display_name":"Lookup table","score":0.6771867871284485},{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.6651812195777893},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.6531134843826294},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6226045489311218},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5925781726837158},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45852699875831604},{"id":"https://openalex.org/keywords/secure-two-party-computation","display_name":"Secure two-party computation","score":0.4243162274360657},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4046338200569153},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.38387608528137207},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3506515324115753},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.32471203804016113},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30028051137924194},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1157311499118805},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09199771285057068}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8453088998794556},{"id":"https://openalex.org/C134835016","wikidata":"https://www.wikidata.org/wiki/Q690265","display_name":"Lookup table","level":2,"score":0.6771867871284485},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.6651812195777893},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.6531134843826294},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6226045489311218},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5925781726837158},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45852699875831604},{"id":"https://openalex.org/C13652956","wikidata":"https://www.wikidata.org/wiki/Q7444883","display_name":"Secure two-party computation","level":4,"score":0.4243162274360657},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4046338200569153},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.38387608528137207},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3506515324115753},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.32471203804016113},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30028051137924194},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1157311499118805},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09199771285057068},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2364527.2364556","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2364527.2364556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.348.3965","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.3965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://corp.galois.com/storage/files/downloads/icfp47-launchbury.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W17575016","https://openalex.org/W120141331","https://openalex.org/W1480225633","https://openalex.org/W1485800369","https://openalex.org/W1489706603","https://openalex.org/W1521253015","https://openalex.org/W1566203915","https://openalex.org/W1595357546","https://openalex.org/W2013623332","https://openalex.org/W2031533839","https://openalex.org/W2088492763","https://openalex.org/W2119948977","https://openalex.org/W2128166167","https://openalex.org/W2145881907","https://openalex.org/W2244365024","https://openalex.org/W2296680289","https://openalex.org/W2498088693","https://openalex.org/W2998818221","https://openalex.org/W4238341678","https://openalex.org/W6641894941"],"related_works":["https://openalex.org/W2083701517","https://openalex.org/W2082804893","https://openalex.org/W2382527959","https://openalex.org/W87038205","https://openalex.org/W2539281752","https://openalex.org/W2550686250","https://openalex.org/W2069340834","https://openalex.org/W2166322483","https://openalex.org/W2125679084","https://openalex.org/W3152465837"],"abstract_inverted_index":{"Secure":[0],"multiparty":[1],"computation":[2,61],"(SMC)":[3],"permits":[4],"a":[5,11,72,100,107,116,132],"collection":[6],"of":[7,16,46,84,140,149,162],"parties":[8,18],"to":[9,79,103],"compute":[10],"collaborative":[12],"result,":[13],"without":[14],"any":[15,20],"the":[17,23,44,53,67,125,144,152],"gaining":[19],"knowledge":[21],"about":[22],"inputs":[24],"provided":[25],"by":[26,136,157],"other":[27,82],"parties.":[28,68],"Specifications":[29],"for":[30],"SMC":[31,93,147],"are":[32,52,77],"commonly":[33],"presented":[34],"as":[35,99,131],"boolean":[36],"circuits,":[37],"where":[38],"optimizations":[39],"come":[40],"mostly":[41],"from":[42],"reducing":[43],"number":[45],"multiply-operations":[47],"(including":[48],"and-gates)":[49],"-":[50],"these":[51],"operations":[54],"which":[55],"incur":[56],"significant":[57],"cost,":[58],"either":[59],"in":[60,64,115],"overhead":[62],"or":[63,111],"communication":[65],"between":[66],"Instead,":[69],"we":[70],"take":[71],"language-oriented":[73],"approach,":[74],"and":[75,90,135],"consequently":[76],"able":[78],"explore":[80],"many":[81],"kinds":[83,139],"optimizations.":[85],"We":[86,123],"present":[87],"an":[88,160],"efficient":[89],"general":[91],"purpose":[92],"table-lookup":[94],"algorithm":[95,129],"that":[96],"can":[97],"serve":[98],"direct":[101],"alternative":[102],"circuits.":[104],"Looking":[105],"up":[106],"private":[108],"(i.e.":[109],"shared,":[110],"encrypted)":[112],"n-bit":[113],"argument":[114],"public":[117],"table":[118],"requires":[119],"log(n)":[120],"parallel-and":[121],"operations.":[122],"use":[124],"advanced":[126],"encryption":[127],"standard":[128],"(AES)":[130],"driving":[133],"motivation,":[134],"introducing":[137],"different":[138],"parallelization":[141],"techniques,":[142],"produce":[143],"fastest":[145],"current":[146],"implementation":[148],"AES,":[150],"improving":[151],"best":[153],"previously":[154],"reported":[155],"results":[156],"well":[158],"over":[159],"order":[161],"magnitude.":[163]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}