{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:58:28Z","timestamp":1781078308975,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0832797, DMS-0835373"],"award-info":[{"award-number":["CCF-0832797, DMS-0835373"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001658","name":"Minerva Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001658","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["CCF-0832797, DMS-0835373"],"award-info":[{"award-number":["CCF-0832797, DMS-0835373"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591809","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"485-494","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["How to delegate computations"],"prefix":"10.1145","author":[{"given":"Yael Tauman","family":"Kalai","sequence":"first","affiliation":[{"name":"Microsoft Research, New England"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ran","family":"Raz","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science Rehovot, Israel and Institute for Advanced Study, Princeton, NJ"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646253.686344"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/39\/36\/010"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880936"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_2_5_1","volume-title":"Recursive composition and bootstrapping for snarks and proof-carrying data. IACR Cryptology ePrint Archive","author":"Bitansky Nir","year":"2012","unstructured":"{BCCT12b} Nir Bitansky , Ran Canetti , Alessandro Chiesa , and Eran Tromer . Recursive composition and bootstrapping for snarks and proof-carrying data. IACR Cryptology ePrint Archive , 2012 :95, 2012. {BCCT12b} Nir Bitansky, Ran Canetti, Alessandro Chiesa, and Eran Tromer. Recursive composition and bootstrapping for snarks and proof-carrying data. IACR Cryptology ePrint Archive, 2012:95, 2012."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.022101"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033048"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881446"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_4"},{"key":"e_1_3_2_2_10_1","volume-title":"Succinct proofs for NP and spooky interactions. Unpublished manuscript,","author":"Dwork Cynthia","year":"2004","unstructured":"{DLN+04} Cynthia Dwork , Michael Langberg , Moni Naor , Kobbi Nissim , and Omer Reingold . Succinct proofs for NP and spooky interactions. Unpublished manuscript, available at http:\/\/www.cs.bgu.ac.il\/~kobbi\/papers\/spooky_sub_crypto.pdf, 2004 . {DLN+04} Cynthia Dwork, Michael Langberg, Moni Naor, Kobbi Nissim, and Omer Reingold. Succinct proofs for NP and spooky interactions. Unpublished manuscript, available at http:\/\/www.cs.bgu.ac.il\/~kobbi\/papers\/spooky_sub_crypto.pdf, 2004."},{"key":"e_1_3_2_2_11_1","first-page":"186","volume-title":"CRYPTO","author":"Fiat Amos","year":"1986","unstructured":"{FS86} Amos Fiat and Adi Shamir . How to prove yourself: Practical solutions to identification and signature problems . In CRYPTO , pages 186 -- 194 , 1986 . {FS86} Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, pages 186--194, 1986."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881445"},{"key":"e_1_3_2_2_13_1","volume-title":"Quadratic span programs and succinct NIZKs without PCPs. IACR Cryptology ePrint Archive","author":"Gennaro Rosario","year":"2012","unstructured":"{GGPR12} Rosario Gennaro , Craig Gentry , Bryan Parno , and Mariana Raykova . Quadratic span programs and succinct NIZKs without PCPs. IACR Cryptology ePrint Archive , 2012 :215, 2012. {GGPR12} Rosario Gennaro, Craig Gentry, Bryan Parno, and Mariana Raykova. Quadratic span programs and succinct NIZKs without PCPs. IACR Cryptology ePrint Archive, 2012:215, 2012."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_2_15_1","volume-title":"Delegation of computation without rejection problem from designated verifier cs-proofs. IACR Cryptology ePrint Archive","author":"Goldwasser Shafi","year":"2011","unstructured":"{GLR11} Shafi Goldwasser , Huijia Lin , and Aviad Rubinstein . Delegation of computation without rejection problem from designated verifier cs-proofs. IACR Cryptology ePrint Archive , 2011 :456, 2011. {GLR11} Shafi Goldwasser, Huijia Lin, and Aviad Rubinstein. Delegation of computation without rejection problem from designated verifier cs-proofs. IACR Cryptology ePrint Archive, 2011:456, 2011."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a008"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.22"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880918.1880935"},{"key":"e_1_3_2_2_20_1","volume-title":"A multi-prover interactive proof for NEXP sound against entangled provers. CoRR, abs\/1207.0550","author":"Ito Tsuyoshi","year":"2012","unstructured":"{IV12} Tsuyoshi Ito and Thomas Vidick . A multi-prover interactive proof for NEXP sound against entangled provers. CoRR, abs\/1207.0550 , 2012 . {IV12} Tsuyoshi Ito and Thomas Vidick. A multi-prover interactive proof for NEXP sound against entangled provers. CoRR, abs\/1207.0550, 2012."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.8"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_9"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488679"},{"key":"e_1_3_2_2_25_1","volume-title":"How to delegate computations: The power of no-signaling proofs. Electronic Colloquium on Computational Complexity (ECCC), 20:183","author":"Kalai Yael Tauman","year":"2013","unstructured":"{KRR13b} Yael Tauman Kalai , Ran Raz , and Ron D. Rothblum . How to delegate computations: The power of no-signaling proofs. Electronic Colloquium on Computational Complexity (ECCC), 20:183 , 2013 . {KRR13b} Yael Tauman Kalai, Ran Raz, and Ron D. Rothblum. How to delegate computations: The power of no-signaling proofs. Electronic Colloquium on Computational Complexity (ECCC), 20:183, 2013."},{"key":"e_1_3_2_2_26_1","first-page":"441","volume-title":"In Symposium on the Foundations of Modern Physics","author":"Leonid","year":"1985","unstructured":"{KT85} Leonid A. Khalfin and Boris S. Tsirelson. Quantum and quasi-classical analogs of Bell inequalities . In In Symposium on the Foundations of Modern Physics , pages 441 -- 460 , 1985 . {KT85} Leonid A. Khalfin and Boris S. Tsirelson. Quantum and quasi-classical analogs of Bell inequalities. In In Symposium on the Foundations of Modern Physics, pages 441--460, 1985."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365746"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02058098"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00739036"},{"key":"e_1_3_2_2_34_1","volume-title":"Probabilistically checkable proofs - lecture notes","author":"Sudan Madhu","year":"2000","unstructured":"{Sud00} Madhu Sudan . Probabilistically checkable proofs - lecture notes , 2000 . Available at http:\/\/people.csail.mit.edu\/madhu\/pcp\/pcp.ps. {Sud00} Madhu Sudan. Probabilistically checkable proofs - lecture notes, 2000. Available at http:\/\/people.csail.mit.edu\/madhu\/pcp\/pcp.ps."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2008.0149"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.87"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","location":"New York New York","acronym":"STOC '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591809","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:56:04Z","timestamp":1750229764000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591809"}},"subtitle":["the power of no-signaling proofs"],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":35,"alternative-id":["10.1145\/2591796.2591809","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591809","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}