{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:40:35Z","timestamp":1774600835043,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250855","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"440-449","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Verifying and decoding in constant depth"],"prefix":"10.1145","author":[{"given":"Shafi","family":"Goldwasser","sequence":"first","affiliation":[{"name":"MIT and Weizmann Institute, Cambridge and Rehovot, Israel, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Gutfreund","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Healy","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tali","family":"Kaufman","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy N.","family":"Rothblum","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"Advances in computational complexity theory","author":"Ajtai M.","year":"1993","unstructured":"M. Ajtai . Approximate counting with uniform constant-depth circuits . In Advances in computational complexity theory , pages 1 -- 20 . Amererican Mathematical Society , 1993 . M. Ajtai. Approximate counting with uniform constant-depth circuits. In Advances in computational complexity theory, pages 1--20. Amererican Mathematical Society, 1993."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808715"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.20"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89520"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275486"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90028-1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90037-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200880"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195408"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129783"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_1_14_1","volume-title":"Manuscript","author":"Goldwasser S.","year":"2006","unstructured":"S. Goldwasser , D. Gutfreund , A. Healy , T. Kaufman , and G. Rothblum . Designing efficient program checkers by delegating their work . Manuscript , 2006 . S. Goldwasser, D. Gutfreund, A. Healy, T. Kaufman, and G. Rothblum. Designing efficient program checkers by delegating their work. Manuscript, 2006."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_16_1","unstructured":"S.\n      Goldwasser\n     and \n      M.\n      Sipser\n  . \n  Private coins versus public coins in interactive proof systems\n  . volume \n  5\n   of \n  Advances in Computing Research pages \n  73\n  --\n  90 1989\n  .  S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. volume 5 of Advances in Computing Research pages 73--90 1989."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.13"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"e_1_3_2_1_19_1","first-page":"244","volume-title":"proceedins of 29th ICALP","author":"Ishai Y.","year":"2002","unstructured":"Y. Ishai and E. Kushilevitz . Perfect constant-round secure computation via perfect randomizing polynomials . In In proceedins of 29th ICALP , pages 244 -- 256 , 2002 . Y. Ishai and E. Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In In proceedins of 29th ICALP, pages 244--256, 2002."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/002\/13"},{"key":"e_1_3_2_1_22_1","first-page":"11","volume-title":"PSPACE. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science","author":"Shamir A.","year":"1990","unstructured":"A. Shamir . IP = PSPACE. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science , pages 11 -- 15 , 1990 . A. Shamir. IP = PSPACE. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 11--15, 1990."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301397"},{"key":"e_1_3_2_1_24_1","volume-title":"Some applications of coding theory in computational complexity. Quaderni di Matematica, 13:347--424","author":"Trevisan L.","year":"2004","unstructured":"L. Trevisan . Some applications of coding theory in computational complexity. Quaderni di Matematica, 13:347--424 , 2004 . L. Trevisan. Some applications of coding theory in computational complexity. Quaderni di Matematica, 13:347--424, 2004."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/872747.873197"},{"key":"e_1_3_2_1_26_1","volume-title":"Personal communication","author":"Vadhan S.","year":"2006","unstructured":"S. Vadhan . Personal communication , 2006 . S. Vadhan. Personal communication, 2006."}],"event":{"name":"STOC07: Symposium on Theory of Computing","location":"San Diego California USA","acronym":"STOC07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250855","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:21Z","timestamp":1750258341000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":26,"alternative-id":["10.1145\/1250790.1250855","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250855","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}