{"id":"https://openalex.org/W7095517124","doi":null,"title":"Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently.","display_name":"Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently.","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W7095517124","mag":"2953097105"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.301.3847","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.3847","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/2013/073.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5058381634","display_name":"Marek Jawurek","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marek Jawurek","raw_affiliation_strings":["SAP, Karlsruhe, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SAP, Karlsruhe, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Florian Kerschbaum","orcid":"https://orcid.org/0000-0003-4288-2286","observed_orcids":["https://orcid.org/0000-0003-4288-2286"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Florian Kerschbaum","raw_affiliation_strings":["SAP, Karlsruhe, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4288-2286","affiliations":[{"raw_affiliation_string":"SAP, Karlsruhe, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Claudio Orlandi","orcid":"https://orcid.org/0000-0003-4992-0249","observed_orcids":["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":["Aarhus university;"],"raw_orcid":"https://orcid.org/0000-0003-4992-0249","affiliations":[{"raw_affiliation_string":"Aarhus university;","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4234,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.77772528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"2013","issue":null,"first_page":"73","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11504","display_name":"Advanced Authentication Protocols Security","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10020","display_name":"Quantum Information and Cryptography","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/zero-knowledge-proofs","display_name":"zero-knowledge proofs","score":0.9509999752044678},{"id":"https://openalex.org/keywords/garbled-circuits","display_name":"garbled circuits","score":0.9919999837875366},{"id":"https://openalex.org/keywords/secure-two-party-computation","display_name":"secure two-party computation","score":0.8519999980926514},{"id":"https://openalex.org/keywords/generic-language","display_name":"generic language","score":0.578000009059906},{"id":"https://openalex.org/keywords/active-security","display_name":"active security","score":0.656000018119812},{"id":"https://openalex.org/keywords/cut-and-choose","display_name":"cut-and-choose","score":0.6769999861717224}],"concepts":[{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.7638999819755554},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.722100019454956},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.7117000222206116},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.619700014591217},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.6150000095367432},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5928000211715698},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.5852000117301941},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5088000297546387},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4844000041484833},{"id":"https://openalex.org/C13652956","wikidata":"https://www.wikidata.org/wiki/Q7444883","display_name":"Secure two-party computation","level":4,"score":0.4706000089645386},{"id":"https://openalex.org/C53076038","wikidata":"https://www.wikidata.org/wiki/Q2915383","display_name":"Oblivious transfer","level":3,"score":0.44620001316070557},{"id":"https://openalex.org/C165751822","wikidata":"https://www.wikidata.org/wiki/Q7894118","display_name":"Universal composability","level":4,"score":0.4219000041484833},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.3294999897480011},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.3034000098705292},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.273499995470047},{"id":"https://openalex.org/C91399829","wikidata":"https://www.wikidata.org/wiki/Q1115684","display_name":"Commitment scheme","level":3,"score":0.272599995136261},{"id":"https://openalex.org/C133112747","wikidata":"https://www.wikidata.org/wiki/Q7251931","display_name":"Protocol analysis","level":2,"score":0.26649999618530273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2619999945163727},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25600001215934753}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.301.3847","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.3847","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/2013/073.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.400.7765","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.7765","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/2013/073.pdf","raw_type":"text"},{"id":"mag:2953097105","doi":null,"is_oa":false,"landing_page_url":"https://eprint.iacr.org/2013/073.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2764847869","display_name":"IACR Cryptology ePrint Archive","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":["https://openalex.org/P4322614454"],"host_organization_lineage_names":["Cryptology ePrint Archive"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IACR Cryptology ePrint Archive","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W4180724","https://openalex.org/W108539253","https://openalex.org/W111294696","https://openalex.org/W154916715","https://openalex.org/W172970726","https://openalex.org/W203353244","https://openalex.org/W1494641788","https://openalex.org/W1499934958","https://openalex.org/W1505629034","https://openalex.org/W1515669336","https://openalex.org/W1521730416","https://openalex.org/W1522706628","https://openalex.org/W1538440442","https://openalex.org/W1540469777","https://openalex.org/W1557386445","https://openalex.org/W1565128838","https://openalex.org/W1581111219","https://openalex.org/W1589034595","https://openalex.org/W1590713339","https://openalex.org/W1646354800","https://openalex.org/W1818243338","https://openalex.org/W1826277484","https://openalex.org/W1837551011","https://openalex.org/W1980227445","https://openalex.org/W1987890787","https://openalex.org/W1997859100","https://openalex.org/W2013623332","https://openalex.org/W2018746447","https://openalex.org/W2040168265","https://openalex.org/W2065265824","https://openalex.org/W2099058328","https://openalex.org/W2102632861","https://openalex.org/W2111276172","https://openalex.org/W2119948977","https://openalex.org/W2126484007","https://openalex.org/W2134340933","https://openalex.org/W2145009598","https://openalex.org/W2167236842","https://openalex.org/W2170696315","https://openalex.org/W2170988247","https://openalex.org/W2188232729","https://openalex.org/W2204895368","https://openalex.org/W2229572253","https://openalex.org/W2246792095","https://openalex.org/W3126049097"],"related_works":["https://openalex.org/W7099388114","https://openalex.org/W2953097105","https://openalex.org/W2058648304","https://openalex.org/W2950710903","https://openalex.org/W3198077156","https://openalex.org/W2793916198","https://openalex.org/W3030177624","https://openalex.org/W2145818182","https://openalex.org/W7098721731","https://openalex.org/W3196154141"],"abstract_inverted_index":{"Abstract.":[0],"Zero-knowledge":[1],"protocols":[2,43,66,127],"are":[3,26,45,131],"one":[4,181],"of":[5,60,102,142,162,175,207],"the":[6,58,103,172,187,203,220],"fundamental":[7],"concepts":[8],"in":[9,51,88,186],"modern":[10],"cryptography":[11],"and":[12,70,195],"have":[13],"countless":[14],"applications.":[15],"However,":[16],"after":[17],"more":[18],"than":[19],"30":[20],"years":[21],"from":[22],"their":[23],"introduction,":[24],"there":[25],"only":[27,180,198],"very":[28],"few":[29],"languages":[30,69],"(essentially":[31],"those":[32],"with":[33,217],"a":[34,73,115,140,214],"group":[35],"structure)":[36],"for":[37,67,83,114,128,149,171],"which":[38],"we":[39,56,71],"can":[40,153],"construct":[41,63,167],"zero-knowledge":[42,65,138,188],"that":[44,87,137],"efficient":[46,64,126,169],"enough":[47],"to":[48,62,95,98,156,166,219,223],"be":[49,96,154],"used":[50,155],"practice.":[52],"In":[53],"this":[54,129,163],"paper":[55,164],"address":[57],"problem":[59],"how":[61],"generic":[68,150],"propose":[72],"protocol":[74,148,170,191,226],"based":[75],"on":[76],"Yao\u2019s":[77,208,225],"garbled":[78,209],"circuit":[79,210],"technique.":[80],"The":[81,159,190],"motivation":[82],"our":[84],"work":[85],"is":[86,93,135,139,165,196,213],"many":[89],"cryptographic":[90],"applications":[91],"it":[92],"useful":[94],"able":[97],"prove":[99],"efficiently":[100],"statements":[101],"form":[104],"e.g.,":[105],"\u201cI":[106],"know":[107],"x":[108],"s.t.":[109],"y":[110,118],"=":[111],"SHA-256(x)":[112],"\u201d":[113,122],"common":[116],"input":[117,184],"(or":[119],"other":[120],"\u201cunstructured":[121],"languages),":[123],"but":[124],"no":[125],"task":[130],"currently":[132],"known.":[133],"It":[134],"clear":[136],"subset":[141],"secure":[143,151,176,205],"two-party":[144,177],"computation":[145,152,178],"(i.e.,":[146],"any":[147],"do":[157],"zero-knowledge).":[158],"main":[160],"contribution":[161],"an":[168],"special":[173],"case":[174],"where":[179],"party":[182],"has":[183],"(like":[185],"case).":[189],"achieves":[192],"active":[193],"security":[194],"essentially":[197],"twice":[199],"as":[200,202],"slow":[201],"passive":[204],"version":[206],"protocol.":[211],"This":[212],"great":[215],"improvement":[216],"respect":[218],"cut-n-choose":[221],"technique":[222],"make":[224],"actively":[227],"secure,":[228]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2025-10-27T00:00:00"}