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
How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios, Advances in Cryptology -ASIACRYPT'12, pp.626-643, 2012. ,
DOI : 10.1007/978-3-642-34961-4_38
Tellegen's principle into practice, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.37-4410, 2003. ,
DOI : 10.1145/860854.860870
Efficient matrix preconditioners for black box linear algebra. Linear Algebra and its Applications, pp.343-344119, 2002. ,
Improved Delegation of Computation Using Fully Homomorphic Encryption, Advances in Cryptology -CRYPTO 2010, 30th Annual Cryptology Conference Proceedings , volume 6223 of Lecture Notes in Computer Science, pp.483-501, 2010. ,
DOI : 10.1007/978-3-642-14623-7_26
doi:10, pp.978-981, 2010. ,
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
Modular design of secure yet practical cryptographic protocols, 1996. ,
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
How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Lecture Notes in Computer Science, vol.263, pp.186-194, 1986. ,
DOI : 10.1007/3-540-47721-7_12
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
Fast probabilistic algorithms, Mathematical Foundations of Computer Science, pp.57-69, 1979. ,
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs, Journal of Cryptology, vol.28, issue.4, pp.1-24, 2014. ,
DOI : 10.1007/s00145-014-9184-y
Delegating computation: interactive proofs for muggles, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp.113-122, 2008. ,
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Mathematics of Computation, vol.64, issue.210, pp.777-80610, 1995. ,
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
Quadratictime certificates in linear algebra, Proceedings of the 2011 ACM International Symposium on Symbolic and Algebraic Computation, pp.171-17610, 2011. ,
DOI : 10.1145/1993886.1993915
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.7699
Pinocchio, Proceedings of the 2013 IEEE Symposium on Security and Privacy, SP '13, pp.238-252 ,
DOI : 10.1145/2856449
Time-Optimal Interactive Proofs for Circuit Evaluation, Lecture Notes in Computer Science, vol.8043, pp.71-89978 ,
DOI : 10.1007/978-3-642-40084-1_5
URL : http://arxiv.org/abs/1304.3812
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, 1997. ,
DOI : 10.1145/258726.258742
Modern Computer Algebra (3 ,
Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986. ,