B. Beckerman and G. Labahn, A Uniform Approach for the Fast Computation of Matrix-Type Pad?? Approximants, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.3, pp.804-82310, 1994.
DOI : 10.1137/S0895479892230031

L. Chen, W. Eberly, E. L. Kaltofen, B. D. Saunders, W. J. Turner et al., Efficient matrix preconditioners for black box linear algebra, Linear Algebra and its Applications, vol.343, issue.344, pp.343-344119, 2002.
DOI : 10.1016/S0024-3795(01)00472-4

K. Chung, Y. T. Kalai, and S. P. Vadhan, Improved Delegation of Computation Using Fully Homomorphic Encryption, LNCS, vol.6223, pp.483-501978, 2010.
DOI : 10.1007/978-3-642-14623-7_26

D. Coppersmith, Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm, Mathematics of Computation, vol.62, issue.205, pp.333-35010, 1994.
DOI : 10.2307/2153413

R. Cramer, Modular Design of Secure Yet Practical Cryptographic Protocols, 1997.

J. Dumas, E. Kaltofen, and E. Thomé, Certificates for the verification of Wiedemann's Krylov sequence, 2016.

J. Dumas and E. L. Kaltofen, Essentially optimal interactive certificates in linear algebra, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.146-153, 2014.
DOI : 10.1145/2608628.2608644
URL : https://hal.archives-ouvertes.fr/hal-00932846

W. Eberly and E. Kaltofen, On randomized Lanczos algorithms, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.176-183
DOI : 10.1145/258726.258776

D. Fiore and R. Gennaro, Publicly verifiable delegation of large polynomials and matrix computations, with applications, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, pp.501-512
DOI : 10.1145/2382196.2382250

R. Freivalds, Fast probabilistic algorithms, Mathematical Foundations of Computer Science, pp.57-69, 1979.
DOI : 10.1007/3-540-09526-8_5

C. Gentry, J. Groth, Y. Ishai, C. Peikert, A. Sahai et al., Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs, Journal of Cryptology, vol.28, issue.4, pp.1-24
DOI : 10.1007/s00145-014-9184-y

S. Goldwasser, Y. T. Kalai, and G. N. Rothblum, Delegating computation: interactive proofs for muggles, pp.113-122, 2008.
DOI : 10.1145/1374376.1374396

E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Math. Comp, vol.64, issue.210, pp.777-80610, 1995.

E. Kaltofen and V. Pan, Processor efficient parallel solution of linear systems over an abstract field, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures , SPAA '91, pp.180-191, 1991.
DOI : 10.1145/113379.113396

E. Kaltofen and G. Villard, On the complexity of computing determinants, computational complexity, vol.13, issue.3-4, pp.91-130, 2005.
DOI : 10.1007/s00037-004-0185-3

E. L. Kaltofen, B. Li, Z. Yang, and L. Zhi, Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients, Journal of Symbolic Computation, vol.47, issue.1, pp.1-15, 2012.
DOI : 10.1016/j.jsc.2011.08.002

E. L. Kaltofen, M. Nehring, and B. D. Saunders, Quadratic-time certificates in linear algebra, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.171-17610, 2011.
DOI : 10.1145/1993886.1993915

B. Parno, J. Howell, C. Gentry, and M. Raykova, Pinocchio, IEEE SP '13, pp.238-252, 2013.
DOI : 10.1145/2856449

J. T. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities, Journal of the ACM, vol.27, issue.4, pp.701-717, 1980.
DOI : 10.1145/322217.322225

J. Thaler, Time-Optimal Interactive Proofs for Circuit Evaluation, CRYPTO '13, pp.71-89
DOI : 10.1007/978-3-642-40084-1_5

G. Villard, Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract), Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.32-39
DOI : 10.1145/258726.258742

D. H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986.
DOI : 10.1109/TIT.1986.1057137