{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:41:47Z","timestamp":1787017307714,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T00:00:00Z","timestamp":1414972800000},"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":[[2014,11,3]]},"DOI":"10.1145\/2660267.2660354","type":"proceedings-article","created":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T08:40:05Z","timestamp":1415695205000},"page":"856-867","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["ALITHEIA"],"prefix":"10.1145","author":[{"given":"Yupeng","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"https:\/\/www.openssl.org\/docs\/crypto\/hmac.html.  https:\/\/www.openssl.org\/docs\/crypto\/hmac.html."},{"key":"e_1_3_2_1_2_1","unstructured":"http:\/\/www.algorithmic-solutions.com\/leda\/index.htm.  http:\/\/www.algorithmic-solutions.com\/leda\/index.htm."},{"key":"e_1_3_2_1_3_1","unstructured":"http:\/\/www.dis.uniroma1.it\/challenge9\/.  http:\/\/www.dis.uniroma1.it\/challenge9\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/648025.744371"},{"key":"e_1_3_2_1_6_1","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Battista G. D.","year":"1998","unstructured":"G. D. Battista , P. Eades , R. Tamassia , and I. G. Tollis . Graph Drawing: Algorithms for the Visualization of Graphs . Prentice Hall PTR , Upper Saddle River, NJ, USA, 1998 G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1998"},{"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","volume-title":"USENIX Security","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 USENIX Security , 2014 . E. Ben-Sasson, A. Chiesa, E. Tromer, and M. Virza. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. In USENIX Security, 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488623"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522733"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881446"},{"key":"e_1_3_2_1_15_1","volume-title":"Introduction to Algorithms (Vol. 3.)","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms (Vol. 3.) . MIT Press , 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (Vol. 3.). MIT Press, 2009."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.007"},{"key":"e_1_3_2_1_17_1","first-page":"26","author":"Fox-Epstein E.","year":"2013","unstructured":"E. Fox-Epstein , S. Mozes , P. M. Phothilimthana , and C. Sommer . Short and Simple Cycle Separators in Planar Graphs. In ALENEX , pp. 26 -- 40 , 2013 . E. Fox-Epstein, S. Mozes, P. M. Phothilimthana, and C. Sommer. Short and Simple Cycle Separators in Planar Graphs. In ALENEX, pp. 26--40, 2013.","journal-title":"Short and Simple Cycle Separators in Planar Graphs. In ALENEX"},{"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.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9355-7"},{"key":"e_1_3_2_1_21_1","volume-title":"USENIX Security","author":"Kosba A. E.","year":"2014","unstructured":"A. E. Kosba , D. Papadopoulos , C. Papamanthou , M. F. Sayed , E. Shi , and N. Triandopoulos . TrueSet: Faster Verifiable Set Computations . In USENIX Security , 2014 . A. E. Kosba, D. Papadopoulos, C. Papamanthou, M. F. Sayed, E. Shi, and N. Triandopoulos. TrueSet: Faster Verifiable Set Computations. In USENIX Security, 2014."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/646754.705190"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_2"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_22"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1785001.1785003"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033045"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2010.09.009"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465359"},{"key":"e_1_3_2_1_33_1","volume-title":"NDSS","author":"Setty S. T. V.","year":"2012","unstructured":"S. T. V. Setty , R. McPherson , A. J. Blumberg , and M. Walfish . Making Argument Systems for Outsourced Computation Practical (sometimes) . In NDSS , 2012 . S. T. V. 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_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_2"},{"key":"e_1_3_2_1_35_1","volume-title":"AMW","author":"Tamassia R.","year":"2010","unstructured":"R. Tamassia and N. Triandopoulos . Certification and Authentication of Data Structures . In AMW , 2010 . R. Tamassia and N. Triandopoulos. Certification and Authentication of Data Structures. In AMW, 2010."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.48"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447914"}],"event":{"name":"CCS'14: 2014 ACM SIGSAC Conference on Computer and Communications Security","location":"Scottsdale Arizona USA","acronym":"CCS'14","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660354","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660267.2660354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:39Z","timestamp":1750212819000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660354"}},"subtitle":["Towards Practical Verifiable Graph Processing"],"short-title":[],"issued":{"date-parts":[[2014,11,3]]},"references-count":37,"alternative-id":["10.1145\/2660267.2660354","10.1145\/2660267"],"URL":"https:\/\/doi.org\/10.1145\/2660267.2660354","relation":{},"subject":[],"published":{"date-parts":[[2014,11,3]]},"assertion":[{"value":"2014-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}