{"id":"https://openalex.org/W6948080362","doi":"https://doi.org/10.4230/lipics.icalp.2025.56","title":"Boosting SNARKs and Rate-1 Barrier in Arguments of Knowledge","display_name":"Boosting SNARKs and Rate-1 Barrier in Arguments of Knowledge","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6948080362","doi":"https://doi.org/10.4230/lipics.icalp.2025.56"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23433","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.56","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.56/LIPIcs.ICALP.2025.56.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.56/LIPIcs.ICALP.2025.56.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Cheng, Jiaqi","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cheng, Jiaqi","raw_affiliation_strings":["University of Wisconsin - Madison, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin - Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":null,"display_name":"Goyal, Rishab","orcid":"https://orcid.org/0009-0005-9960-7287"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Goyal, Rishab","raw_affiliation_strings":["University of Wisconsin - Madison, WI, USA"],"raw_orcid":"https://orcid.org/0009-0005-9960-7287","affiliations":[{"raw_affiliation_string":"University of Wisconsin - Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18102092,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"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.4072999954223633,"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.4072999954223633,"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/T10126","display_name":"Logic, programming, and type systems","score":0.23420000076293945,"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/T11424","display_name":"Security and Verification in Computing","score":0.15139999985694885,"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/mathematical-proof","display_name":"Mathematical proof","score":0.7558000087738037},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.6582000255584717},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.43380001187324524},{"id":"https://openalex.org/keywords/upgrade","display_name":"Upgrade","score":0.4318999946117401},{"id":"https://openalex.org/keywords/zero-knowledge-proof","display_name":"Zero-knowledge proof","score":0.42980000376701355},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.41440001130104065}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7558000087738037},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.6582000255584717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5320000052452087},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.460999995470047},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.438400000333786},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.43380001187324524},{"id":"https://openalex.org/C2780615140","wikidata":"https://www.wikidata.org/wiki/Q920419","display_name":"Upgrade","level":2,"score":0.4318999946117401},{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.42980000376701355},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.41440001130104065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41100001335144043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3109999895095825},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.2630000114440918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.259799987077713}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23433","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.56","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.56/LIPIcs.ICALP.2025.56.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2025.56","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2025.56","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23433","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.56","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.56/LIPIcs.ICALP.2025.56.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W6948080362.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"design":[1,102],"a":[2,46],"generic":[3],"compiler":[4],"to":[5,15,45,91,101,136,172],"boost":[6],"any":[7,26,31,93,120,167],"non-trivial":[8,94],"succinct":[9,48,104,134,175],"non-interactive":[10],"argument":[11],"of":[12,68,110,131,139,150,153],"knowledge":[13,84,140,154],"(SNARK)":[14],"full":[16],"succinctness.":[17],"Our":[18,125],"results":[19],"come":[20],"in":[21,65],"two":[22],"flavors:":[23],"1)":[24],"For":[25,96],"constant":[27,121],"\u03b5":[28,122],">":[29,123],"0,":[30],"SNARK":[32,79],"with":[33,108],"proof":[34],"size":[35],"|\u03c0|":[36],"<":[37],"|\u03c9|/(\u03bb^\u03b5)":[38],"+":[39,117],"poly(\u03bb,":[40,118],"|x|)":[41],"can":[42],"be":[43],"upgraded":[44],"fully":[47,103,133,174],"SNARK,":[49],"where":[50],"all":[51],"system":[52],"parameters":[53],"(such":[54,155],"as":[55,62,81,156],"proof/CRS":[56],"sizes":[57],"and":[58,160,165],"setup/verifier":[59],"run-times)":[60],"grow":[61],"fixed":[63],"polynomials":[64],"\u03bb,":[66],"independent":[67],"witness":[69],"size.":[70],"2)":[71],"Under":[72],"an":[73,82],"additional":[74],"assumption":[75],"that":[76,141],"the":[77,128,143],"underlying":[78],"has":[80],"efficient":[83],"extractor,":[85],"we":[86,98],"further":[87,168],"improve":[88],"our":[89],"result":[90,126],"upgrade":[92],"SNARK.":[95],"example,":[97],"show":[99],"how":[100],"SNARKs":[105,107,135],"from":[106],"proofs":[109],"length":[111],"|\u03c9|":[112],"-":[113],"\u03a9(\u03bb),":[114],"or":[115],"|\u03c9|/(1+\u03b5)":[116],"|x|),":[119],"0.":[124],"reduces":[127],"long-standing":[129],"challenge":[130],"designing":[132,137,173],"arguments":[138,152],"beat":[142],"trivial":[144],"construction.":[145],"It":[146],"also":[147],"establishes":[148],"optimality":[149],"rate-1":[151],"NIZKs":[157],"[Gentry-Groth-Ishai-Peikert-Sahai-Smith;":[158],"JoC'15]":[159],"BARGs":[161],"[Devadas-Goyal-Kalai-Vaikuntanathan,":[162],"Paneth-Pass;":[163],"FOCS'22]),":[164],"suggests":[166],"improvement":[169],"is":[170],"tantamount":[171],"SNARKs,":[176],"thus":[177],"requires":[178],"bypassing":[179],"established":[180],"black-box":[181],"barriers":[182],"[Gentry-Wichs;":[183],"STOC'11].":[184]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}