{"id":"https://openalex.org/W1485205386","doi":"https://doi.org/10.1007/978-3-642-36594-2_35","title":"Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing","display_name":"Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1485205386","doi":"https://doi.org/10.1007/978-3-642-36594-2_35","mag":"1485205386"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-36594-2_35","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-36594-2_35","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://eprint.iacr.org/2012/512.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079826922","display_name":"Ivan Damg\u00e5rd","orcid":"https://orcid.org/0009-0003-6164-0896"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Ivan Damg\u00e5rd","raw_affiliation_strings":["Dept. of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001901089","display_name":"Sarah Zakarias","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Sarah Zakarias","raw_affiliation_strings":["Dept. of Computer Science, Aarhus University, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":16.6008,"has_fulltext":true,"cited_by_count":98,"citation_normalized_percentile":{"value":0.99373596,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"621","last_page":"641"},"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.9988999962806702,"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/T11797","display_name":"graph theory and CDMA systems","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7870280146598816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7701748609542847},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.7378467917442322},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6144716739654541},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5821537971496582},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5569590330123901},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.5134097337722778},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5011754035949707},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.45495903491973877},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.43497171998023987},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4075353443622589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1837567687034607},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.17031073570251465},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1316816210746765}],"concepts":[{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.7870280146598816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7701748609542847},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.7378467917442322},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6144716739654541},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5821537971496582},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5569590330123901},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.5134097337722778},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5011754035949707},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.45495903491973877},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.43497171998023987},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4075353443622589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1837567687034607},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.17031073570251465},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1316816210746765},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/978-3-642-36594-2_35","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-36594-2_35","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/0bab895e-853d-4370-9220-c6e616c3bf23","is_oa":true,"landing_page_url":"http://eprint.iacr.org/2012/512","pdf_url":"https://eprint.iacr.org/2012/512.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Damg\u00e5rd, I B & Zakarias, S N H 2012 'Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing' Cryptology ePrint Archive. < http://eprint.iacr.org/2012/512 >","raw_type":"info:eu-repo/semantics/workingPaper"},{"id":"mag:3124251472","is_oa":false,"landing_page_url":"https://eprint.iacr.org/2012/512.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.258.9016","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.258.9016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprint.iacr.org/2012/512.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.303.4862","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.4862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprint.iacr.org/2012/512.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.400.5616","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.5616","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://eprint.iacr.org/2012/512.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/38be2b50-ade5-43ab-ad25-353155c58f69","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/38be2b50-ade5-43ab-ad25-353155c58f69","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Damg\u00e5rd, I B & Zakarias, S 2013, Constant-overhead secure computation of Boolean circuits using preprocessing. in A Sahai (ed.), Theory of Cryptography : 10th TCC 2013. Proceedings. Springer VS, Lecture Notes in Computer Science, vol. 7785 , pp. 621-641, Theory of Cryptography Conference, Tokyo, Japan, 03/03/2013. https://doi.org/10.1007/978-3-642-36594-2_35","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/0bab895e-853d-4370-9220-c6e616c3bf23","is_oa":true,"landing_page_url":"http://eprint.iacr.org/2012/512","pdf_url":"https://eprint.iacr.org/2012/512.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Damg\u00e5rd, I B & Zakarias, S N H 2012 'Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing' Cryptology ePrint Archive. < http://eprint.iacr.org/2012/512 >","raw_type":"info:eu-repo/semantics/workingPaper"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1485205386.pdf","grobid_xml":"https://content.openalex.org/works/W1485205386.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W20180677","https://openalex.org/W47137029","https://openalex.org/W1485205386","https://openalex.org/W1494774797","https://openalex.org/W1499934958","https://openalex.org/W1505629034","https://openalex.org/W1574373886","https://openalex.org/W1755636270","https://openalex.org/W2019807548","https://openalex.org/W2090190190","https://openalex.org/W2103012681","https://openalex.org/W2113085788","https://openalex.org/W2135393523","https://openalex.org/W2170763591","https://openalex.org/W2399159325","https://openalex.org/W2402235285","https://openalex.org/W3030551544","https://openalex.org/W4233413206"],"related_works":["https://openalex.org/W1976822807","https://openalex.org/W1991822629","https://openalex.org/W2728195892","https://openalex.org/W2055594799","https://openalex.org/W3204916073","https://openalex.org/W2031906996","https://openalex.org/W1501085929","https://openalex.org/W2724189404","https://openalex.org/W2611822924","https://openalex.org/W2504025942"],"abstract_inverted_index":{"We":[0,92],"present":[1],"a":[2,7,14,25,35,57,95],"protocol":[3,20,61],"for":[4,42,69,98],"securely":[5],"computing":[6,49],"Boolean":[8,70,103],"circuit":[9,51],"C":[10],"in":[11,52,105],"presence":[12],"of":[13,38,102],"dishonest":[15],"and":[16],"malicious":[17],"majority.":[18],"The":[19],"is":[21,29,45,62],"unconditionally":[22],"secure,":[23],"assuming":[24],"preprocessing":[26],"functionality":[27],"that":[28],"not":[30],"given":[31],"the":[32,40,46,50,53,63,73,100],"inputs.":[33],"For":[34],"large":[36],"number":[37],"players":[39],"work":[41],"each":[43],"player":[44],"same":[47],"as":[48],"clear,":[54],"up":[55],"to":[56,65],"constant":[58,118],"factor.":[59],"Our":[60],"first":[64],"obtain":[66],"these":[67],"properties":[68],"circuits.":[71],"On":[72],"technical":[74],"side,":[75],"we":[76],"develop":[77],"new":[78,96],"homomorphic":[79],"authentication":[80],"schemes":[81],"based":[82],"on":[83],"asymptotically":[84],"good":[85],"codes":[86],"with":[87,108],"an":[88],"additional":[89],"multiplication":[90],"property.":[91],"also":[93],"show":[94],"algorithm":[97],"verifying":[99],"product":[101],"matrices":[104],"quadratic":[106],"time":[107],"exponentially":[109],"small":[110],"error":[111],"probability,":[112],"where":[113],"previous":[114],"methods":[115],"only":[116],"achieved":[117],"error.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}