{"id":"https://openalex.org/W2984726114","doi":"https://doi.org/10.1145/3319535.3354251","title":"Efficient Zero-Knowledge Arguments in the Discrete Log Setting, Revisited","display_name":"Efficient Zero-Knowledge Arguments in the Discrete Log Setting, Revisited","publication_year":2019,"publication_date":"2019-11-06","ids":{"openalex":"https://openalex.org/W2984726114","doi":"https://doi.org/10.1145/3319535.3354251","mag":"2984726114"},"language":"en","primary_location":{"id":"doi:10.1145/3319535.3354251","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3319535.3354251","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://orbilu.uni.lu/handle/10993/50224","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091246257","display_name":"Max Hoffmann","orcid":"https://orcid.org/0000-0002-0678-8631"},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Max Hoffmann","raw_affiliation_strings":["Ruhr-University Bochum, Bochum, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ruhr-University Bochum, Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083460988","display_name":"Michael Kloo\u00df","orcid":"https://orcid.org/0000-0003-3466-0675"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Kloo\u00df","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047549684","display_name":"Andy Rupp","orcid":"https://orcid.org/0000-0003-0439-3633"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andy Rupp","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8588,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.9002263,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2093","last_page":"2110"},"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/T10270","display_name":"Blockchain Technology Applications and Security","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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/gas-meter-prover","display_name":"Gas meter prover","score":0.7085661888122559},{"id":"https://openalex.org/keywords/discrete-logarithm","display_name":"Discrete logarithm","score":0.7045656442642212},{"id":"https://openalex.org/keywords/zero-knowledge-proof","display_name":"Zero-knowledge proof","score":0.682352602481842},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6531331539154053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5715120434761047},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5048308968544006},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47129976749420166},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4565964639186859},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.449226051568985},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.4414397180080414},{"id":"https://openalex.org/keywords/security-parameter","display_name":"Security parameter","score":0.4277762770652771},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4010031521320343},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39118969440460205},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3079725205898285},{"id":"https://openalex.org/keywords/public-key-cryptography","display_name":"Public-key cryptography","score":0.13925886154174805}],"concepts":[{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.7085661888122559},{"id":"https://openalex.org/C173259116","wikidata":"https://www.wikidata.org/wiki/Q864003","display_name":"Discrete logarithm","level":4,"score":0.7045656442642212},{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.682352602481842},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6531331539154053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5715120434761047},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5048308968544006},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47129976749420166},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4565964639186859},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.449226051568985},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4414397180080414},{"id":"https://openalex.org/C2776711565","wikidata":"https://www.wikidata.org/wiki/Q7445058","display_name":"Security parameter","level":3,"score":0.4277762770652771},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4010031521320343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39118969440460205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3079725205898285},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.13925886154174805},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3319535.3354251","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3319535.3354251","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},{"id":"pmh:oai:orbilu.uni.lu:10993/50224","is_oa":true,"landing_page_url":"http://orbilu.uni.lu/handle/10993/50224","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, November 11-15, 2019, 2093--2110 (2019); ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, November 11-15, 2019","raw_type":"http://purl.org/coar/resource_type/c_5794"}],"best_oa_location":{"id":"pmh:oai:orbilu.uni.lu:10993/50224","is_oa":true,"landing_page_url":"http://orbilu.uni.lu/handle/10993/50224","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, November 11-15, 2019, 2093--2110 (2019); ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, November 11-15, 2019","raw_type":"http://purl.org/coar/resource_type/c_5794"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.41999998688697815}],"awards":[{"id":"https://openalex.org/G7474119782","display_name":null,"funder_award_id":"RU 1664/3-1, PA 587/10-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W4180724","https://openalex.org/W62648631","https://openalex.org/W111294696","https://openalex.org/W112550803","https://openalex.org/W627891592","https://openalex.org/W945570858","https://openalex.org/W1582538828","https://openalex.org/W1993242942","https://openalex.org/W2100705134","https://openalex.org/W2143374261","https://openalex.org/W2171337840","https://openalex.org/W2255948324","https://openalex.org/W2394843291","https://openalex.org/W2396888528","https://openalex.org/W2473389213","https://openalex.org/W2496543269","https://openalex.org/W2551629986","https://openalex.org/W2765206040","https://openalex.org/W2882986534","https://openalex.org/W2883585522","https://openalex.org/W2899867281","https://openalex.org/W2900186171","https://openalex.org/W2907646414","https://openalex.org/W2984726114","https://openalex.org/W4210966189"],"related_works":["https://openalex.org/W2950202488","https://openalex.org/W1970588133","https://openalex.org/W1567449721","https://openalex.org/W2392770010","https://openalex.org/W4290692443","https://openalex.org/W2028963818","https://openalex.org/W2129086113","https://openalex.org/W3112610909","https://openalex.org/W2229416443","https://openalex.org/W2146325043"],"abstract_inverted_index":{"Zero-knowledge":[0],"arguments":[1,78],"have":[2],"become":[3],"practical,":[4],"and":[5,31,85],"widely":[6],"used,":[7],"especially":[8],"in":[9,16,23,44,148,196],"the":[10,24,49,75,128,133,149,210,227],"world":[11],"of":[12,52,74,106,109,130,212,229],"Blockchain,":[13],"for":[14,104,160],"example":[15],"Zcash.":[17],"This":[18,125,156],"work":[19,135],"revisits":[20],"zero-knowledge":[21,60,72],"proofs":[22,43],"discrete":[25],"logarithm":[26],"setting.":[27,46,155],"First,":[28],"we":[29,67,115,200],"identify":[30],"carve":[32],"out":[33],"basic":[34],"techniques":[35],"(partly":[36],"being":[37],"used":[38,195],"implicitly":[39],"before)":[40],"to":[41,58,70,119,127,222],"optimise":[42],"this":[45],"In":[47],"particular,":[48],"linear":[50,153],"combination":[51],"protocols":[53,180],"is":[54],"a":[55,99,107,145,202],"useful":[56],"tool":[57],"obtain":[59],"and/or":[61],"reduce":[62],"communication.":[63],"With":[64],"these":[65],"techniques,":[66],"are":[68,116,144,181],"able":[69],"devise":[71],"variants":[73],"logarithmic":[76,188],"communication":[77],"by":[79],"Bootle":[80],"et":[81,87],"al.":[82,88],"(EUROCRYPT":[83],"'16)":[84],"B\u00fcnz":[86],"(S&P":[89],"'18)":[90],"thereby":[91],"introducing":[92],"almost":[93],"no":[94],"overhead.":[95],"We":[96,183,215],"then":[97],"construct":[98,185],"conceptually":[100],"simple":[101],"commit-and-prove":[102],"argument":[103],"satisfiability":[105],"set":[108],"quadratic":[110,139,177],"equations.":[111],"Unlike":[112],"previous":[113],"work,":[114],"not":[117,141],"restricted":[118],"rank":[120],"1":[121],"constraint":[122],"systems":[123],"(R1CS).":[124],"is,":[126],"best":[129],"our":[131],"knowledge,":[132],"first":[134],"demonstrating":[136],"that":[137],"general":[138],"constraints,":[140],"just":[142],"R1CS,":[143],"natural":[146],"relation":[147],"dlog":[150],"(or":[151],"ideal":[152],"commitment)":[154],"enables":[157],"new":[158],"possibilities":[159],"optimisation,":[161],"as,":[162],"eg.,":[163],"any":[164],"degree":[165],"n2":[166],"polynomial":[167],"f(X)":[168],"can":[169,193],"now":[170],"be":[171,194],"\"evaluated\"":[172],"with":[173],"at":[174,205],"most":[175],"2n":[176],"constraints.":[178],"Our":[179],"modular.":[182],"easily":[184],"an":[186,213,230],"efficient,":[187],"size":[189],"shuffle":[190],"proof,":[191],"which":[192,219],"electronic":[197],"voting.":[198],"Additionally,":[199],"take":[201],"closer":[203],"look":[204],"quantitative":[206],"security":[207],"measures,":[208],"eg.":[209],"efficiency":[211,228],"extractor.":[214,231],"formalise":[216],"short-circuit":[217],"extraction,":[218],"allows":[220],"us":[221],"give":[223],"tighter":[224],"bounds":[225],"on":[226]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}