{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T20:05:11Z","timestamp":1778789111932,"version":"3.51.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319132563","type":"print"},{"value":"9783319132570","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13257-0_10","type":"book-chapter","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T10:43:57Z","timestamp":1415011437000},"page":"158-178","source":"Crossref","is-referenced-by-count":31,"title":["Efficient Secure and Verifiable Outsourcing of Matrix Multiplications"],"prefix":"10.1007","author":[{"given":"Yihua","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Blanton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-01957-9_18","volume-title":"Applied Cryptography and Network Security","author":"S. Agrawal","year":"2009","unstructured":"Agrawal, S., Boneh, D.: Homomorphic MACs: MAC-based integrity for network coding. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol.\u00a05536, pp. 292\u2013305. Springer, Heidelberg (2009)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: Efficient verification via secure computation. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol.\u00a06198, pp. 152\u2013163. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14165-2_14"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Atallah, M., Blanton, M. (eds.): Algorithms and Theory of Computation Handbook. General Concepts and Techniques, vol.\u00a0I, ch. 17. CRC Press (2009)","DOI":"10.1201\/9781584888239"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Atallah, M., Frikken, K.: Securely outsourcing linear algebra computations. In: ASIACCS, pp. 48\u201359 (2010)","DOI":"10.1145\/1755688.1755695"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Atallah, M., Frikken, K., Wang, S.: Private outsourcing of matrix multiplication over closed semi-rings. In: SECRYPT, pp. 136\u2013144 (2012)","DOI":"10.5220\/0004054101360144"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Micali, S.: Rational proofs. In: STOC, pp. 1017\u20131028 (2012)","DOI":"10.1145\/2213977.2214069"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Micali, S.: Super efficient rational proofs. In: EC, pp. 29\u201330 (2013)","DOI":"10.1145\/2492002.2482561"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: STOC, pp. 421\u2013429 (1985)","DOI":"10.1145\/22145.22192"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Backes, M., Fiore, D., Reischuk, R.M.: Verifiable delegation of computation on outsourced data. In: CCS, pp. 863\u2013874 (2013)","DOI":"10.1145\/2508859.2516681"},{"key":"10_CR10","unstructured":"Ballard, L., Green, M., Medeiros, B., Monrose, F.: Correlation-resistant storage via keyword-searchable encryption. Cryptology ePrint Archive 2005\/417 (2005)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/3-540-46035-7_21","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"E. Bresson","year":"2002","unstructured":"Bresson, E., Chevassut, O., Pointcheval, D.: Dynamic group diffie-hellman key exchange under standard assumptions. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 321\u2013336. Springer, Heidelberg (2002)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/978-3-642-36594-2_38","volume-title":"Theory of Cryptography","author":"D. Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D., Gennaro, R., Vamvourellis, K.: Algebraic (trapdoor) one-way functions and their applications. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 680\u2013699. Springer, Heidelberg (2013)"},{"key":"10_CR14","unstructured":"CertiVox. Benchmarks and Subs performance for MIRACL library, https:\/\/certivox.org\/display\/EXT\/Benchmarks+and+Subs"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-22792-9_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"K.-M. Chung","year":"2011","unstructured":"Chung, K.-M., Kalai, Y.T., Liu, F.-H., Raz, R.: Memory delegation. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 151\u2013168. Springer, Heidelberg (2011)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-14623-7_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"K.-M. Chung","year":"2010","unstructured":"Chung, K.-M., Kalai, Y., Vadhan, S.: Improved delegation of computation using fully homomorphic encryption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 483\u2013501. Springer, Heidelberg (2010)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44598-6_7","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Dodis","year":"2000","unstructured":"Dodis, Y., Halevi, S., Rabin, T.: A cryptographic solution to a game theoretic problem. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 112\u2013130. Springer, Heidelberg (2000)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: CCS, pp. 501\u2013512 (2012)","DOI":"10.1145\/2382196.2382250"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Garay, J., Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Rational protocol design: Cryptography against incentive-driven adversaries. In: FOCS, pp. 648\u2013657 (2013)","DOI":"10.1109\/FOCS.2013.75"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R. Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 465\u2013482. Springer, Heidelberg (2010)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: Interactive proofs for muggles. In: STOC, pp. 113\u2013122 (2008)","DOI":"10.1145\/1374376.1374396"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Guo, S., Hub\u00e1\u010dek, S., Rosen, A., Vald, M.: Rational arguments: Single round delegation with sublinear verification. In: ITCS, pp. 523\u2013540 (2014)","DOI":"10.1145\/2554797.2554845"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation: Extended abstract. In: STOC, pp. 623\u2013632 (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45760-7_17","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"R. Johnson","year":"2002","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, pp. 244\u2013262. Springer, Heidelberg (2002)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Improved efficient arguments (Preliminary version). In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 311\u2013324. Springer, Heidelberg (1995)","DOI":"10.1007\/3-540-44750-4_25"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Landerman, J., Pan, V., Sha, X.-H.: On practical algorithms for accelerated matrix mutiplication. Linear Algebra and Its Applications 162\u2013164, 557\u2013588","DOI":"10.1016\/0024-3795(92)90393-O"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Micali, S.: CS proofs. In: FOCS, pp. 436\u2013453 (1994)","DOI":"10.1109\/SFCS.1994.365746"},{"key":"10_CR30","unstructured":"Mohassel, P.: Efficient and secure delegation of linear algebra. Cryptology ePrint Archive 2011\/605 (2011)"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: Nearly practical verifiable computation. In: IEEE Symposium on Security and Privacy (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"10_CR32","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.\u00a07194, pp. 422\u2013439. Springer, Heidelberg (2012)"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-319-02937-5_18","volume-title":"Cryptology and Network Security","author":"L.F. Zhang","year":"2013","unstructured":"Zhang, L.F., Safavi-Naini, R.: Private outsourcing of polynomial evaluation and matrix multiplication using multilinear maps. In: Abdalla, M., Nita-Rotaru, C., Dahab, R. (eds.) CANS 2013. LNCS, vol.\u00a08257, pp. 329\u2013348. Springer, Heidelberg (2013)"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Blanton, M.: Efficient secure and verifiable outsourcing of matrix multiplications. Cryptology ePrint Archive 2014\/133 (2014)","DOI":"10.1007\/978-3-319-13257-0_10"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13257-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T05:51:18Z","timestamp":1746510678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13257-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319132563","9783319132570"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13257-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}