J. Ax, The elementary theory of finite fields, Annals of Mathematics, vol.88, pp.239-271, 1968.

G. Barthe, R. Chadha, A. P. Jagannath, M. Sistla, and . Viswanathan, Automated Methods for Checking Differential Privacy, 2019.

G. Barthe, M. Daubignard, B. Kapron, Y. Lakhnech, and V. Laporte, On the equality of probabilistic terms, 16th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR'10), vol.6355, pp.46-63, 2010.

G. Barthe, B. Grégoire, C. Jacomme, S. Kremer, and P. Strub, Symbolic Methods in Computational Cryptography Proofs, 32nd IEEE Computer Security Foundations Symposium (CSF'19), pp.136-151, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02404701

G. Barthe, B. Grégoire, and S. Béguelin, Formal certification of code-based cryptographic proofs, ACM SIG-PLAN Notices, vol.44, pp.90-101, 2009.

G. Barthe, C. Jacomme, and S. Kremer, Universal equivalence and majority on probabilistic programs over finite fields, 2020.

B. Bichsel, T. Gehr, and M. Vechev, Fine-grained Semantics for Probabilistic Programs, 27th European Symposium on Programming (ESOP'18), vol.10801, pp.145-185, 2018.

E. Bombieri, On exponential sums in finite fields, American Journal of Mathematics, vol.88, pp.71-105, 1966.

B. Carmer and M. Rosulek, Linicrypt: a model for practical cryptography, 36th Annual International Cryptology Conference (CRYPTO'16), vol.9816, pp.416-445, 2016.

D. Chistikov, A. S. Murawski, and D. Purser, Asymmetric Distances for Approximate Differential Privacy, 30th International Conference on Concurrency Theory (CONCUR 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019.

B. Chor, O. Goldreich, J. Håstad, J. Friedman, S. Rudich et al., The Bit Extraction Problem of t-Resilient Functions (Preliminary Version), 26th Annual Symposium on Foundations of Computer Science (FOCS'85), pp.396-407, 1985.

B. Dwork, On the rationality of the zeta function of an algebraic variety, American Journal of Mathematics, vol.82, pp.631-648, 1960.

G. Everest, A. Van-der-poorten, I. Shparlinski, and T. Ward, Exponential functions, linear recurrence sequences, 2002.

M. Fredrikson and S. Jha, Satisfiability modulo counting: A new approach for analyzing privacy properties, Joint Meeting of the 23rd Annual Conference on Computer Science Logic (CSL) and the 29th ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014.

M. Gaboardi, K. Nissim, and D. Purser, The Complexity of Verifying Circuits as Differentially Private, 2019.

W. Andrew and J. , Fun with fields. Ph.D. Dissertation. UC Berkeley, 2016.

S. Charanjit, A. Jutla, and . Roy, Decision procedures for simulatability, 17th European Symposium on Research in Computer Security (ESORICS'12), vol.7459, pp.573-590, 2012.

C. Kiefe, Sets definable over finite fields: their zetafunctions, Trans. Amer. Math. Soc, vol.223, pp.45-59, 1976.

G. B. Alan, D. Lauder, and . Wan, Counting points on varieties over finite fields of small characteristic, 2006.

A. Legay, A. S. Murawski, J. Ouaknine, and J. Worrell, On automated verification of probabilistic programs, 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08), vol.4963, pp.173-187, 2008.

Y. Lindell, How to Simulate It -A Tutorial on the Simulation Proof Technique, Tutorials on the Foundations of Cryptography, Yehuda Lindell, pp.277-346, 2017.

J. Michael-l-littman, M. Goldsmith, and . Mundhenk, The computational complexity of probabilistic planning, Journal of Artificial Intelligence Research, vol.9, pp.1-36, 1998.

S. Maubach, The automorphism group over finite fields, 2001.

S. Mccallum and V. Weispfenning, Deciding polynomialtranscendental problems, Journal of Symbolic Computation, vol.47, pp.16-31, 2012.

M. Mignotte, T. Nath-shorey, and R. Tijdeman, The distance between terms of an algebraic recurrence sequence, Journal für die reine und angewandte Mathematik, vol.349, pp.63-76, 1984.

A. S. Murawski and J. Ouaknine, On Probabilistic Program Equivalence and Refinement, CONCUR 2005 -Concurrency Theory, 16th International Conference, vol.3653, pp.156-170, 2005.

T. Nipkow, Unification in Primal Algebras, Their Powers and Their Varieties, J. ACM, vol.37, pp.742-776, 1990.

J. Ouaknine and J. Worrell, Decision problems for linear recurrence sequences, 6th International Workshop on Reachability Problems (RP'12), vol.7550, pp.21-28, 2012.

J. Ouaknine and J. Worrell, Positivity problems for loworder linear recurrence sequences, 25th ACM-SIAM Symposium on Discrete Algorithms (SODA'14), pp.366-379, 2014.

J. Toràn, An oracle characterization of the counting hierarchy, 3rd Annual Structure in Complexity Theory Conference, pp.213-223, 1988.

J. Torán, Complexity classes defined by counting quantifiers, J. ACM, vol.38, pp.753-774, 1991.

. Nk-vereshchagin, The problem of appearance of a zero in a linear recurrence sequence, Mat. Zametki, vol.38, pp.609-615, 1985.

A. Weil, Numbers of solutions of equations in finite fields, Bulletin of the AMS, 1949.