L. Babai, Trading group theory for randomness, Proceedings of the seventeenth annual ACM symposium on Theory of computing , STOC '85, pp.421-429
DOI : 10.1145/22145.22192

M. Bellare, R. , and P. , Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993.
DOI : 10.1145/168588.168596

D. Bernhard, O. Pereira, and B. Warinschi, How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios, Advances in Cryptology
DOI : 10.1007/978-3-642-34961-4_38

L. Blum, M. Blum, and M. Shub, Comparison of two pseudorandom number generators, Advances in Cryptology -CRYPTO'82, pp.61-78978, 1982.

M. Blum and S. Kannan, Designing programs that check their work, Journal of the ACM, vol.42, issue.1, pp.269-291, 1995.
DOI : 10.1145/200836.200880
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.2537

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, pp.343-344, 2002.

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology -CRYPTO'86, pp.186-194, 1986.
DOI : 10.1007/3-540-47721-7_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.8796

R. Fischlin and C. P. Schnorr, Stronger Security Proofs for RSA and Rabin Bits, Advances in Cryptology -EUROCRYPT'97, pp.267-279, 1997.
DOI : 10.1007/3-540-69053-0_19
URL : http://nbn-resolving.de/urn/resolver.pl?urn=urn:nbn:de:bvb:12-bsb00057953-9

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

M. Furer, O. Goldreich, Y. Mansour, M. Sipser, Z. et al., On completeness and soundness in interactive proof systems Advances in Computing Research, pp.429-442, 1989.

M. W. Giesbrecht, A. Lobo, S. , and B. D. , Certifying inconsistency of sparse linear systems, ISSAC'98, pp.113-119, 1998.

S. Goldwasser, Y. T. Kalai, R. , and G. N. , Delegating computation: interactive proofs for muggles

S. Goldwasser, S. Micali, R. , and C. , The knowledge complexity of interactive proof-systems, Sedgewick [20], pp.291-304, 2008.

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
DOI : 10.1016/j.jsc.2011.08.002

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

T. Kimbrel and R. K. Sinha, A probabilistic algorithm for verifying matrix products using O(n 2 ) time and log 2 n + O(1) random bits, Information Processing Letters, vol.4508, issue.2, pp.107-110, 1991.

D. Pointcheval and J. Stern, Security Proofs for Signature Schemes, Advances in Cryptology -EUROCRYPT'96
DOI : 10.1007/3-540-68339-9_33

B. D. Saunders, A. Storjohann, and G. Villard, Matrix rank certification, Electronic Journal of Linear Algebra, vol.11, issue.1, pp.16-23, 2004.
DOI : 10.13001/1081-3810.1118
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.153

A. Storjohann, Integer matrix rank certification, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.333-340, 2009.
DOI : 10.1145/1576702.1576748

J. Thaler, Time-Optimal Interactive Proofs for Circuit Evaluation, Advances in Cryptology -CRYPTO'13, pp.71-89, 2013.
DOI : 10.1007/978-3-642-40084-1_5
URL : http://arxiv.org/abs/1304.3812

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