{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:49Z","timestamp":1740098929793,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319598697"},{"type":"electronic","value":"9783319598703"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59870-3_7","type":"book-chapter","created":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T22:14:17Z","timestamp":1496096057000},"page":"115-134","source":"Crossref","is-referenced-by-count":3,"title":["Prover Efficient Public Verification of Dense or Sparse\/Structured Matrix-Vector Multiplication"],"prefix":"10.1007","author":[{"given":"Jean-Guillaume","family":"Dumas","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Zucca","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). doi:\n10.1007\/11693383_22"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-15031-9_3","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"G Bertoni","year":"2010","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.: Sponge-based pseudo-random number generators. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 33\u201347. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-15031-9_3"},{"issue":"3","key":"7_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1391989.1391992","volume":"35","author":"JG Dumas","year":"2008","unstructured":"Dumas, J.G., Giorgi, P., Pernet, C.: Dense linear algebra over prime fields: the FFLAS and FFPACK packages. ACM Trans. Math. Softw. 35(3), 1\u201342 (2008)","journal-title":"ACM Trans. Math. Softw."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Elkhiyaoui, K., \u00d6nen, M., Azraoui, M., Molva, R.: Efficient techniques for publicly verifiable delegation of computation. In: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, ASIA CCS 2016, pp. 119\u2013128. ACM, New York (2016)","DOI":"10.1145\/2897845.2897910"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). doi:\n10.1007\/3-540-47721-7_12"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS 2012, pp. 501\u2013512. ACM, New York (2012)","DOI":"10.1145\/2382196.2382250"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-09526-8_5","volume-title":"Mathematical Foundations of Computer Science 1979","author":"R Freivalds","year":"1979","unstructured":"Freivalds, R.: Fast probabilistic algorithms. In: Be\u010dv\u00e1\u0159, J. (ed.) MFCS 1979, vol. 74, pp. 57\u201369. Springer, Heidelberg (1979)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Dwork, C. (ed.) STOC 2008, pp. 113\u2013122. ACM Press, May 2008","DOI":"10.1145\/1374376.1374396"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC 2014, pp. 296\u2013303. ACM, New York (2014)","DOI":"10.1145\/2608628.2608664"},{"key":"7_CR10","unstructured":"Lynn, B.: The pairing-based cryptography (PBC) library (2010). \nhttps:\/\/crypto.stanford.edu\/pbc"},{"key":"7_CR11","unstructured":"NIST: FIPS publication 202: SHA-3 standard: permutation-based hash and extendable-output functions, August 2015"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: Nearly practical verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, SP 2013, Berkeley, CA, USA, 19\u201322 May 2013, pp. 238\u2013252. IEEE Computer Society (2013). \nhttp:\/\/dx.doi.org\/10.1109\/SP.2013.47","DOI":"10.1109\/SP.2013.47"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-28914-9_24","volume-title":"Theory of Cryptography","author":"B Parno","year":"2012","unstructured":"Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 422\u2013439. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-28914-9_24"},{"key":"7_CR14","unstructured":"Setty, S.T.V., McPherson, R., Blumberg, A.J., Walfish, M.: Making argument systems for outsourced computation practical (sometimes). In: 19th Annual Network and Distributed System Security Symposium, NDSS 2012, San Diego, California, USA, 5\u20138 February 2012. The Internet Society (2012). \nhttp:\/\/www.internetsociety.org\/sites\/default\/files\/04_3.pdf"},{"issue":"2","key":"7_CR15","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/2641562","volume":"58","author":"M Walfish","year":"2015","unstructured":"Walfish, M., Blumberg, A.J.: Verifying computations without reexecuting them. Commun. ACM 58(2), 74\u201384 (2015)","journal-title":"Commun. ACM"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-13257-0_10","volume-title":"Information Security","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Blanton, M.: Efficient secure and verifiable outsourcing of matrix multiplications. In: Chow, S.S.M., Camenisch, J., Hui, L.C.K., Yiu, S.M. (eds.) ISC 2014. LNCS, vol. 8783, pp. 158\u2013178. Springer, Cham (2014). doi:\n10.1007\/978-3-319-13257-0_10"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59870-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T22:17:07Z","timestamp":1496096227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59870-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319598697","9783319598703"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59870-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}