{"id":"https://openalex.org/W2965911077","doi":"https://doi.org/10.1007/978-3-030-35199-1_8","title":"Commodity-Based 2PC for Arithmetic Circuits","display_name":"Commodity-Based 2PC for Arithmetic Circuits","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2965911077","doi":"https://doi.org/10.1007/978-3-030-35199-1_8","mag":"2965911077"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-35199-1_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-35199-1_8","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://pure.au.dk/portal/en/publications/586f5582-84c7-4cd9-a42b-a0d3368a3b64","any_repository_has_fulltext":true},"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":["Department of Computer Science, DIGIT, Aarhus University, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, DIGIT, Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049505574","display_name":"Helene Haagh","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":"Helene Haagh","raw_affiliation_strings":["Department of Computer Science, DIGIT, Aarhus University, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, DIGIT, Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085565542","display_name":"Michael B. Nielsen","orcid":"https://orcid.org/0000-0001-7676-7054"},"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":"Michael Nielsen","raw_affiliation_strings":["Department of Computer Science, DIGIT, Aarhus University, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, DIGIT, Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028570693","display_name":"Claudio Orlandi","orcid":"https://orcid.org/0000-0003-4992-0249"},"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":"Claudio Orlandi","raw_affiliation_strings":["Department of Computer Science, DIGIT, Aarhus University, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, DIGIT, Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.8269,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75554783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"154","last_page":"177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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.9998000264167786,"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.9990000128746033,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9984999895095825,"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/computer-science","display_name":"Computer science","score":0.833535373210907},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.6594768762588501},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4417757987976074},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38403400778770447},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.34532538056373596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3200072944164276},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14756488800048828}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.833535373210907},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.6594768762588501},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4417757987976074},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38403400778770447},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.34532538056373596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3200072944164276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14756488800048828}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-35199-1_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-35199-1_8","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:openaire/586f5582-84c7-4cd9-a42b-a0d3368a3b64","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/586f5582-84c7-4cd9-a42b-a0d3368a3b64","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Damg\u00e5rd, I, Haagh, H, Nielsen, M & Orlandi, C 2019, Commodity-Based 2PC for Arithmetic Circuits. in M Albrecht (ed.), Cryptography and Coding - 17th IMA International Conference, IMACC 2019, Proceedings. Springer, Lecture Notes in Computer Science, vol. 11929, pp. 154-177, 17th IMA International Conference on Cryptography and Coding, IMACC 2019, Oxford, United Kingdom, 16/12/2019. https://doi.org/10.1007/978-3-030-35199-1_8","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/586f5582-84c7-4cd9-a42b-a0d3368a3b64","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85077006127&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Damg\u00e5rd, I, Haagh, H, Nielsen, M & Orlandi, C 2019, Commodity-Based 2PC for Arithmetic Circuits. in M Albrecht (ed.), Cryptography and Coding - 17th IMA International Conference, IMACC 2019, Proceedings. Springer, Lecture Notes in Computer Science, vol. 11929, pp. 154-177, 17th IMA International Conference on Cryptography and Coding, IMACC 2019, Oxford, United Kingdom, 16/12/2019. https://doi.org/10.1007/978-3-030-35199-1_8","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/586f5582-84c7-4cd9-a42b-a0d3368a3b64","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/586f5582-84c7-4cd9-a42b-a0d3368a3b64","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Damg\u00e5rd, I, Haagh, H, Nielsen, M & Orlandi, C 2019, Commodity-Based 2PC for Arithmetic Circuits. in M Albrecht (ed.), Cryptography and Coding - 17th IMA International Conference, IMACC 2019, Proceedings. Springer, Lecture Notes in Computer Science, vol. 11929, pp. 154-177, 17th IMA International Conference on Cryptography and Coding, IMACC 2019, Oxford, United Kingdom, 16/12/2019. https://doi.org/10.1007/978-3-030-35199-1_8","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W20180677","https://openalex.org/W1485800369","https://openalex.org/W1487501992","https://openalex.org/W1499934958","https://openalex.org/W1595357546","https://openalex.org/W2010317729","https://openalex.org/W2010989618","https://openalex.org/W2017464959","https://openalex.org/W2073782860","https://openalex.org/W2119422255","https://openalex.org/W2164987725","https://openalex.org/W2539273492","https://openalex.org/W2739769990","https://openalex.org/W2767035167","https://openalex.org/W2794685135","https://openalex.org/W2890999648"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W4409439182","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2062023542"],"abstract_inverted_index":{"We":[0,26,93,152],"revisit":[1],"the":[2,16,28,32,59,73,77,90,113,132,147,161],"framework":[3,17],"of":[4,30,43,47,76,105,112,136,143,160,172],"Commodity-based":[5],"Cryptography":[6],"presented":[7],"by":[8,187],"Beaver":[9,80],"(STOC\u201997)":[10],"with":[11,20,36,54,86],"a":[12,37,41,101,109,140,173,191],"focus":[13],"on":[14,95,155],"updating":[15],"to":[18,83,169],"fit":[19],"modern":[21],"multiparty":[22],"computation":[23],"(MPC)":[24],"protocols.":[25],"study":[27],"possibility":[29],"replacing":[31],"well-known":[33],"preprocessing":[34],"model":[35,102],"commodity-based":[38],"setting,":[39],"where":[40,103,177],"set":[42],"independent":[44],"servers":[45,114,178],"(some":[46],"which":[48],"may":[49,115],"be":[50,116,184],"corrupt)":[51],"provide":[52],"clients":[53,60,107],"correlated":[55,66],"randomness.":[56],"From":[57],"this,":[58],"then":[61],"distill":[62],"correct":[63],"and":[64,108,125,182],"secure":[65,122],"randomness":[67],"that":[68,131],"they":[69],"can":[70,183],"use":[71],"during":[72],"online":[74],"phase":[75],"MPC":[78],"protocol.":[79,163],"showed":[81],"how":[82],"do":[84],"OT":[85],"semi-honest":[87],"security":[88],"in":[89],"commodity":[91,174],"setting.":[92],"improve":[94],"Beaver\u2019s":[96],"result":[97],"as":[98],"follows:":[99],"In":[100],"one":[104,137],"two":[106],"constant":[110,141],"fraction":[111],"maliciously":[117,192],"corrupted,":[118],"we":[119,165],"obtain":[120],"unconditionally":[121],"multiplication":[123],"triples":[124],"oblivious":[126],"linear":[127],"evaluations":[128],"(OLEs)":[129],"such":[130],"amortized":[133],"communication":[134],"cost":[135],"triple/OLE":[138],"is":[139,149],"number":[142],"field":[144,148],"elements":[145],"(when":[146],"sufficiently":[150],"large).":[151],"also":[153],"report":[154],"results":[156],"from":[157],"an":[158,167],"implementation":[159],"OLE":[162],"Finally,":[164],"suggest":[166],"approach":[168],"practical":[170],"realization":[171],"based":[175],"system":[176],"need":[179],"no":[180],"memory":[181],"accessed":[185],"asynchronously":[186],"clients,":[188],"but":[189],"still":[190],"corrupt":[193],"client":[194],"cannot":[195],"get":[196],"data":[197],"he":[198],"should":[199],"not":[200],"have":[201],"access":[202],"to.":[203]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}