{"id":"https://openalex.org/W2010873187","doi":"https://doi.org/10.1145/1250790.1250855","title":"Verifying and decoding in constant depth","display_name":"Verifying and decoding in constant depth","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W2010873187","doi":"https://doi.org/10.1145/1250790.1250855","mag":"2010873187"},"language":"en","primary_location":{"id":"doi:10.1145/1250790.1250855","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250855","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5110776230","display_name":"Shafi Goldwasser","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shafi Goldwasser","raw_affiliation_strings":["MIT and Weizmann Institute, Cambridge and Rehovot, Israel, MA","MIT and Weizmann Institute, Cambridge and Rehovot, Israel, MA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT and Weizmann Institute, Cambridge and Rehovot, Israel, MA","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"MIT and Weizmann Institute, Cambridge and Rehovot, Israel, MA#TAB#","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015086408","display_name":"Dan Gutfreund","orcid":"https://orcid.org/0000-0001-5101-4443"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Gutfreund","raw_affiliation_strings":["Harvard University, Cambridge, MA","Harvard University, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA","institution_ids":["https://openalex.org/I2801851002"]},{"raw_affiliation_string":"Harvard University, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I136199984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073397662","display_name":"Alexander Healy","orcid":null},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Healy","raw_affiliation_strings":["Harvard University, Cambridge, MA","Harvard University, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA","institution_ids":["https://openalex.org/I2801851002"]},{"raw_affiliation_string":"Harvard University, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I136199984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109110331","display_name":"Tali Kaufman","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"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tali Kaufman","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057788395","display_name":"Guy N. Rothblum","orcid":"https://orcid.org/0000-0001-5273-6472"},"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"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy N. Rothblum","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2257,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.89192226,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"440","last_page":"449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T11567","display_name":"semigroups and automata theory","score":0.9958999752998352,"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.9529539346694946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.756335973739624},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7560821771621704},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7367528676986694},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6802041530609131},{"id":"https://openalex.org/keywords/communication-source","display_name":"Communication source","score":0.66314697265625},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.6409032344818115},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5743110775947571},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.46872982382774353},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4680964946746826},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.463407963514328},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4325326681137085},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3242412507534027},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2754516899585724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22381296753883362},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.09971368312835693},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0978696346282959}],"concepts":[{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.9529539346694946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.756335973739624},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7560821771621704},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7367528676986694},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6802041530609131},{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.66314697265625},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.6409032344818115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5743110775947571},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.46872982382774353},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4680964946746826},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.463407963514328},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4325326681137085},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3242412507534027},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2754516899585724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22381296753883362},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.09971368312835693},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0978696346282959},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1250790.1250855","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250855","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.122.4243","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.4243","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mit.edu/~rothblum/papers/verify.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.147.1558","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.1558","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-math.mit.edu/~danny/pubs/verifiers.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.5578","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.5578","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-math.mit.edu/~danny/pubs/eccs-stoc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W66508742","https://openalex.org/W620207457","https://openalex.org/W1500727361","https://openalex.org/W1505096007","https://openalex.org/W1509697755","https://openalex.org/W1511716344","https://openalex.org/W1517420271","https://openalex.org/W1596412683","https://openalex.org/W1607960089","https://openalex.org/W1901622511","https://openalex.org/W1970606468","https://openalex.org/W1973874352","https://openalex.org/W1984108045","https://openalex.org/W1984459117","https://openalex.org/W1996839061","https://openalex.org/W2011112377","https://openalex.org/W2016232593","https://openalex.org/W2016443801","https://openalex.org/W2021276494","https://openalex.org/W2021736779","https://openalex.org/W2027528470","https://openalex.org/W2048958388","https://openalex.org/W2049918060","https://openalex.org/W2063130531","https://openalex.org/W2088492763","https://openalex.org/W2096390054","https://openalex.org/W2104952158","https://openalex.org/W2111824166","https://openalex.org/W2122270497","https://openalex.org/W2134839489","https://openalex.org/W2138036903","https://openalex.org/W2138532540","https://openalex.org/W2148957455","https://openalex.org/W2293988196","https://openalex.org/W2741390383","https://openalex.org/W2784889254","https://openalex.org/W2887278875","https://openalex.org/W2998808137","https://openalex.org/W3004537778","https://openalex.org/W3184666341","https://openalex.org/W4240781210","https://openalex.org/W6697343212"],"related_works":["https://openalex.org/W2950202488","https://openalex.org/W2604424424","https://openalex.org/W4386880013","https://openalex.org/W2195657359","https://openalex.org/W2120514365","https://openalex.org/W2809883875","https://openalex.org/W2970960002","https://openalex.org/W2157568248","https://openalex.org/W2124145386","https://openalex.org/W2050619821"],"abstract_inverted_index":{"We":[0],"develop":[1],"a":[2,10,16,62,75,84,128],"general":[3],"approach":[4],"for":[5,139],"improving":[6],"the":[7,33,37,52,71,80,107,117,146],"efficiency":[8],"of":[9,29,32,54,60,95,116],"computationally":[11],"bounded":[12],"receiver":[13,81],"interacting":[14],"with":[15,92,103,135],"powerful":[17],"and":[18,79,143],"possibly":[19],"malicious":[20],"sender.":[21,40],"The":[22],"key":[23],"idea":[24,42],"we":[25,86,130],"use":[26],"is":[27,65,109],"that":[28,88],"delegating":[30],"some":[31],"receiver's":[34],"computation":[35,119],"to":[36,73,82,99],"(potentially":[38,76],"malicious)":[39,77],"This":[41],"was":[43],"recently":[44],"introduced":[45],"by":[46],"Goldwasser":[47],"et":[48],"al.":[49],"[14]":[50],"in":[51,110,123,141,149],"area":[53],"program":[55],"checking.":[56],"A":[57],"classic":[58],"example":[59],"such":[61],"sender-receiver":[63],"setting":[64],"interactive":[66,90,101,132],"proof":[67,133],"systems.":[68],"By":[69],"taking":[70],"sender":[72],"be":[74,83,121],"prover":[78],"verifier,":[85],"show":[87],"(p-prover)":[89,100],"proofs":[91,102],"k":[93],"rounds":[94],"interaction":[96],"are":[97],"equivalent":[98],"k+O(1)":[104],"rounds,":[105],"where":[106,145],"verifier":[108,147],"NC0.":[111],"That":[112],"is,":[113],"each":[114],"round":[115],"verifier's":[118],"can":[120],"implemented":[122],"constant":[124,137,150],"parallel":[125],"time.":[126],"As":[127],"corollary,":[129],"obtain":[131],"systems,":[134],"(optimally)":[136],"soundness,":[138],"languages":[140],"AM":[142],"NEXP,":[144],"runs":[148],"parallel-time.":[151]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}