{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T13:34:10Z","timestamp":1775309650637,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"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":[[2013,6]]},"DOI":"10.1145\/2488608.2488679","type":"proceedings-article","created":{"date-parts":[[2013,5,28]],"date-time":"2013-05-28T16:35:41Z","timestamp":1369758941000},"page":"565-574","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Delegation for bounded space"],"prefix":"10.1145","author":[{"given":"Yael","family":"Tauman Kalai","sequence":"first","affiliation":[{"name":"Microsoft Research, New England, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Raz","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ICALP: Annual International Colloquium on Automata","author":"Aiello W.","year":"2000"},{"key":"e_1_3_2_1_2_1","first-page":"152","volume-title":"ICALP (1)","author":"Applebaum B.","year":"2010"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/39\/36\/010"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.022101"},{"key":"e_1_3_2_1_5_1","first-page":"183","volume-title":"Proceedings of the Second International Workshop on Mobile Agents, MA '98","author":"Biehl I.","year":"1999"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"N. Bitansky R. Canetti A. Chiesa and E. Tromer. Recursive composition and bootstrapping for snarks and proof-carrying data. IACR Cryptology ePrint Archive 2012:95 2012.  N. Bitansky R. Canetti A. Chiesa and E. Tromer. Recursive composition and bootstrapping for snarks and proof-carrying data. IACR Cryptology ePrint Archive 2012:95 2012.","DOI":"10.1145\/2488608.2488623"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033048"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881446"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_4"},{"key":"e_1_3_2_1_11_1","unstructured":"C. Dwork M. Langberg M. Naor K. Nissim and O. 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.  C. Dwork M. Langberg M. Naor K. Nissim and O. 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_1_12_1","first-page":"186","volume-title":"CRYPTO","author":"Fiat A.","year":"1986"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881445"},{"key":"e_1_3_2_1_14_1","unstructured":"R. Gennaro C. Gentry B. Parno and M. Raykova. Quadratic span programs and succinct nizks without pcps. IACR Cryptology ePrint Archive 2012:215 2012.  R. Gennaro C. Gentry B. Parno and M. Raykova. Quadratic span programs and succinct nizks without pcps. IACR Cryptology ePrint Archive 2012:215 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_17_1","unstructured":"S. Goldwasser H. Lin and A. Rubinstein. Delegation of computation without rejection problem from designated verifier cs-proofs. IACR Cryptology ePrint Archive 2011:456 2011.  S. Goldwasser H. Lin and A. Rubinstein. Delegation of computation without rejection problem from designated verifier cs-proofs. IACR Cryptology ePrint Archive 2011:456 2011."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a008"},{"key":"e_1_3_2_1_20_1","first-page":"140","volume-title":"ICALP (1)","author":"Ito T.","year":"2010"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.22"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"T. Ito and T. Vidick. A multi-prover interactive proof for NEXP sound against entangled provers. CoRR abs\/1207.0550 2012.  T. Ito and T. Vidick. A multi-prover interactive proof for NEXP sound against entangled provers. CoRR abs\/1207.0550 2012.","DOI":"10.1109\/FOCS.2012.11"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_9"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.8"},{"key":"e_1_3_2_1_25_1","first-page":"441","volume-title":"In Symposium on the Foundations of Modern Physics","author":"Khalfin L. A.","year":"1985"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365746"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02058098"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00739036"},{"key":"e_1_3_2_1_33_1","unstructured":"M. Sudan. Probabilistically checkable proofs - lecture notes 2000. Available at http:\/\/people.csail.mit.edu\/madhu\/pcp\/pcp.ps.  M. Sudan. Probabilistically checkable proofs - lecture notes 2000. Available at http:\/\/people.csail.mit.edu\/madhu\/pcp\/pcp.ps."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2008.0149"}],"event":{"name":"STOC'13: Symposium on Theory of Computing","location":"Palo Alto California USA","acronym":"STOC'13","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fifth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488679","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488608.2488679","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:20Z","timestamp":1750235960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488608.2488679"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":34,"alternative-id":["10.1145\/2488608.2488679","10.1145\/2488608"],"URL":"https:\/\/doi.org\/10.1145\/2488608.2488679","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}