{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:40Z","timestamp":1750307080357,"version":"3.41.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,3,6]],"date-time":"2013-03-06T00:00:00Z","timestamp":1362528000000},"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":["SIGACT News"],"published-print":{"date-parts":[[2013,3,6]]},"abstract":"<jats:p>We survey recent results on parallel repetition theorems for computationally-sound interactive proofs (a.k.a. interactive arguments).<\/jats:p>","DOI":"10.1145\/2447712.2447731","type":"journal-article","created":{"date-parts":[[2013,3,8]],"date-time":"2013-03-08T15:00:42Z","timestamp":1362754842000},"page":"50-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Guest column"],"prefix":"10.1145","volume":"44","author":[{"given":"Kai-Min","family":"Chung","sequence":"first","affiliation":[{"name":"Cornell University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275487"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796361"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213053"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90028-1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365687"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_27"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_2"},{"volume-title":"School of Engineering and Applied Sciences","year":"2011","author":"Chung Kai-Min","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_2"},{"volume-title":"ASIACRYPT. Springer-Verlag","year":"2010","author":"Chung Kai-Min","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.93"},{"key":"e_1_2_1_13_1","unstructured":"Kai-Min Chung and Rafael Pass. Parallel repetition theorem for public-coin protocols. Manuscript in preparation 2013.  Kai-Min Chung and Rafael Pass. Parallel repetition theorem for public-coin protocols. Manuscript in preparation 2013."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795291562"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_27"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Ivan\n       \n      Damg\u00e5rd\n     and \n      \n      \n      Birgit\n       \n      Pfitzmann\n    .\n      \n  \n   \n  Sequential iteration of interactive arguments and an efficient Zero-Knowledge argument for NP. In Kim Guldstrand Larsen Sven Skyum and Glynn Winskel editors ICALP volume \n  1443\n   of \n  Lecture Notes in Computer Science pages \n  772\n  --\n  783\n  . \n  Springer 1998\n  .   Ivan Damg\u00e5rd and Birgit Pfitzmann. Sequential iteration of interactive arguments and an efficient Zero-Knowledge argument for NP. In Kim Guldstrand Larsen Sven Skyum and Glynn Winskel editors ICALP volume 1443 of Lecture Notes in Computer Science pages 772--783. Springer 1998.","DOI":"10.1007\/BFb0055101"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/519078"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.50"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"e_1_2_1_24_1","unstructured":"Johan H\u00e5stad Rafael Pass Douglas Wikstr\u00f6m and Krzysztof Pietrzak. An efficient parallel repetition theorem. Unpublished manuscript 2008.  Johan H\u00e5stad Rafael Pass Douglas Wikstr\u00f6m and Krzysztof Pietrzak. An efficient parallel repetition theorem. Unpublished manuscript 2008."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_1"},{"key":"e_1_2_1_26_1","first-page":"19","volume-title":"TCC","author":"Holenstein Thomas","year":"2011"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777777.1777817"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9029-7"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_3"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0004"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382559.2382561"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760749.1760757"},{"key":"e_1_2_1_36_1","first-page":"169","volume-title":"Foundations of Secure Computation","author":"Rivest R.","year":"1978"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796583"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2010.12"},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Salil Vadhan. Pseudorandomness. Now Publishers Inc. 2012.   Salil Vadhan. Pseudorandomness. Now Publishers Inc. 2012.","DOI":"10.1561\/9781601985958"},{"key":"e_1_2_1_41_1","first-page":"80","volume-title":"FOCS","author":"Chi-Chih Yao Andrew","year":"1982"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199712)11:4%3C345::AID-RSA4%3E3.0.CO;2-Z"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2447712.2447731","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2447712.2447731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:10Z","timestamp":1750239250000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2447712.2447731"}},"subtitle":["parallel repetition theorems for interactive arguments"],"short-title":[],"issued":{"date-parts":[[2013,3,6]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3,6]]}},"alternative-id":["10.1145\/2447712.2447731"],"URL":"https:\/\/doi.org\/10.1145\/2447712.2447731","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2013,3,6]]},"assertion":[{"value":"2013-03-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}