{"id":"https://openalex.org/W2171328051","doi":"https://doi.org/10.1145/2517872.2517873","title":"Efficient secure computation optimization","display_name":"Efficient secure computation optimization","publication_year":2013,"publication_date":"2013-11-04","ids":{"openalex":"https://openalex.org/W2171328051","doi":"https://doi.org/10.1145/2517872.2517873","mag":"2171328051"},"language":"en","primary_location":{"id":"doi:10.1145/2517872.2517873","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2517872.2517873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies","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/A5002078632","display_name":"Raphael Urmoneit","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Raphael Urmoneit","raw_affiliation_strings":["Technische Universit\u00e4t Dresden, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102985450","display_name":"Florian Kerschbaum","orcid":"https://orcid.org/0000-0003-4288-2286"},"institutions":[{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Florian Kerschbaum","raw_affiliation_strings":["SAP, Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"SAP, Karlsruhe, Germany","institution_ids":["https://openalex.org/I4210119349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002078632"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1209953,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"18"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9986000061035156,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9965000152587891,"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/computation","display_name":"Computation","score":0.7512381076812744},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7372034192085266},{"id":"https://openalex.org/keywords/secure-two-party-computation","display_name":"Secure two-party computation","score":0.6779353618621826},{"id":"https://openalex.org/keywords/computational-resource","display_name":"Computational resource","score":0.5542390942573547},{"id":"https://openalex.org/keywords/key-schedule","display_name":"Key schedule","score":0.5411196947097778},{"id":"https://openalex.org/keywords/secure-multi-party-computation","display_name":"Secure multi-party computation","score":0.5118993520736694},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.501143217086792},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4921933710575104},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.4832090139389038},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44769537448883057},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.36566591262817383},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3591402471065521},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35863423347473145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26510554552078247},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1527315080165863},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07015714049339294}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7512381076812744},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7372034192085266},{"id":"https://openalex.org/C13652956","wikidata":"https://www.wikidata.org/wiki/Q7444883","display_name":"Secure two-party computation","level":4,"score":0.6779353618621826},{"id":"https://openalex.org/C127964446","wikidata":"https://www.wikidata.org/wiki/Q1092142","display_name":"Computational resource","level":3,"score":0.5542390942573547},{"id":"https://openalex.org/C112145980","wikidata":"https://www.wikidata.org/wiki/Q2569509","display_name":"Key schedule","level":5,"score":0.5411196947097778},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.5118993520736694},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.501143217086792},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4921933710575104},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4832090139389038},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44769537448883057},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.36566591262817383},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3591402471065521},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35863423347473145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26510554552078247},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1527315080165863},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07015714049339294},{"id":"https://openalex.org/C106544461","wikidata":"https://www.wikidata.org/wiki/Q543151","display_name":"Block cipher","level":3,"score":0.0},{"id":"https://openalex.org/C36123800","wikidata":"https://www.wikidata.org/wiki/Q1224471","display_name":"Differential cryptanalysis","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2517872.2517873","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2517872.2517873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W114088334","https://openalex.org/W121345474","https://openalex.org/W171045015","https://openalex.org/W173953576","https://openalex.org/W1480225633","https://openalex.org/W1485216661","https://openalex.org/W1485800369","https://openalex.org/W1521253015","https://openalex.org/W1578837377","https://openalex.org/W1595357546","https://openalex.org/W1725190037","https://openalex.org/W1768699187","https://openalex.org/W1826277484","https://openalex.org/W1982205631","https://openalex.org/W1984680759","https://openalex.org/W2001084165","https://openalex.org/W2004154155","https://openalex.org/W2007572995","https://openalex.org/W2013623332","https://openalex.org/W2039605106","https://openalex.org/W2044774739","https://openalex.org/W2073226520","https://openalex.org/W2092422002","https://openalex.org/W2099221302","https://openalex.org/W2106217851","https://openalex.org/W2118747942","https://openalex.org/W2119948977","https://openalex.org/W2124919972","https://openalex.org/W2126650182","https://openalex.org/W2132172731","https://openalex.org/W2134149606","https://openalex.org/W2134444889","https://openalex.org/W2138888883","https://openalex.org/W2148757108","https://openalex.org/W2156060381","https://openalex.org/W2165785801","https://openalex.org/W2166971704","https://openalex.org/W2233233025","https://openalex.org/W2405197481","https://openalex.org/W2506735936","https://openalex.org/W2914982603","https://openalex.org/W4388298802","https://openalex.org/W6628587945","https://openalex.org/W6637731140"],"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/W2171328051"],"abstract_inverted_index":{"Secure":[0,9],"computation":[1,10,56],"has":[2,17],"high":[3,18],"computational":[4,19],"resource":[5,20],"requirements":[6,21],"during":[7,22],"run-time.":[8],"optimization":[11,27,40,86],"can":[12,83],"lower":[13,67],"these":[14],"requirements,":[15],"but":[16],"compile-time.":[23],"This":[24],"prevents":[25],"automatic":[26,85],"of":[28,49,60,79],"most":[29],"larger":[30],"secure":[31,55],"computations.":[32],"In":[33],"this":[34],"paper":[35],"we":[36,66,82],"present":[37],"an":[38,77],"efficient":[39],"algorithm":[41,81],"that":[42],"does":[43],"no":[44],"longer":[45],"require":[46],"the":[47,68,92],"use":[48],"a":[50,54],"theorem":[51],"prover.":[52],"For":[53],"with":[57],"m":[58],"statements":[59,65],"which":[61],"n":[62],"are":[63],"branching":[64],"complexity":[69],"from":[70],"O(2^(2^n)":[71],"m)":[72],"to":[73,87],"O(m^5":[74],"2^n).":[75],"Using":[76],"implementation":[78],"our":[80],"extend":[84],"further":[88],"examples":[89],"such":[90],"as":[91],"AES":[93],"key":[94],"schedule.":[95]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}