{"id":"https://openalex.org/W7128614501","doi":"https://doi.org/10.1109/focs63196.2025.00044","title":"Efficiently Batching Unambiguous Interactive Proofs","display_name":"Efficiently Batching Unambiguous Interactive Proofs","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7128614501","doi":"https://doi.org/10.1109/focs63196.2025.00044"},"language":null,"primary_location":{"id":"doi:10.1109/focs63196.2025.00044","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5109268199","display_name":"Berger Bonnie","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bonnie Berger","raw_affiliation_strings":["MIT,Cambridge,USA"],"affiliations":[{"raw_affiliation_string":"MIT,Cambridge,USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125654019","display_name":"Rohan Goyal","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rohan Goyal","raw_affiliation_strings":["MIT,Cambridge,USA"],"affiliations":[{"raw_affiliation_string":"MIT,Cambridge,USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074630179","display_name":"Matthew M. Hong","orcid":"https://orcid.org/0009-0003-0969-0140"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew M. Hong","raw_affiliation_strings":["MIT,Cambridge,USA"],"affiliations":[{"raw_affiliation_string":"MIT,Cambridge,USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"last","author":{"id":null,"display_name":"Yael Tauman Kalai","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yael Tauman Kalai","raw_affiliation_strings":["MIT,Cambridge,USA"],"affiliations":[{"raw_affiliation_string":"MIT,Cambridge,USA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5109268199"],"corresponding_institution_ids":["https://openalex.org/I4210110987"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.7639052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"818","last_page":"863"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8248000144958496,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8248000144958496,"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/T10237","display_name":"Cryptography and Data Security","score":0.0982000008225441,"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.0340999998152256,"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/corollary","display_name":"Corollary","score":0.746399998664856},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6754000186920166},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6098999977111816},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6075999736785889},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.5996000170707703},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5127999782562256},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49300000071525574},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4661000072956085},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44510000944137573}],"concepts":[{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.746399998664856},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6754000186920166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6234999895095825},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6098999977111816},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6075999736785889},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.5996000170707703},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5127999782562256},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4957999885082245},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49300000071525574},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4661000072956085},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4020000100135803},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.3946000039577484},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3707999885082245},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.36390000581741333},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.328000009059906},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32499998807907104},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.3075999915599823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.273499995470047},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.2718999981880188},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs63196.2025.00044","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs63196.2025.00044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320338440","display_name":"HORIZON EUROPE Health","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,125],"if":[3],"a":[4,8,19,113,120,127,190],"language":[5,28,144],"$\\mathcal{L}$":[6],"admits":[7],"public-coin":[9],"unambiguous":[10,44],"interactive":[11,45],"proof":[12,46,123,128,168],"(UIP)":[13],"with":[14,47],"round":[15,48],"complexity":[16,49,92],"$\\ell$,":[17],"where":[18],"bits":[20],"are":[21],"communicated":[22],"per":[23],"round,":[24],"then":[25],"the":[26,32,67,70,82,136,139,160,163],"batch":[27,85],"${\\mathcal{L}}^{\\otimes":[29,88],"k}$,":[30],"i.e.":[31],"set":[33],"of":[34,36,56,115,138,162,165],"k-tuples":[35],"statements":[37],"all":[38],"belonging":[39],"to":[40,79,171],"$\\mathcal{L}$,":[41],"has":[42,72],"an":[43],"$\\ell":[50],"\\cdot$":[51,60],"polylog":[52,61,76],"$(k)$,":[53],"per-round":[54],"communication":[55,91],"$a":[57],"\\cdot":[58,96],"\\ell":[59],"$(k)+$":[62],"poly":[63],"$(\\ell)$":[64],"bits,":[65],"assuming":[66],"verifier":[68],"in":[69,135,146,150,181,185],"UIP":[71,86],"depth":[73],"bounded":[74],"by":[75],"$(k)$.":[77],"Prior":[78],"this":[80],"work,":[81,173],"best":[83],"known":[84,177],"for":[87,102,142,178,189],"k}$":[89],"required":[90],"at":[93,152],"least":[94],"($\\operatorname{poly}(a)":[95],"k^{\\epsilon}+k$)":[97],"$\\cdot":[98],"\\ell^{1":[99],"/":[100],"\\epsilon}$":[101],"any":[103,143],"arbitrarily":[104],"small":[105,191],"constant":[106],"$\\epsilon\\gt":[107],"0$":[108,193],"(Reingold-Rothblum-Rothblum,":[109,198],"STOC":[110,199],"2016).":[111,200],"As":[112],"corollary":[114],"our":[116,172],"result,":[117],"we":[118],"obtain":[119],"doubly":[121,166],"efficient":[122,167],"system,":[124],"is,":[126],"system":[129],"whose":[130],"proving":[131],"overhead":[132],"is":[133],"polynomial":[134,147,182],"time":[137,151,186],"underlying":[140],"computation,":[141],"computable":[145,180],"space":[148,183],"and":[149,184],"most":[153],"$n^{O\\left(\\sqrt{\\frac{\\log":[154],"n}{\\log":[155],"\\log":[156],"n}}\\right)}$.":[157],"This":[158],"expands":[159],"state":[161],"art":[164],"systems:":[169],"prior":[170],"such":[174],"systems":[175],"were":[176],"languages":[179],"$n^{(\\log":[187],"n)^{\\delta}}$":[188],"$\\delta\\gt":[192],"significantly":[194],"smaller":[195],"than":[196],"1/2":[197]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-02-12T00:00:00"}