{"id":"https://openalex.org/W3190538822","doi":"https://doi.org/10.1007/978-3-030-84259-8_4","title":"$$\\mathsf {Mac'n'Cheese}$$: Zero-Knowledge Proofs for\u00a0Boolean and Arithmetic Circuits with\u00a0Nested Disjunctions","display_name":"$$\\mathsf {Mac'n'Cheese}$$: Zero-Knowledge Proofs for\u00a0Boolean and Arithmetic Circuits with\u00a0Nested Disjunctions","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3190538822","doi":"https://doi.org/10.1007/978-3-030-84259-8_4","mag":"3190538822"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-84259-8_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-84259-8_4","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/9592ebc3-4893-4abf-a0c4-d3f63e35ff41","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083071294","display_name":"Carsten Baum","orcid":"https://orcid.org/0000-0001-7905-0198"},"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":true,"raw_author_name":"Carsten Baum","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012114683","display_name":"Alex J. Malozemoff","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":"Alex J. Malozemoff","raw_affiliation_strings":["Galois, Inc., Portland, USA"],"affiliations":[{"raw_affiliation_string":"Galois, Inc., Portland, USA","institution_ids":["https://openalex.org/I4210140281"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079829812","display_name":"Marc B. Rosen","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":"Marc B. Rosen","raw_affiliation_strings":["Galois, Inc., Portland, USA"],"affiliations":[{"raw_affiliation_string":"Galois, Inc., Portland, USA","institution_ids":["https://openalex.org/I4210140281"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018185386","display_name":"Peter Sch\u00f6ll","orcid":"https://orcid.org/0000-0002-7937-8422"},"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":"Peter Scholl","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083071294"],"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":17.2008,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.99526117,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"92","last_page":"122"},"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.9983999729156494,"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.9940000176429749,"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/zero-knowledge-proof","display_name":"Zero-knowledge proof","score":0.756402850151062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6830384731292725},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6044725775718689},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5199131369590759},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4956315755844116},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4930374324321747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4657467305660248},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.46368589997291565},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.4406730532646179},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4234449863433838},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.42294520139694214},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.4107629954814911},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38278520107269287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2963968515396118},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2788093090057373},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.231359601020813}],"concepts":[{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.756402850151062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6830384731292725},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6044725775718689},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5199131369590759},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4956315755844116},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4930374324321747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4657467305660248},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.46368589997291565},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.4406730532646179},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4234449863433838},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.42294520139694214},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.4107629954814911},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38278520107269287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2963968515396118},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2788093090057373},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.231359601020813},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-84259-8_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-84259-8_4","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/9592ebc3-4893-4abf-a0c4-d3f63e35ff41","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/9592ebc3-4893-4abf-a0c4-d3f63e35ff41","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Baum, C, Malozemoff, A J, Scholl, P & Rosen, M 2021, Mac\u2019n\u2019Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. in Advances in Cryptology \u2013 CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings : Proceedings. Springer, pp. 92-122, Annual International Cryptology Conference, 16/08/2021. https://doi.org/10.1007/978-3-030-84259-8_4","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/9592ebc3-4893-4abf-a0c4-d3f63e35ff41","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/9592ebc3-4893-4abf-a0c4-d3f63e35ff41","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Baum, C, Malozemoff, A J, Scholl, P & Rosen, M 2021, Mac\u2019n\u2019Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. in Advances in Cryptology \u2013 CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings : Proceedings. Springer, pp. 92-122, Annual International Cryptology Conference, 16/08/2021. https://doi.org/10.1007/978-3-030-84259-8_4","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":33,"referenced_works":["https://openalex.org/W780859780","https://openalex.org/W1524288918","https://openalex.org/W1582538828","https://openalex.org/W1589034595","https://openalex.org/W1984685443","https://openalex.org/W2027471022","https://openalex.org/W2043007983","https://openalex.org/W2058648304","https://openalex.org/W2102632861","https://openalex.org/W2133203144","https://openalex.org/W2171337840","https://openalex.org/W2173120240","https://openalex.org/W2536319456","https://openalex.org/W2539273492","https://openalex.org/W2765206040","https://openalex.org/W2810304253","https://openalex.org/W2811070514","https://openalex.org/W2890999648","https://openalex.org/W2898314371","https://openalex.org/W2952604022","https://openalex.org/W2968027060","https://openalex.org/W2968502565","https://openalex.org/W2969140724","https://openalex.org/W2986933415","https://openalex.org/W2990399857","https://openalex.org/W3012999251","https://openalex.org/W3028607946","https://openalex.org/W3198077156","https://openalex.org/W3203366266","https://openalex.org/W3203949919","https://openalex.org/W3214651532","https://openalex.org/W4245814547","https://openalex.org/W4308411105"],"related_works":["https://openalex.org/W2150974517","https://openalex.org/W2611822924","https://openalex.org/W2486254595","https://openalex.org/W2728195892","https://openalex.org/W3204916073","https://openalex.org/W2031906996","https://openalex.org/W2055594799","https://openalex.org/W2403507963","https://openalex.org/W1936629927","https://openalex.org/W1976822807"],"abstract_inverted_index":{"Zero":[0],"knowledge":[1],"proofs":[2,133],"are":[3],"an":[4,49,119],"important":[5],"building":[6],"block":[7],"in":[8,45,123,165,194,255],"many":[9,138],"cryptographic":[10],"applications.":[11],"Unfortunately,":[12],"when":[13,201,229],"the":[14,29,32,36,73,104,115,156,170,222,256],"proof":[15,22,52],"statements":[16,108,136],"become":[17],"very":[18],"large,":[19],"existing":[20],"zero-knowledge":[21,51],"systems":[23],"easily":[24],"reach":[25],"their":[26],"limits:":[27],"either":[28],"computational":[30],"overhead,":[31],"memory":[33],"footprint,":[34],"or":[35],"required":[37],"bandwidth":[38,213],"exceed":[39],"levels":[40,139],"that":[41,109,221],"would":[42],"be":[43,129],"tolerable":[44],"practice.":[46],"We":[47,90,142,167],"present":[48],"interactive":[50],"system":[53],"for":[54,102],"boolean":[55,232],"and":[56,159,176,186,211,237],"arithmetic":[57],"circuits,":[58],"called":[59],"$$\\mathsf":[60,148,174,245],"{Mac'n'Cheese}$$":[61,149,175,246],",":[62],"with":[63,97,137,160,206,234],"a":[64,98,152,162,178,204,207,212,231],"focus":[65],"on":[66,81],"supporting":[67],"large":[68],"circuits.":[69],"Our":[70],"work":[71],"follows":[72],"commit-and-prove":[74],"paradigm":[75],"instantiated":[76],"using":[77,155],"information-theoretic":[78],"MACs":[79],"based":[80],"vector":[82],"oblivious":[83],"linear":[84],"evaluation":[85],"to":[86,94,114,146,252],"achieve":[87,177],"high":[88],"efficiency.":[89],"additionally":[91],"show":[92,144,220],"how":[93,145],"optimize":[95],"disjunctions,":[96],"general":[99],"OR":[100],"transformation":[101],"proving":[103,230],"disjunction":[105,223],"of":[106,140,173,180,214],"m":[107],"has":[110],"communication":[111,226],"complexity":[112],"proportional":[113],"longest":[116],"statement":[117],"(plus":[118],"additive":[120],"term":[121],"logarithmic":[122],"m).":[124],"These":[125],"disjunctions":[126],"can":[127],"further":[128],"nested,":[130],"allowing":[131],"efficient":[132],"about":[134],"complex":[135],"disjunctions.":[141],"also":[143],"make":[147],"non-interactive":[150],"(after":[151],"preprocessing":[153],"phase)":[154],"Fiat-Shamir":[157],"transform,":[158],"only":[161,248],"small":[163],"degradation":[164],"soundness.":[166],"have":[168],"implemented":[169],"online":[171],"phase":[172],"runtime":[179],"144":[181],"ns":[182],"per":[183,191],"AND":[184],"gate":[185,193],"1.5":[187],"$$\\upmu":[188],"$$":[189,200],"s":[190],"multiplication":[192],"$$\\mathbb":[195],"{F}":[196],"_{2^{61}":[197],"-":[198],"1}":[199],"run":[202],"over":[203],"network":[205],"95":[208],"ms":[209],"latency":[210],"31.5":[215],"Mbps.":[216],"In":[217],"addition,":[218],"we":[219],"optimization":[224],"improves":[225],"as":[227],"expected:":[228],"circuit":[233],"eight":[235],"branches":[236],"each":[238],"branch":[239,258],"containing":[240],"roughly":[241],"1":[242],"billion":[243],"multiplications,":[244],"requires":[247],"75":[249],"more":[250],"bytes":[251],"communicate":[253],"than":[254],"single":[257],"case.":[259]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}