{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T17:51:51Z","timestamp":1794592311885,"version":"4.9.1"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T00:00:00Z","timestamp":1422403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["1055057,1040083,"],"award-info":[{"award-number":["1055057,1040083,"]}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA9550-10-1-0073"],"award-info":[{"award-number":["FA9550-10-1-0073"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2015,1,28]]},"abstract":"<jats:p>From theoretical possibility to near practicality.<\/jats:p>","DOI":"10.1145\/2641562","type":"journal-article","created":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T08:39:49Z","timestamp":1422952789000},"page":"74-84","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":123,"title":["Verifying computations without reexecuting them"],"prefix":"10.1145","volume":"58","author":[{"given":"Michael","family":"Walfish","sequence":"first","affiliation":[{"name":"New York University, New York City"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew J.","family":"Blumberg","sequence":"additional","affiliation":[{"name":"University of Texas at Austin"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,1,28]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422481"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"e_1_2_2_9_1","volume-title":"USENIX Security, (Aug.","author":"Ben-Sasson E.","year":"2014","unstructured":"Ben-Sasson , E. , Chiesa , A. , Tromer , E. and Virza , M . Succinct non-interactive zero knowledge for a von Neumann architecture . USENIX Security, (Aug. 2014 ). Ben-Sasson, E., Chiesa, A., Tromer, E. and Virza, M. Succinct non-interactive zero knowledge for a von Neumann architecture. USENIX Security, (Aug. 2014)."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446810"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488623"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522733"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046759"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881446"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517872.2517878"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236457.1236459"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881445"},{"key":"e_1_2_2_22_1","volume-title":"Proceedings of EUROCRYPT","author":"Gennaro R.","year":"2013","unstructured":"Gennaro , R. , Gentry , C. and Parno , B . and Raykova, M. Quadratic span programs and succinct NIZKs without PCPs . In Proceedings of EUROCRYPT , May 2013 . Gennaro, R., Gentry, C. and Parno, B. and Raykova, M. Quadratic span programs and succinct NIZKs without PCPs. In Proceedings of EUROCRYPT, May 2013."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000023"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_2_2_28_1","volume-title":"USENIX Security","author":"Huang Y.","year":"2011","unstructured":"Huang , Y. , Evans , D. , Katz , J. and Malka , L . Faster secure two-party computation using garbled circuits . In USENIX Security , 2011 . Huang, Y., Evans, D., Katz, J. and Malka, L. Faster secure two-party computation using garbled circuits. In USENIX Security, 2011."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.10"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_2_2_31_1","volume-title":"C.H. Billion-gate secure computation with malicious adversaries. USENIX Security (Aug.","author":"Kreuter B.","year":"2012","unstructured":"Kreuter , B. , shelat, a. and Shen , C.H. Billion-gate secure computation with malicious adversaries. USENIX Security (Aug. 2012 ). Kreuter, B., shelat, a. and Shen, C.H. Billion-gate secure computation with malicious adversaries. USENIX Security (Aug. 2012)."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063509.2063512"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050050"},{"key":"e_1_2_2_35_1","volume-title":"Proceedings of OSDI","author":"Narayan A.","year":"2012","unstructured":"Narayan , A. and Haeberlen , A . DJoin: Differentially private join queries over distributed databases . In Proceedings of OSDI , 2012 . Narayan, A. and Haeberlen, A. DJoin: Differentially private join queries over distributed databases. In Proceedings of OSDI, 2012."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2060078"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"e_1_2_2_39_1","volume-title":"Proceedings of TRUST","author":"Sadeghi A.R.","year":"2010","unstructured":"Sadeghi , A.R. , Schneider , T. , and Winandy , M . Token-based cloud computing: Secure outsourcing of data and arbitrary computations with lower latency . In Proceedings of TRUST , 2010 . Sadeghi, A.R., Schneider, T., and Winandy, M. Token-based cloud computing: Secure outsourcing of data and arbitrary computations with lower latency. In Proceedings of TRUST, 2010."},{"key":"e_1_2_2_40_1","volume-title":"Proceedings of HotOS","author":"Setty S.","year":"2011","unstructured":"Setty , S. , Blumberg , A.J. and Walfish , M . Toward practical and unconditional verification of remote computations . In Proceedings of HotOS , May 2011 . Setty, S., Blumberg, A.J. and Walfish, M. Toward practical and unconditional verification of remote computations. In Proceedings of HotOS, May 2011."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465359"},{"key":"e_1_2_2_42_1","volume-title":"Proceedings of NDSS","author":"Setty S.","year":"2012","unstructured":"Setty , S. , McPherson , R. , Blumberg , A.J. , and Walfish , M . Making argument systems for outsourced computation practical (sometimes) . In Proceedings of NDSS , 2012 . Setty, S., McPherson, R., Blumberg, A.J., and Walfish, M. Making argument systems for outsourced computation practical (sometimes). In Proceedings of NDSS, 2012."},{"key":"e_1_2_2_43_1","volume-title":"USENIX Security","author":"Setty S.","year":"2012","unstructured":"Setty , S. , Vu , V. , Panpalia , N. , Braun , B. , Blumberg , A.J. and Walfish , M . Taking proof-based verified computation a few steps closer to practicality . USENIX Security , Aug. 2012 . Setty, S., Vu, V., Panpalia, N., Braun, B., Blumberg, A.J. and Walfish, M. Taking proof-based verified computation a few steps closer to practicality. USENIX Security, Aug. 2012."},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1467247.1467267"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"e_1_2_2_46_1","volume-title":"Proceedings of USENIX HotCloud Workshop, (June","author":"Thaler J.","year":"2012","unstructured":"Thaler , J. , Roberts , M. , Mitzenmacher , M. and Pfister , H . Verifiable computation with massively parallel interactive proofs . In Proceedings of USENIX HotCloud Workshop, (June 2012 ). Thaler, J., Roberts, M., Mitzenmacher, M. and Pfister, H. Verifiable computation with massively parallel interactive proofs. In Proceedings of USENIX HotCloud Workshop, (June 2012)."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.48"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23097"},{"key":"e_1_2_2_49_1","volume-title":"Proceedings of OSDI","author":"Wolinsky D.I.","year":"2012","unstructured":"Wolinsky , D.I. , Corrigan-Gibbs , H. , Ford , B. and Johnson , A . Dissent in numbers: Making strong anonymity scale . In Proceedings of OSDI , 2012 . Wolinsky, D.I., Corrigan-Gibbs, H., Ford, B. and Johnson, A. Dissent in numbers: Making strong anonymity scale. In Proceedings of OSDI, 2012."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2641562","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2641562","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:01:07Z","timestamp":1750262467000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2641562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,28]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,1,28]]}},"alternative-id":["10.1145\/2641562"],"URL":"https:\/\/doi.org\/10.1145\/2641562","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,28]]},"assertion":[{"value":"2015-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}