{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T06:59:25Z","timestamp":1777964365452,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"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-0915922CNS-0721491IIS-0964473"],"award-info":[{"award-number":["CCF-0915922CNS-0721491IIS-0964473"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["CCF-0915922CNS-0721491IIS-0964473"],"award-info":[{"award-number":["CCF-0915922CNS-0721491IIS-0964473"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CCF-0915922CNS-0721491IIS-0964473"],"award-info":[{"award-number":["CCF-0915922CNS-0721491IIS-0964473"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,1,8]]},"DOI":"10.1145\/2090236.2090245","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"90-112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":146,"title":["Practical verified computation with streaming interactive proofs"],"prefix":"10.1145","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[{"name":"AT&T Labs---Research"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[{"name":"Harvard University"}]},{"given":"Justin","family":"Thaler","sequence":"additional","affiliation":[{"name":"Harvard University"}]}],"member":"320","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.31"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540612"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1981.1163645"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046759"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_20"},{"key":"e_1_3_2_1_9_1","volume-title":"Annotations in data streams. Submitted","author":"Chakrabarti A.","year":"2011","unstructured":"A. Chakrabarti , G. Cormode , A. Mcgregor , and J. Thaler . Annotations in data streams. Submitted , 2011 . A. Chakrabarti, G. Cormode, A. Mcgregor, and J. Thaler. Annotations in data streams. Submitted, 2011."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90218-X"},{"key":"e_1_3_2_1_11_1","first-page":"151","volume-title":"Memory Delegation. In Proc. of CRYPTO","author":"Chung K.","year":"2011","unstructured":"K. Chung , Y. Kalai , F. Liu , and R. Raz . Memory Delegation. In Proc. of CRYPTO , pp. 151 -- 168 , 2011 . K. Chung, Y. Kalai, F. Liu, and R. Raz. Memory Delegation. In Proc. of CRYPTO, pp. 151--168, 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881446"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.08.002"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888935.1888962"},{"key":"e_1_3_2_1_16_1","unstructured":"seas.harvard.edu\/~jthaler\/code\/code.htm  seas.harvard.edu\/~jthaler\/code\/code.htm"},{"key":"e_1_3_2_1_17_1","volume-title":"Verifying computations with streaming interactive proofs. Electronic Colloquium on Computational Complexity (ECCC), 17:159","author":"Cormode G.","year":"2010","unstructured":"G. Cormode , J. Thaler , and K. Yi . Verifying computations with streaming interactive proofs. Electronic Colloquium on Computational Complexity (ECCC), 17:159 , 2010 . Full version to appear in International Conference on Very Large Databases (VLDB), 2012. G. Cormode, J. Thaler, and K. Yi. Verifying computations with streaming interactive proofs. Electronic Colloquium on Computational Complexity (ECCC), 17:159, 2010. Full version to appear in International Conference on Very Large Databases (VLDB), 2012."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881445"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.10"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315317"},{"key":"e_1_3_2_1_23_1","volume-title":"Algorithm Design","author":"Kleinberg J.","year":"2005","unstructured":"J. Kleinberg and E. Tardos . Algorithm Design , Addison-Wesley , 2005 . J. Kleinberg and E. Tardos. Algorithm Design, Addison-Wesley, 2005."},{"key":"e_1_3_2_1_24_1","first-page":"147","volume-title":"Proc. of VLDB","author":"Li F.","year":"2007","unstructured":"F. Li , K. Yi , M. Hadjieleftheriou , and G. Kollios . Proof-infused streams: Enabling authentication of sliding window queries on streams . In Proc. of VLDB , pp. 147 -- 158 , 2007 . F. Li, K. Yi, M. Hadjieleftheriou, and G. Kollios. Proof-infused streams: Enabling authentication of sliding window queries on streams. In Proc. of VLDB, pp. 147--158, 2007."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. USENIX Security Symposium","author":"Malkhi D.","year":"2004","unstructured":"D. Malkhi , N. Nisan , B. Pinkas , and Y. Sella . Fairplay---a secure two-party computation system . In Proc. USENIX Security Symposium , 2004 . D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay---a secure two-party computation system. In Proc. USENIX Security Symposium, 2004."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_49"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","DOI":"10.1561\/9781933019604","volume-title":"Data Streams: Algorithms and Applications","author":"Muthukrishnan S.","year":"2005","unstructured":"S. Muthukrishnan . Data Streams: Algorithms and Applications . Now Publishers , 2005 . S. Muthukrishnan. Data Streams: Algorithms and Applications. Now Publishers, 2005."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0145-2"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_31_1","volume-title":"Proc. of HotOS Workshop","author":"Setty S.","year":"2011","unstructured":"S. Setty , A. J. Blumberg , and M. Walfish . Toward practical and unconditional verification of remote computations . In Proc. of HotOS Workshop , 2011 . S. Setty, A. J. Blumberg, and M. Walfish. Toward practical and unconditional verification of remote computations. In Proc. of HotOS Workshop, 2011."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146613"},{"key":"e_1_3_2_1_34_1","volume-title":"Proc of ACM-SIAM SODA","author":"Thorup M.","year":"2000","unstructured":"M. Thorup . Even strongly universal hashing is pretty fast . In Proc of ACM-SIAM SODA , 2000 . M. Thorup. Even strongly universal hashing is pretty fast. In Proc of ACM-SIAM SODA, 2000."},{"key":"e_1_3_2_1_35_1","unstructured":"http:\/\/en.wikipedia.org\/wiki\/Cooley-Tukey_FFT_algorithm  http:\/\/en.wikipedia.org\/wiki\/Cooley-Tukey_FFT_algorithm"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0113-2"}],"event":{"name":"ITCS '12: Innovations in Theoretical Computer Science","location":"Cambridge Massachusetts","acronym":"ITCS '12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 3rd Innovations in Theoretical Computer Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090245","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090236.2090245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":35,"alternative-id":["10.1145\/2090236.2090245","10.1145\/2090236"],"URL":"https:\/\/doi.org\/10.1145\/2090236.2090245","relation":{},"subject":[],"published":{"date-parts":[[2012,1,8]]},"assertion":[{"value":"2012-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}