{"id":"https://openalex.org/W2573124892","doi":"https://doi.org/10.1137/16m1096773","title":"Constant-Round Interactive Proofs for Delegating Computation","display_name":"Constant-Round Interactive Proofs for Delegating Computation","publication_year":2019,"publication_date":"2019-10-24","ids":{"openalex":"https://openalex.org/W2573124892","doi":"https://doi.org/10.1137/16m1096773","mag":"2573124892"},"language":"en","primary_location":{"id":"doi:10.1137/16m1096773","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1096773","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5086367709","display_name":"Omer Reingold","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Omer Reingold","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Guy N. Rothblum","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guy N. Rothblum","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5057788395","display_name":"Guy N. Rothblum","orcid":"https://orcid.org/0000-0001-5273-6472"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ron D. Rothblum","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00444198,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"50","issue":"3","first_page":"STOC16","last_page":"255"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9847000241279602,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9847000241279602,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9757999777793884,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9681000113487244,"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.8430237174034119},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7107159495353699},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5576408505439758},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48980140686035156},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42528772354125977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34996500611305237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17297136783599854},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12784260511398315},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10293138027191162}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8430237174034119},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7107159495353699},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5576408505439758},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48980140686035156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42528772354125977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34996500611305237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17297136783599854},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12784260511398315},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10293138027191162}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/16m1096773","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1096773","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"mag:2573124892","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc23.html#ReingoldRR16","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2493648025","display_name":null,"funder_award_id":"CNS-1413920","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5158644365","display_name":null,"funder_award_id":"IBM-W911NF-15-C-0236","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G5260942991","display_name":null,"funder_award_id":"CNS-1523467","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1970056983","https://openalex.org/W1970278864","https://openalex.org/W1970606468","https://openalex.org/W1970630090","https://openalex.org/W1976493784","https://openalex.org/W1984685443","https://openalex.org/W2011112377","https://openalex.org/W2012045293","https://openalex.org/W2015880590","https://openalex.org/W2018925011","https://openalex.org/W2022381972","https://openalex.org/W2038202352","https://openalex.org/W2038691311","https://openalex.org/W2039677636","https://openalex.org/W2040438296","https://openalex.org/W2043820054","https://openalex.org/W2044199052","https://openalex.org/W2045717693","https://openalex.org/W2049516232","https://openalex.org/W2057512592","https://openalex.org/W2061662395","https://openalex.org/W2061680022","https://openalex.org/W2071520502","https://openalex.org/W2082647621","https://openalex.org/W2091434162","https://openalex.org/W2098843110","https://openalex.org/W2101230806","https://openalex.org/W2148957455","https://openalex.org/W2166670067","https://openalex.org/W2255673366","https://openalex.org/W2293988196","https://openalex.org/W2416431186","https://openalex.org/W2610313478","https://openalex.org/W2611754984"],"related_works":["https://openalex.org/W2071520502","https://openalex.org/W2936568636","https://openalex.org/W2257281123","https://openalex.org/W2038202352","https://openalex.org/W2092465525","https://openalex.org/W1987890787","https://openalex.org/W2085002016","https://openalex.org/W1814454000","https://openalex.org/W2384324714","https://openalex.org/W1622104893","https://openalex.org/W2131263204","https://openalex.org/W2117127586","https://openalex.org/W355315762","https://openalex.org/W2082727759","https://openalex.org/W2137883105","https://openalex.org/W2293988196","https://openalex.org/W1836725053","https://openalex.org/W2155279733","https://openalex.org/W1579287886","https://openalex.org/W1498051073"],"abstract_inverted_index":{"The":[0,52],"celebrated":[1],"${\\sf":[2],"IP}={\\sf":[3],"PSPACE}$":[4],"theorem":[5],"[Lund,":[6],"Fortnow,":[7],"Karloff,":[8],"and":[9,67,101,137,192,216,315],"Nisan,":[10],"J.":[11,18],"ACM,":[12,19],"39":[13,20],"(1992),":[14,21],"pp.":[15,22,321],"859--868;":[16],"Shamir,":[17],"869--877]":[23],"allows":[24],"an":[25,68,106,291,309],"all-powerful":[26],"but":[27],"untrusted":[28],"prover":[29,119,203,255],"to":[30,151,299],"convince":[31],"a":[32,61,144,257,276],"polynomial-time":[33,201],"verifier":[34,126,273],"of":[35,38,64,80,142,147,161,178,188,197,226,234,240,244,249,265,279,294,312,318],"the":[36,78,111,117,125,139,159,175,185,189,194,208,254,272,280,284],"validity":[37],"extremely":[39],"complicated":[40],"statements":[41],"(as":[42],"long":[43],"as":[44,290],"they":[45],"can":[46,95,220],"be":[47,96,221,239,288],"evaluated":[48,97],"using":[49],"polynomial":[50,62,99,122],"space).":[51],"interactive":[53,83,107,164,179,198,235,251,268,292,302],"proof":[54,84,108,285],"system":[55],"designed":[56],"for":[57,91,223],"this":[58,74,152],"purpose":[59],"requires":[60],"number":[63,146],"communication":[65,148],"rounds":[66],"exponential-time":[69],"(polynomial-space":[70],"complete)":[71],"prover.":[72],"In":[73],"paper,":[75],"we":[76,183,206],"study":[77],"power":[79,160,196],"more":[81],"efficient":[82],"systems.":[85],"Our":[86,228],"main":[87],"result":[88,170,212],"is":[89,127,247,263],"that":[90,94,109,248,264],"every":[92],"statement":[93],"in":[98,121,217,282,308],"time":[100,130,187],"bounded-polynomial":[102],"space":[103],"there":[104],"exists":[105],"satisfies":[110],"following":[112],"strict":[113],"efficiency":[114],"requirements:":[115],"(1)":[116],"honest":[118,190,202],"runs":[120],"time,":[123],"(2)":[124],"almost":[128],"linear":[129],"(and":[131],"under":[132],"some":[133],"conditions":[134],"even":[135],"sublinear),":[136],"(3)":[138],"interaction":[140],"consists":[141],"only":[143,274],"constant":[145],"rounds.":[149],"Prior":[150],"work,":[153],"very":[154],"little":[155],"was":[156,305],"known":[157],"about":[158],"efficient,":[162],"constant-round":[163],"proofs":[165,180,199,252,269],"(rather":[166],"than":[167],"arguments).":[168],"This":[169,211],"represents":[171],"significant":[172],"progress":[173],"on":[174,193],"round":[176,209],"complexity":[177],"(even":[181,204],"if":[182,205],"ignore":[184,207],"running":[186],"prover)":[191],"expressive":[195],"with":[200],"complexity).":[210],"has":[213,256],"several":[214,231],"applications,":[215],"particular":[218],"it":[219],"used":[222],"verifiable":[224],"delegation":[225],"computation.":[227],"construction":[229],"leverages":[230],"new":[232],"notions":[233,246],"proofs,":[236,304],"which":[237],"may":[238],"independent":[241,310],"interest.":[242],"One":[243],"these":[245],"unambiguous":[250],"where":[253,271],"unique":[258],"successful":[259],"strategy.":[260],"Another":[261],"notion":[262,298],"probabilistically":[266],"checkable":[267],"($\\mathsf{PCIP}$s),":[270],"reads":[275],"few":[277],"bits":[278],"transcript":[281],"checking":[283],"(this":[286],"could":[287],"viewed":[289],"extension":[293],"$\\mathsf{PCIP}$s).":[295],"An":[296],"equivalent":[297],"$\\mathsf{PCIP}$s,":[300],"called":[301],"oracle":[303],"recently":[306],"introduced":[307],"work":[311],"Ben-Sasson,":[313],"Chiesa,":[314],"Sponcer":[316],"[Proceedings":[317],"TCC,":[319],"2016,":[320],"31--60].":[322]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}