{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T11:41:12Z","timestamp":1725018072890},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:00:00Z","timestamp":1508803200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1525044"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Madrid Regional Government","award":["N-Greens (S2013\/ICE- 2731)"]},{"name":"European Union","award":["NEXTLEAP (688722)"]},{"name":"Spanish Ministry of Economy","award":["DEDETIS (TIN2015-70713-R)","Juan de la Cierva Incorporacion fellowship to Dario Fiore"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,10,24]]},"DOI":"10.1145\/2976749.2978368","type":"proceedings-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T12:46:35Z","timestamp":1477399595000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Hash First, Argue Later"],"prefix":"10.1145","author":[{"given":"Dario","family":"Fiore","sequence":"first","affiliation":[{"name":"IMDEA Software Institute, Madrid, Spain"}]},{"given":"C\u00e9dric","family":"Fournet","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]},{"given":"Esha","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}]},{"given":"Markulf","family":"Kohlweiss","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]},{"given":"Olga","family":"Ohrimenko","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]},{"given":"Bryan","family":"Parno","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"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.1109\/SP.2015.24"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516681"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422481"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488681"},{"key":"e_1_3_2_1_7_1","volume-title":"Virza","author":"Ben-Sasson E.","year":"2013","unstructured":"Ben-Sasson , E. , Chiesa , A. , Genkin , D. , Tromer , E. , Virza , M. : SNARKs for C : verifying program executions succinctly and in zero knowledge. In : CRYPTO ( 2013 ) Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: verifying program executions succinctly and in zero knowledge. In: CRYPTO (2013)"},{"key":"e_1_3_2_1_8_1","volume-title":"Virza","author":"Ben-Sasson E.","year":"2014","unstructured":"Ben-Sasson , E. , Chiesa , A. , Tromer , E. , Virza , M. : Scalable zero knowledge via cycles of elliptic curves. In : CRYPTO ( 2014 ) Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: CRYPTO (2014)"},{"key":"e_1_3_2_1_9_1","volume-title":"Virza","author":"Ben-Sasson E.","year":"2014","unstructured":"Ben-Sasson , E. , Chiesa , A. , Tromer , E. , Virza , M. : Succinct non-interactive zero knowledge for a von Neumann architecture. In : USENIX Security ( 2014 ) Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von Neumann architecture. In: USENIX Security (2014)"},{"key":"e_1_3_2_1_10_1","volume-title":"Tromer","author":"Bitansky N.","year":"2014","unstructured":"Bitansky , N. , Canetti , R. , Chiesa , A. , Goldwasser , S. , Lin , H. , Rubinstein , A. , Tromer , E. : The hunting of the SNARK. Cryptology ePrint Archive, Report 2014 \/580 Bitansky, N., Canetti, R., Chiesa, A., Goldwasser, S., Lin, H., Rubinstein, A., Tromer, E.: The hunting of the SNARK. Cryptology ePrint Archive, Report 2014\/580"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591859"},{"key":"e_1_3_2_1_13_1","volume-title":"Rogaway","author":"Black J.","year":"1999","unstructured":"Black , J. , Halevi , S. , Krawczyk , H. , Krovetz , T. , Rogaway , P. : Umac: Fast and secure message authentication. In : crypto. vol. 1666 ( 1999 ) Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: Umac: Fast and secure message authentication. In: crypto. vol. 1666 (1999)"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522733"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509980"},{"key":"e_1_3_2_1_17_1","volume-title":"Warinschi","author":"Catalano D.","year":"2014","unstructured":"Catalano , D. , Fiore , D. , Warinschi , B. : Homomorphic signatures with efficient verification for polynomial functions. In : CRYPTO ( 2014 ) Catalano, D., Fiore, D., Warinschi, B.: Homomorphic signatures with efficient verification for polynomial functions. In: CRYPTO (2014)"},{"key":"e_1_3_2_1_18_1","first-page":"151","volume-title":"Raz","author":"Chung K.M.","year":"2011","unstructured":"Chung , K.M. , Kalai , Y.T. , Liu , F.H. , Raz , R. : Memory de legation. In : CRYPTO. pp. 151 -- 165 ( 2011 ) Chung, K.M., Kalai, Y.T., Liu, F.H., Raz, R.: Memory delegation. In: CRYPTO. pp. 151--165 (2011)"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.23"},{"key":"e_1_3_2_1_20_1","volume-title":"Kohlweiss","author":"Danezis G.","year":"2014","unstructured":"Danezis , G. , Fournet , C. , Groth , J. , Kohlweiss , M. : Square span programs with applications to succinct NIZK arguments. In : ASIACRYPT ( 2014 ) Danezis, G., Fournet, C., Groth, J., Kohlweiss, M.: Square span programs with applications to succinct NIZK arguments. In: ASIACRYPT (2014)"},{"key":"e_1_3_2_1_21_1","volume-title":"Stubblebine","author":"Devanbu P.T.","year":"2001","unstructured":"Devanbu , P.T. , Gertz , M. , Martel , C.U. , Stubblebine , S.G. : Authentic third-party data publication. In : IFIP TC11\/ WG 11.3 ( 2001 ) Devanbu, P.T., Gertz, M., Martel, C.U., Stubblebine, S.G.: Authentic third-party data publication. In: IFIP TC11\/ WG11.3 (2001)"},{"key":"e_1_3_2_1_22_1","volume-title":"Parno","author":"Fiore D.","year":"2016","unstructured":"Fiore , D. , Fournet , C. , Gosh , E. , Kohlweiss , M. , Ohrimenko , O. , Parno , B. : Hash first, argue later: Adaptive verifiable computations on outsourced data. Cryptology ePrint Archive ( 2016 ) Fiore, D., Fournet, C., Gosh, E., Kohlweiss, M., Ohrimenko, O., Parno, B.: Hash first, argue later: Adaptive verifiable computations on outsourced data. Cryptology ePrint Archive (2016)"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382250"},{"key":"e_1_3_2_1_24_1","volume-title":"Luo","author":"Fournet C.","year":"2013","unstructured":"Fournet , C. , Kohlweiss , M. , Danezis , G. , Luo , Z. : ZQL: A compiler for privacy-preserving data processing. In : USENIX Security ( 2013 ) Fournet, C., Kohlweiss, M., Danezis, G., Luo, Z.: ZQL: A compiler for privacy-preserving data processing. In: USENIX Security (2013)"},{"key":"e_1_3_2_1_25_1","volume-title":"Parno","author":"Gennaro R.","year":"2010","unstructured":"Gennaro , R. , Gentry , C. , Parno , B. : Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In : CRYPTO ( 2010 ) Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In: CRYPTO (2010)"},{"key":"e_1_3_2_1_26_1","volume-title":"Raykova","author":"Gennaro R.","year":"2013","unstructured":"Gennaro , R. , Gentry , C. , Parno , B. , Raykova , M. : Quadratic span programs and succinct NIZKs without PCPs . In : EUROCRYPT ( 2013 ) Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: EUROCRYPT (2013)"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746576"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_32_1","volume-title":"Goldberg","author":"Kate A.","year":"2010","unstructured":"Kate , A. , Zaverucha , G.M. , Goldberg , I. : Constant-size commitments to polynomials and their applications. In : ASIACRYPT ( 2010 ) Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: ASIACRYPT (2010)"},{"key":"e_1_3_2_1_34_1","volume-title":"Triandopoulos","author":"Kosba A.E.","year":"2014","unstructured":"Kosba , A.E. , Papadopoulos , D. , Papamanthou , C. , Sayed , M.F. , Shi , E. , Triandopoulos , N. : TRUESET: Faster verifiable set computations. In : USENIX Security ( 2014 ) Kosba, A.E., Papadopoulos, D., Papamanthou, C., Sayed, M.F., Shi, E., Triandopoulos, N.: TRUESET: Faster verifiable set computations. In: USENIX Security (2014)"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31517-1_10"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_1_37_1","volume-title":"IEEE Symposium on S&P (2005)","author":"Nguyen L.","unstructured":"Nguyen , L. : Accumulators from bilinear pairings and applications . In: IEEE Symposium on S&P (2005) Nguyen, L.: Accumulators from bilinear pairings and applications. In: IEEE Symposium on S&P (2005)"},{"key":"e_1_3_2_1_38_1","volume-title":"Triandopoulos","author":"Papamanthou C.","year":"2011","unstructured":"Papamanthou , C. , Tamassia , R. , Triandopoulos , N. : Optimal verification of operations on dynamic sets. In : CRYPTO ( 2011 ) Papamanthou, C., Tamassia, R., Triandopoulos, N.: Optimal verification of operations on dynamic sets. In: CRYPTO (2011)"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-658-07116-5","volume-title":"Authentication in Insecure Environments - Using Visual Cryptography and Non-Transferable Credentials in Practise","author":"Pape S.","year":"2014","unstructured":"Pape , S. : Authentication in Insecure Environments - Using Visual Cryptography and Non-Transferable Credentials in Practise . Springer ( 2014 ) Pape, S.: Authentication in Insecure Environments - Using Visual Cryptography and Non-Transferable Credentials in Practise. Springer (2014)"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046556.2046564"},{"key":"e_1_3_2_1_43_1","volume-title":"Walfish","author":"Setty S.","year":"2012","unstructured":"Setty , S. , McPherson , R. , Blumberg , A.J. , Walfish , M. : Making argument systems for outsourced computation practical (sometimes). In : Proc. ISOC NDSS ( 2012 ) Setty, S., McPherson, R., Blumberg, A.J., Walfish, M.: Making argument systems for outsourced computation practical (sometimes). In: Proc. ISOC NDSS (2012)"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_2"},{"key":"e_1_3_2_1_45_1","volume-title":"USENIX HotCloud Workshop (2012)","author":"Thaler J.","unstructured":"Thaler , J. , Roberts , M. , Mitzenmacher , M. , Pfister , H. : Verifiable computation with massively parallel interactive proofs . In: USENIX HotCloud Workshop (2012) Thaler, J., Roberts, M., Mitzenmacher, M., Pfister, H.: Verifiable computation with massively parallel interactive proofs. In: USENIX HotCloud Workshop (2012)"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802616"},{"key":"e_1_3_2_1_47_1","volume-title":"Proc. of the ISOC NDSS (Feb 2015)","author":"Wahby R.S.","unstructured":"Wahby , R.S. , Setty , S. , Ren , Z. , Blumberg , A.J. , Walfish , M. : Efficient RAM and control flow in verifiable outsourced computation . In: Proc. of the ISOC NDSS (Feb 2015) Wahby, R.S., Setty, S., Ren, Z., Blumberg, A.J., Walfish, M.: Efficient RAM and control flow in verifiable outsourced computation. In: Proc. of the ISOC NDSS (Feb 2015)"}],"event":{"name":"CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security","location":"Vienna Austria","acronym":"CCS'16","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978368","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T16:19:58Z","timestamp":1692548398000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978368"}},"subtitle":["Adaptive Verifiable Computations on Outsourced Data"],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":46,"alternative-id":["10.1145\/2976749.2978368","10.1145\/2976749"],"URL":"http:\/\/dx.doi.org\/10.1145\/2976749.2978368","relation":{},"subject":[],"published":{"date-parts":[[2016,10,24]]},"assertion":[{"value":"2016-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
