The elementary theory of nite elds, Annals of Mathematics, vol.88, issue.2, pp.239-271, 1968. ,

Automated methods for checking di erential privacy, 2019. ,

On the equality of probabilistic terms, 16th International Conference on Logic for Programming Arti cial Intelligence and Reasoning (LPAR'10), vol.6355, pp.46-63, 2010. ,

Symbolic Methods in Computational Cryptography Proofs, 2019 IEEE 32nd Computer Security Foundations Symposium (CSF), pp.136-151, 2019. ,

URL : https://hal.archives-ouvertes.fr/hal-02404701

Formal certification of code-based cryptographic proofs, ACM SIGPLAN Notices, vol.44, issue.1, pp.90-101, 2009. ,

Fine-Grained Semantics for Probabilistic Programs, Programming Languages and Systems, vol.10801, pp.145-185, 2018. ,

On exponential sums in nite elds, American Journal of Mathematics, vol.88, issue.1, pp.71-105, 1966. ,

Linicrypt: A Model for Practical Cryptography, Advances in Cryptology ? CRYPTO 2016, vol.9816, pp.416-445, 2016. ,

Asymmetric distances for approximate di erential privacy, 30th International Conference on Concurrency Theory (CONCUR 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019. ,

The bit extraction problem of t-resilient functions (preliminary version), 26th Annual Symposium on Foundations of Computer Science (FOCS'85), pp.396-407, 1985. ,

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

Exponential functions, linear recurrence sequences, and their applications, 2002. ,

Satisfiability modulo counting, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS '14, pp.1-10, 2014. ,

The complexity of verifying circuits as di erentially private, 2019. ,

Fun with elds, 2016. ,

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

Sets de nable over nite elds: their zeta-functions, Transactions of the American Mathematical Society, vol.223, pp.45-59, 1976. ,

Counting points on varieties over nite elds of small characteristic, 2006. ,

On automated veri cation 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. ,

Finite elds, 1983. ,

How to simulate it -A tutorial on the simulation proof technique, Tutorials on the Foundations of Cryptography, pp.277-346, 2017. ,

The computational complexity of probabilistic planning, Journal of Arti cial Intelligence Research, vol.9, pp.1-36, 1998. ,

The automorphism group over nite elds, 2001. ,

Deciding polynomial-transcendental problems, Journal of Symbolic Computation, vol.47, issue.1, pp.16-31, 2012. ,

The distance between terms of an algebraic recurrence sequence, Journal für die reine und angewandte Mathematik, issue.349, pp.63-76, 1984. ,

Handbook of nite elds, 2013. ,

On probabilistic program equivalence and re nement, CONCUR 2005 -Concurrency Theory, 16th International Conference, CONCUR 2005, vol.3653, pp.156-170, 2005. ,

Uni cation in primal algebras, their powers and their varieties, J. ACM, vol.37, issue.4, pp.742-776, 1990. ,

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

Positivity problems for low-order linear recurrence sequences, 25th ACM-SIAM Symposium on Discrete Algorithms (SODA'14), pp.366-379, 2014. ,

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

Complexity classes de ned by counting quanti ers, Journal of the ACM, vol.38, pp.753-774, 1991. ,

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

Numbers of solutions of equations in nite elds, Bulletin of the AMS, 1949. ,