{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:04:23Z","timestamp":1775325863879,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T00:00:00Z","timestamp":1365984000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-10-1-0073"],"award-info":[{"award-number":["FA9550-10-1-0073"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1055057, 1040083"],"award-info":[{"award-number":["1055057, 1040083"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,4,15]]},"DOI":"10.1145\/2465351.2465359","type":"proceedings-article","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T19:57:35Z","timestamp":1366228655000},"page":"71-84","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":88,"title":["Resolving the conflict between generality and plausibility in verified computation"],"prefix":"10.1145","author":[{"given":"Srinath","family":"Setty","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX"}]},{"given":"Benjamin","family":"Braun","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX"}]},{"given":"Victor","family":"Vu","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX"}]},{"given":"Andrew J.","family":"Blumberg","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX"}]},{"given":"Bryan","family":"Parno","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]},{"given":"Michael","family":"Walfish","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX"}]}],"member":"320","published-online":{"date-parts":[[2013,4,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"CUDA (http:\/\/developer.nvidia.com\/what-cuda).  CUDA (http:\/\/developer.nvidia.com\/what-cuda)."},{"key":"e_1_3_2_1_2_1","unstructured":"The GNU MP bignum library. http:\/\/gmplib.org\/.  The GNU MP bignum library. http:\/\/gmplib.org\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Shootout\/Fannkuch. http:\/\/www.haskell.org\/haskellwiki\/Shootout\/Fannkuch.  Shootout\/Fannkuch. http:\/\/www.haskell.org\/haskellwiki\/Shootout\/Fannkuch."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/581571.581573"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1540612"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422481"},{"key":"e_1_3_2_1_10_1","volume-title":"STOC","author":"Ben-Sasson E.","year":"2013","unstructured":"E. Ben-Sasson , A. Chiesa , D. Genkin , and E. Tromer . On the concrete-efficiency threshold of probabilistically-checkable proofs . In STOC , 2013 . To appear. E. Ben-Sasson, A. Chiesa, D. Genkin, and E. Tromer. On the concrete-efficiency threshold of probabilistically-checkable proofs. In STOC, 2013. To appear."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.27"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/050646445"},{"key":"e_1_3_2_1_13_1","volume-title":"a variant of Salsa20","author":"Bernstein D. J.","unstructured":"D. J. Bernstein . ChaCha , a variant of Salsa20 . http:\/\/cr.yp.to\/chacha.html. D. J. Bernstein. ChaCha, a variant of Salsa20. http:\/\/cr.yp.to\/chacha.html."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502417715"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"e_1_3_2_1_16_1","volume-title":"Dec.","author":"Braun B.","year":"2012","unstructured":"B. Braun . Compiling computations to constraints for verified computation. UT Austin Honors thesis HR-12-10 , Dec. 2012 . B. Braun. Compiling computations to constraints for verified computation. UT Austin Honors thesis HR-12-10, Dec. 2012."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1946370.1946371"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/090751062"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881446"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"e_1_3_2_1_22_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"1990","unstructured":"T. H. Cormen , C. E. Leiserson , and R. L. Rivest . Introduction to Algorithms . The MIT Press , 1990 . T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1990."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236457.1236459"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881445"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294279"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.10"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_35_1","series-title":"The Art of Computer Programming","volume-title":"Seminumerical Algorithms","author":"Knuth D. E.","year":"1997","unstructured":"D. E. Knuth . Seminumerical Algorithms , volume 2 of The Art of Computer Programming . Addison-Wesley , third edition, 1997 . D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, third edition, 1997."},{"key":"e_1_3_2_1_36_1","volume-title":"OSDI","author":"Li J.","year":"2004","unstructured":"J. Li , M. N. Krohn , D. Mazi\u00e8res , and D. Shasha . Secure untrusted data repository (SUNDR) . In OSDI , 2004 . J. Li, M. N. Krohn, D. Mazi\u00e8res, and D. Shasha. Secure untrusted data repository (SUNDR). In OSDI, 2004."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063509.2063512"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046787"},{"key":"e_1_3_2_1_40_1","volume-title":"USENIX Security","author":"Malkhi D.","year":"2004","unstructured":"D. Malkhi , N. Nisan , B. Pinkas , and Y. Sella . Fairplay---a secure two-party computation system . In USENIX Security , 2004 . D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay---a secure two-party computation system. In USENIX Security, 2004."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050050"},{"key":"e_1_3_2_1_43_1","volume-title":"NDSS","author":"Monrose F.","year":"1999","unstructured":"F. Monrose , P. Wycko , and A. D. Rubin . Distributed execution with remote audit . In NDSS , 1999 . F. Monrose, P. Wycko, and A. D. Rubin. Distributed execution with remote audit. In NDSS, 1999."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/2060078"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/322123.322138"},{"key":"e_1_3_2_1_48_1","volume-title":"TRUST","author":"Sadeghi A.-R.","year":"2010","unstructured":"A.-R. Sadeghi , T. Schneider , and M. Winandy . Token-based cloud computing: secure outsourcing of data and arbitrary computations with lower latency . In TRUST , 2010 . A.-R. Sadeghi, T. Schneider, and M. Winandy. Token-based cloud computing: secure outsourcing of data and arbitrary computations with lower latency. In TRUST, 2010."},{"key":"e_1_3_2_1_49_1","volume-title":"SOSP","author":"Seshadri A.","year":"2005","unstructured":"A. Seshadri , M. Luk , E. Shi , A. Perrig , L. van Doorn , and P. Khosla . Pioneer: Verifying integrity and guaranteeing execution of code on legacy platforms . In SOSP , 2005 . A. Seshadri, M. Luk, E. Shi, A. Perrig, L. van Doorn, and P. Khosla. Pioneer: Verifying integrity and guaranteeing execution of code on legacy platforms. In SOSP, 2005."},{"key":"e_1_3_2_1_50_1","volume-title":"HotOS","author":"Setty S.","year":"2011","unstructured":"S. Setty , A. J. Blumberg , and M. Walfish . Toward practical and unconditional verification of remote computations . In HotOS , 2011 . S. Setty, A. J. Blumberg, and M. Walfish. Toward practical and unconditional verification of remote computations. In HotOS, 2011."},{"key":"e_1_3_2_1_52_1","volume-title":"NDSS","author":"Setty S.","year":"2012","unstructured":"S. Setty , R. McPherson , A. J. Blumberg , and M. Walfish . Making argument systems for outsourced computation practical (sometimes) . In NDSS , 2012 . S. Setty, R. McPherson, A. J. Blumberg, and M. Walfish. Making argument systems for outsourced computation practical (sometimes). In NDSS, 2012."},{"key":"e_1_3_2_1_54_1","volume-title":"USENIX Security","author":"Setty S.","year":"2012","unstructured":"S. Setty , V. Vu , N. Panpalia , B. Braun , A. J. Blumberg , and M. Walfish . Taking proof-based verified computation a few steps closer to practicality . In USENIX Security , 2012 . S. Setty, V. Vu, N. Panpalia, B. Braun, A. J. Blumberg, and M. Walfish. Taking proof-based verified computation a few steps closer to practicality. In USENIX Security, 2012."},{"key":"e_1_3_2_1_55_1","volume-title":"USENIX HotCloud Workshop","author":"Thaler J.","year":"2012","unstructured":"J. Thaler , M. Roberts , M. Mitzenmacher , and H. Pfister . Verifiable computation with massively parallel interactive proofs . In USENIX HotCloud Workshop , 2012 . J. Thaler, M. Roberts, M. Mitzenmacher, and H. Pfister. Verifiable computation with massively parallel interactive proofs. In USENIX HotCloud Workshop, 2012."},{"key":"e_1_3_2_1_56_1","volume-title":"Pattern Recognition","author":"Theodoridis S.","year":"2006","unstructured":"S. Theodoridis and K. Koutroumbas . Pattern Recognition , Third Edition. Academic Press, Inc. , 2006 . S. Theodoridis and K. Koutroumbas. Pattern Recognition, Third Edition. Academic Press, Inc., 2006."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.48"},{"key":"e_1_3_2_1_58_1","unstructured":"D. A. Wheeler. SLOCCount. http:\/\/www.dwheeler.com\/sloccount\/.  D. A. Wheeler. SLOCCount. http:\/\/www.dwheeler.com\/sloccount\/."}],"event":{"name":"EuroSys '13: Eighth Eurosys Conference 2013","location":"Prague Czech Republic","acronym":"EuroSys '13","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 8th ACM European Conference on Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465351.2465359","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2465351.2465359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:36Z","timestamp":1750235976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465351.2465359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,15]]},"references-count":53,"alternative-id":["10.1145\/2465351.2465359","10.1145\/2465351"],"URL":"https:\/\/doi.org\/10.1145\/2465351.2465359","relation":{},"subject":[],"published":{"date-parts":[[2013,4,15]]},"assertion":[{"value":"2013-04-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}