{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:44Z","timestamp":1750306604570,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,4,14]],"date-time":"2015-04-14T00:00:00Z","timestamp":1428969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1320351"],"award-info":[{"award-number":["1320351"]}],"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":[[2015,4,14]]},"DOI":"10.1145\/2714576.2714631","type":"proceedings-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T16:27:14Z","timestamp":1428078434000},"page":"405-416","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Block Programs"],"prefix":"10.1145","author":[{"given":"Gang","family":"Xu","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering Iowa State University, Ames, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Amariucai","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering Iowa State University, Ames, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Guan","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering Iowa State University, Ames, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,4,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267824"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167174"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556674"},{"key":"e_1_3_2_1_5_1","volume-title":"On the concrete-efficiency threshold of probabilistically-checkable proofs. Electronic Colloquium on Computational Complexity (ECCC), 19:45","author":"Ben-Sasson E.","year":"2012","unstructured":"E. Ben-Sasson , A. Chiesa , D. Genkin , and E. Tromer . On the concrete-efficiency threshold of probabilistically-checkable proofs. Electronic Colloquium on Computational Complexity (ECCC), 19:45 , 2012 . E. Ben-Sasson, A. Chiesa, D. Genkin, and E. Tromer. On the concrete-efficiency threshold of probabilistically-checkable proofs. Electronic Colloquium on Computational Complexity (ECCC), 19:45, 2012."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422481"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_3_2_1_8_1","first-page":"781","volume-title":"Proceedings of the 23rd USENIX Security Symposium","author":"Ben-Sasson E.","year":"2014","unstructured":"E. Ben-Sasson , A. Chiesa , E. Tromer , and M. Virza . Succinct non-interactive zero knowledge for a von neumann architecture . In Proceedings of the 23rd USENIX Security Symposium , San Diego, CA, USA , August 20-22, 2014 , pages 781 -- 796 , 2014. E. Ben-Sasson, A. Chiesa, E. Tromer, and M. Virza. Succinct non-interactive zero knowledge for a von neumann architecture. In Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014, pages 781--796, 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522733"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2073732"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881445"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.10"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646760.705867"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465359"},{"key":"e_1_3_2_1_25_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_26_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_27_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.48"},{"key":"e_1_3_2_1_30_1","volume-title":"Verifying computations without reexecuting them: from theoretical possibility to near-practicality. Electronic Colloquium on Computational Complexity (ECCC), 20:165","author":"Walfish M.","year":"2013","unstructured":"M. Walfish and A. J. Blumberg . Verifying computations without reexecuting them: from theoretical possibility to near-practicality. Electronic Colloquium on Computational Complexity (ECCC), 20:165 , 2013 . M. Walfish and A. J. Blumberg. Verifying computations without reexecuting them: from theoretical possibility to near-practicality. Electronic Colloquium on Computational Complexity (ECCC), 20:165, 2013."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484253"}],"event":{"name":"ASIA CCS '15: 10th ACM Symposium on Information, Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Singapore Republic of Singapore","acronym":"ASIA CCS '15"},"container-title":["Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2714576.2714631","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2714576.2714631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:54Z","timestamp":1750227414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2714576.2714631"}},"subtitle":["Improving Efficiency of Verifiable Computation for Circuits with Repeated Substructures"],"short-title":[],"issued":{"date-parts":[[2015,4,14]]},"references-count":30,"alternative-id":["10.1145\/2714576.2714631","10.1145\/2714576"],"URL":"https:\/\/doi.org\/10.1145\/2714576.2714631","relation":{},"subject":[],"published":{"date-parts":[[2015,4,14]]},"assertion":[{"value":"2015-04-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}