, Victor selects p randomly from a set with, say, c · h primes

, Peggy produces the sparse rank certificate of Corollary 3 over the field of integers modulo p, that is, p.1

, Victor checks the certificate of the rank modulo p (to apply A in Z/ pZ , Victor applies A over Z and then reduces the resulting vector modulo p)

L. Babai, Trading group theory for randomness, pp.421-429

M. Bellare and P. Rogaway, Random oracles are practical: A paradigm for designing efficient protocols, Proceedings of the 1st ACM Conference on Computer and Communications Security (Fairfax, pp.62-73, 1993.

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 -ASI

, Lecture Notes in Computer Science, vol.12, pp.626-643, 2012.

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

M. Blum and S. Kannan, Designing programs that check their work, Journal of the ACM, vol.42, pp.269-291, 1995.

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, pp.119-146, 2002.
URL : https://hal.archives-ouvertes.fr/hal-02101893

A. Fiat and A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, Advances in Cryptology-CRYPTO'86, vol.263, pp.186-194, 1986.

R. Fischlin and C. P. Schnorr, Stronger security proofs for RSA and Rabin bits, Advances in Cryptology -EUROCRYPT'97, vol.1233, pp.267-279, 1997.

R. Freivalds, Fast probabilistic algorithms, Mathematical Foundations of Computer Science, vol.74, pp.57-69, 1979.

M. Furer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos, On completeness and soundness in interactive proof systems, Advances in Computing Research, vol.5, pp.429-442, 1989.

M. W. Giesbrecht, A. Lobo, and B. D. Saunders, Certifying inconsistency of sparse linear systems, Proceedings of the 1998 ACM International Symposium on Symbolic and Algebraic Computation, pp.113-119, 1998.

S. Goldwasser, Y. T. Kalai, and G. N. Rothblum, Delegating computation: interactive proofs for muggles, STOC'2008, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp.113-122, 2008.

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems, pp.291-304

E. L. Kaltofen, B. Li, Z. Yang, and L. Zhi, Ex-Symbolic Computation, vol.47, pp.1-15, 2012.

E. L. Kaltofen, M. Nehring, and B. D. Saunders, Quadratic-time certificates in linear algebra, ISSAC'2011, Proceedings of the 2011 ACM International Symposium on Symbolic and Algebraic Computation, pp.171-176, 2011.

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.45, pp.107-110, 1993.

D. Pointcheval and J. Stern, Security proofs for signature schemes, Advances in Cryptology-EUROCRYPT'96, vol.1070, pp.387-398, 1996.

V. R. Pratt, Every prime has a succinct certificate, SIAM Journal on Computing, vol.4, pp.214-220, 1975.

B. D. Saunders, A. Storjohann, and G. Villard, Matrix rank certification, Electronic Journal of Linear Algebra, vol.11, pp.16-23, 2004.
URL : https://hal.archives-ouvertes.fr/hal-02102007

R. Sedgewick and . Ed, STOC '85, ACM Symposium on Theory of Computing, 1985.

A. Storjohann, Integer matrix rank certification, ACM International Symposium on Symbolic and Algebraic Computation, pp.333-340, 2009.

J. Thaler, Time-optimal interactive proofs for circuit evaluation, Advances in Cryptology -CRYPTO'13, vol.8043, pp.71-89, 2013.

D. H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, pp.54-62, 1986.