{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:23:19Z","timestamp":1742912599815,"version":"3.40.3"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99639-4_1","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T15:43:34Z","timestamp":1534952614000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Proof-of-Work Certificates that Can Be Efficiently Computed in the Cloud (Invited Talk)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2591-172X","authenticated-orcid":false,"given":"Jean-Guillaume","family":"Dumas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/1490270.1490272","volume":"1","author":"S Aaronson","year":"2009","unstructured":"Aaronson, S., Wigderson, A.: Algebrization: a new barrier in complexity theory. ACM Trans. Comput. Theory 1(1), 2:1\u20132:54 (2009). https:\/\/doi.org\/10.1145\/1490270.1490272","journal-title":"ACM Trans. Comput. Theory"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-42547-4_3","volume-title":"Intelligent Computer Mathematics","author":"E \u00c1brah\u00e1m","year":"2016","unstructured":"\u00c1brah\u00e1m, E., et al.: $${\\sf SC}^{\\sf 2}$$ : satisfiability checking meets symbolic computation. In: Kohlhase, M., Johansson, M., Miller, B., de de Moura, L., Tompa, F. (eds.) CICM 2016. LNCS (LNAI), vol. 9791, pp. 28\u201343. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42547-4_3 . https:\/\/members.loria.fr\/PFontaine\/Abraham1.pdf"},{"doi-asserted-by":"crossref","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs; a new characterization of NP. In: 33rd Annual Symposium on Foundations of Computer Science, 24\u201327 October 1992, pp. 2\u201313. IEEE, Pittsburgh (1992)","key":"1_CR3","DOI":"10.1109\/SFCS.1992.267824"},{"unstructured":"Arreche, C. (ed.): ISSAC 2018, Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, New York, USA. ACM Press, New York, July 2018","key":"1_CR4"},{"doi-asserted-by":"publisher","unstructured":"Babai, L.: Trading group theory for randomness. In: Sedgewick [54], pp. 421\u2013429. https:\/\/doi.org\/10.1145\/22145.22192","key":"1_CR5","DOI":"10.1145\/22145.22192"},{"doi-asserted-by":"publisher","unstructured":"Babai, L., Fortnow, L., Lund, C.: Nondeterministic exponential time has two-prover interactive protocols. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, vol. 1, pp. 16\u201325, October 1990. https:\/\/doi.org\/10.1109\/FSCS.1990.89520","key":"1_CR6","DOI":"10.1109\/FSCS.1990.89520"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-30580-4_11","volume-title":"Public Key Cryptography - PKC 2005","author":"E Bangerter","year":"2005","unstructured":"Bangerter, E., Camenisch, J., Maurer, U.: Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 154\u2013171. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_11"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/0215070","volume":"15","author":"PW Beame","year":"1986","unstructured":"Beame, P.W., Cook, S.A., Hoover, H.J.: Log depth circuits for division and related problems. SIAM J. Comput. 15, 994\u20131003 (1986). https:\/\/doi.org\/10.1137\/0215070","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Ashby, V. (ed.) Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM Press, Fairfax, November 1993. http:\/\/www-cse.ucsd.edu\/users\/mihir\/papers\/ro.pdf","key":"1_CR9","DOI":"10.1145\/168588.168596"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-319-56617-7_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"E Ben-Sasson","year":"2017","unstructured":"Ben-Sasson, E., et al.: Computational integrity with a public random string from quasi-linear PCPs. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part III. LNCS, vol. 10212, pp. 551\u2013579. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_19"},{"unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018\/046 (2018). https:\/\/eprint.iacr.org\/2018\/046","key":"1_CR11"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. J. ACM 42(1), 269\u2013291 (1995). http:\/\/www.icsi.berkeley.edu\/pubs\/techreports\/tr-88-009.pdf","journal-title":"J. ACM"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 319\u2013338 (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","key":"1_CR14","DOI":"10.1109\/SP.2018.00020"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-45641-6_10","volume-title":"Computer Algebra in Scientific Computing","author":"CS Calude","year":"2016","unstructured":"Calude, C.S., Thompson, D.: Incompleteness, undecidability and automated proofs. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2016. LNCS, vol. 9890, pp. 134\u2013155. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45641-6_10"},{"unstructured":"Chyzak, F., Mahboubi, A., Sibut-Pinote, T., Tassi, E.: A computer-algebra-based formal proof of the irrationality of $$\\zeta $$ (3). In: ITP - 5th International Conference on Interactive Theorem Proving, Vienna, Austria (2014). https:\/\/hal.inria.fr\/hal-00984057","key":"1_CR16"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280\u2013300. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_18"},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"RA DeMillo","year":"1978","unstructured":"DeMillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Proces. Lett. 7(4), 193\u2013195 (1978). https:\/\/doi.org\/10.1016\/0020-0190(78)90067-4","journal-title":"Inf. Proces. Lett."},{"doi-asserted-by":"crossref","unstructured":"Dumas, J.G., Giorgi, P., Elbaz-Vincent, P., Urba\u0144ska, A.: Parallel computation of the rank of large sparse matrices from algebraic k-theory. In: Moreno-Maza, M., Watt, S. (eds.) PASCO 2007, Proceedings of the 3rd ACM International Workshop on Parallel Symbolic Computation, pp. 43\u201352. Waterloo University, Ontario, July 2007. http:\/\/hal.archives-ouvertes.fr\/hal-00142141","key":"1_CR19","DOI":"10.1145\/1278177.1278186"},{"doi-asserted-by":"publisher","unstructured":"Dumas, J.G., Kaltofen, E.: Essentially optimal interactive certificates in linear algebra. In: Nabeshima [46], pp. 146\u2013153. https:\/\/doi.org\/10.1145\/2608628.2608644 , http:\/\/hal.archives-ouvertes.fr\/hal-00932846","key":"1_CR20","DOI":"10.1145\/2608628.2608644"},{"unstructured":"Dumas, J.G., Kaltofen, E., Thom\u00e9, E.: Interactive certificate for the verification of Wiedemann\u2019s Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices. Technical report, IMAG-hal-01171249 arXiv cs.SC\/1507.01083, January 2016. http:\/\/hal.archives-ouvertes.fr\/hal-01171249","key":"1_CR21"},{"doi-asserted-by":"publisher","unstructured":"Dumas, J.G., Kaltofen, E., Thom\u00e9, E., Villard, G.: Linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix. In: Gao [34], pp. 199\u2013206. https:\/\/doi.org\/10.1145\/2930889.2930908 , http:\/\/hal.archives-ouvertes.fr\/hal-01266041","key":"1_CR22","DOI":"10.1145\/2930889.2930908"},{"doi-asserted-by":"publisher","unstructured":"Dumas, J.G., Kaltofen, E., Villard, G., Zhi, L.: Polynomial time interactive proofs for linear algebra with exponential matrix dimensions and scalars given by polynomial time circuits. In: Safey El Din [52], pp. 125\u2013132. https:\/\/doi.org\/10.1145\/3087604.3087640 , http:\/\/ljk.imag.fr\/membres\/Jean-Guillaume.Dumas\/Publications\/DKVZ17.pdf","key":"1_CR23","DOI":"10.1145\/3087604.3087640"},{"doi-asserted-by":"publisher","unstructured":"Dumas, J.G., Lucas, D., Pernet, C.: Certificates for triangular equivalence and rank profiles. In: Safey El Din [52], pp. 133\u2013140. https:\/\/doi.org\/10.1145\/3087604.3087609 , http:\/\/hal.archives-ouvertes.fr\/hal-01466093","key":"1_CR24","DOI":"10.1145\/3087604.3087609"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-59870-3_7","volume-title":"Information Security and Privacy","author":"J-G Dumas","year":"2017","unstructured":"Dumas, J.-G., Zucca, V.: Prover efficient public verification of dense or sparse\/structured matrix-vector multiplication. In: Pieprzyk, J., Suriadi, S. (eds.) ACISP 2017. LNCS, vol. 10343, pp. 115\u2013134. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59870-3_7 . http:\/\/hal.archives-ouvertes.fr\/hal-01503870"},{"unstructured":"Eberly, W.: A new interactive certificate for matrix rank. Technical report 2015\u20131078-11, University of Calgary, June 2015. http:\/\/prism.ucalgary.ca\/bitstream\/1880\/50543\/1\/2015-1078-11.pdf","key":"1_CR26"},{"doi-asserted-by":"crossref","unstructured":"Eberly, W.: Selecting algorithms for black box matrices: checking for matrix properties that can simplify computations. In: Gao [34]","key":"1_CR27","DOI":"10.1145\/2930889.2930894"},{"doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/2897845.2897910","key":"1_CR28","DOI":"10.1145\/2897845.2897910"},{"doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/3-540-47721-7_12 . http:\/\/www.cs.rit.edu\/~jjk8346\/FiatShamir.pdf","key":"1_CR29","DOI":"10.1007\/3-540-47721-7_12"},{"unstructured":"Fiore, D., Fournet, C., Ghosh, E., Kohlweiss, M., Ohrimenko, O., Parno, B.: Hash first, argue later: adaptive verifiable computations on outsourced data. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 1304\u20131316. ACM (2016). http:\/\/doi.acm.org\/10.1145\/2976749.2978368","key":"1_CR30"},{"doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/2382196.2382250","key":"1_CR31","DOI":"10.1145\/2382196.2382250"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. LNCS, vol. 74, pp. 57\u201369. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09526-8_5"},{"unstructured":"Furer, M., Goldreich, O., Mansour, Y., Sipser, M., Zachos, S.: On completeness and soundness in interactive proof systems. In: Micali, S. (ed.) Randomness and Computation. Advances in Computing Research, vol. 5, pp. 429\u2013442. JAI Press, Greenwich (1989). http:\/\/www.wisdom.weizmann.ac.il\/~oded\/PS\/fgmsz.ps","key":"1_CR33"},{"unstructured":"Gao, X.S. (ed.): ISSAC 2016, Proceedings of the 2016 ACM International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada. ACM Press, New York, July 2016","key":"1_CR34"},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-016-0202-3","volume":"79","author":"L G\u0105sieniec","year":"2016","unstructured":"G\u0105sieniec, L., Levcopoulos, C., Lingas, A., Pagh, R., Tokuyama, T.: Efficiently correcting matrix products. Algorithmica 79, 1\u201316 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0202-3","journal-title":"Algorithmica"},{"key":"1_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-014-9184-y","volume":"28","author":"C Gentry","year":"2014","unstructured":"Gentry, C., Groth, J., Ishai, Y., Peikert, C., Sahai, A., Smith, A.: Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs. J. Cryptol. 28, 1\u201324 (2014). https:\/\/doi.org\/10.1007\/s00145-014-9184-y","journal-title":"J. Cryptol."},{"doi-asserted-by":"crossref","unstructured":"Giorgi, P., Neiger, V.: Certification of minimal approximant bases. In: Arreche [4]","key":"1_CR37","DOI":"10.1145\/3208976.3208991"},{"doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Dwork, C. (ed.) STOC 2008, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, pp. 113\u2013122. ACM Press, May 2008. https:\/\/doi.org\/10.1145\/1374376.1374396 , http:\/\/research.microsoft.com\/en-us\/um\/people\/yael\/publications\/2008-delegatingcomputation.pdf","key":"1_CR38","DOI":"10.1145\/1374376.1374396"},{"doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Sedgewick [54], pp. 291\u2013304. https:\/\/doi.org\/10.1145\/22145.22178","key":"1_CR39","DOI":"10.1145\/22145.22178"},{"doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Trager, B.: Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators. J. Symb. Comput. 9(3), 301\u2013320 (1990). http:\/\/www.math.ncsu.edu\/~kaltofen\/bibliography\/90\/KaTr90.pdf","key":"1_CR40","DOI":"10.1016\/S0747-7171(08)80015-6"},{"issue":"210","key":"1_CR41","doi-asserted-by":"publisher","first-page":"777","DOI":"10.2307\/2153451","volume":"64","author":"E Kaltofen","year":"1995","unstructured":"Kaltofen, E.: Analysis of Coppersmith\u2019s block Wiedemann algorithm for the parallel solution of sparse linear systems. Math. Comput. 64(210), 777\u2013806 (1995). https:\/\/doi.org\/10.2307\/2153451","journal-title":"Math. Comput."},{"unstructured":"Kaltofen, E., Pernet, C.: Sparse polynomial interpolation codes and their decoding beyond half the minimum distance. In: Nabeshima [46]. http:\/\/arxiv.org\/abs\/1403.3594","key":"1_CR42"},{"doi-asserted-by":"crossref","unstructured":"Kaltofen, E.L., Nehring, M., Saunders, B.D.: Quadratic-time certificates in linear algebra. In: Leykin, A. (ed.) ISSAC 2011, Proceedings of the 2011 ACM International Symposium on Symbolic and Algebraic Computation, San Jose, California, USA, pp. 171\u2013176. ACM Press, New York, June 2011. http:\/\/www.math.ncsu.edu\/~kaltofen\/bibliography\/11\/KNS11.pdf","key":"1_CR43","DOI":"10.1145\/1993886.1993915"},{"unstructured":"Kimbrel, T., Sinha, R.K.: A probabilistic algorithm for verifying matrix products using $$O(n^2)$$ time and $$\\log _2 n + O(1)$$ random bits. Inf. Proces. Lett. 45(2), 107\u2013110 (1993). ftp:\/\/trout.cs.washington.edu\/tr\/1991\/08\/UW-CSE-91-08-06.pdf","key":"1_CR44"},{"issue":"4","key":"1_CR45","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (1992). https:\/\/doi.org\/10.1145\/146585.146605","journal-title":"J. ACM"},{"unstructured":"Nabeshima, K. (ed.): ISSAC 2014, Proceedings of the 2014 ACM International Symposium on Symbolic and Algebraic Computation, Kobe, Japan. ACM Press, New York, Jul 2014","key":"1_CR46"},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5","volume-title":"Symbolic and Algebraic Computation","year":"1979","unstructured":"Ng, E.W. (ed.): Symbolic and Algebraic Computation. LNCS, vol. 72. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5"},{"doi-asserted-by":"publisher","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: Proceedings of the 2013 IEEE Symposium on Security and Privacy, SP 2013, pp. 238\u2013252. IEEE Computer Society, Washington, DC (2013). https:\/\/doi.org\/10.1109\/SP.2013.47","key":"1_CR48","DOI":"10.1109\/SP.2013.47"},{"key":"1_CR49","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). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_24"},{"doi-asserted-by":"publisher","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 49\u201362. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897652 , http:\/\/dl.acm.org\/citation.cfm?id=2897518","key":"1_CR50","DOI":"10.1145\/2897518.2897652"},{"doi-asserted-by":"crossref","unstructured":"Roche, D.: Error correction in fast matrix multiplication and inverse. In: Arreche [4]","key":"1_CR51","DOI":"10.1145\/3208976.3209001"},{"unstructured":"Safey El Din, M. (ed.): ISSAC 2017, Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation, Kaiserslautern, Deutschland. ACM Press, New York, July 2017","key":"1_CR52"},{"doi-asserted-by":"publisher","unstructured":"Schwartz, J.T.: Probabilistic algorithms for verification of polynomial identities. In: Ng [47], pp. 200\u2013215. https:\/\/doi.org\/10.1007\/3-540-09519-5_72","key":"1_CR53","DOI":"10.1007\/3-540-09519-5_72"},{"unstructured":"Sedgewick, R. (ed.): STOC 1985, ACM Symposium on Theory of Computing, Providence, Rhode Island, USA. ACM Press, New York, May 1985","key":"1_CR54"},{"issue":"4","key":"1_CR55","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A Shamir","year":"1992","unstructured":"Shamir, A.: IP = PSPACE. J. ACM 39(4), 869\u2013877 (1992). https:\/\/doi.org\/10.1145\/146585.146609","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Storjohann, A.: Integer matrix rank certification. In: May, J.P. (ed.) ISSAC 2009, Proceedings of the 2009 ACM International Symposium on Symbolic and Algebraic Computation, Seoul, Korea, pp. 333\u2013340. ACM Press, New York, Jul 2009. https:\/\/cs.uwaterloo.ca\/~astorjoh\/issac09.pdf","key":"1_CR56","DOI":"10.1145\/1576702.1576748"},{"key":"1_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-40084-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J Thaler","year":"2013","unstructured":"Thaler, J.: Time-optimal interactive proofs for circuit evaluation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 71\u201389. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_5"},{"issue":"2","key":"1_CR58","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/2641562","journal-title":"Commun. ACM"},{"issue":"1","key":"1_CR59","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"DH Wiedemann","year":"1986","unstructured":"Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory 32(1), 54\u201362 (1986). https:\/\/doi.org\/10.1109\/TIT.1986.1057137","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR60","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). https:\/\/doi.org\/10.1007\/978-3-319-13257-0_10"},{"doi-asserted-by":"publisher","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng [47], pp. 216\u2013226. https:\/\/doi.org\/10.1007\/3-540-09519-5_73","key":"1_CR61","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99639-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T15:36:45Z","timestamp":1571758605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99639-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99639-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}