{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:06:05Z","timestamp":1753520765392,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649698","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"1724-1730","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Perfect Zero-Knowledge PCPs for #P"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7864-7013","authenticated-orcid":false,"given":"Tom","family":"Gur","sequence":"first","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2219-599X","authenticated-orcid":false,"given":"Jack","family":"O'Connor","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0085-2137","authenticated-orcid":false,"given":"Nicholas","family":"Spooner","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom \/ New York University, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1490270.1490272"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491533.2491549"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90006-Q"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/971651.971653"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267823"},{"key":"e_1_3_2_1_7_1","first-page":"3","article-title":"Improved low-degree testing and its applications","volume":"23","author":"Arora S.","year":"2003","unstructured":"Arora, S., and Sudan, M. Improved low-degree testing and its applications. Combinatorica 23, 3 (2003), 365\u2013426. Preliminary version appeared in STOC \u201997.","journal-title":"Combinatorica"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62223"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70503-3_6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1161749"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30617-4_13"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511100"},{"key":"e_1_3_2_1_13_1","volume-title":"A zero knowledge sumcheck and its applications","author":"Chiesa A.","year":"2017","unstructured":"Chiesa, A., Forbes, M. A., and Spooner, N. A zero knowledge sumcheck and its applications, 2017."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236457.1236459"},{"key":"e_1_3_2_1_15_1","first-page":"227","volume-title":"Proceedings of the 11th Annual International Cryptology Conference","author":"Dwork C.","year":"1992","unstructured":"Dwork, C., Feige, U., Kilian, J., Naor, M., and Safra, S. Low communication 2-prover zero-knowledge proofs for NP. In Proceedings of the 11th Annual International Cryptology Conference (1992), CRYPTO \u201992, pp. 215\u2013227."},{"key":"e_1_3_2_1_16_1","first-page":"209","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"Fortnow L.","year":"1987","unstructured":"Fortnow, L. The complexity of perfect zero-knowledge (extended abstract). In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (1987), STOC \u201987, pp. 204\u2013209."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00044"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-022-09433-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8_6"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0263-7"},{"key":"e_1_3_2_1_25_1","first-page":"547","volume-title":"Interactive PCP. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming","author":"Kalai Y.","year":"2008","unstructured":"Kalai, Y., and Raz, R. Interactive PCP. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming (2008), ICALP \u201908, pp. 536\u2013547."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258643"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200756"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1561\/3300000030"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.3390\/e24070970"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vancouver BC Canada","acronym":"STOC '24"},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649698","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:52Z","timestamp":1750291432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":30,"alternative-id":["10.1145\/3618260.3649698","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649698","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}