The elementary theory of finite fields, Annals of Mathematics, vol.88, pp.239-271, 1968. ,
Automated Methods for Checking Differential Privacy, 2019. ,
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. ,
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
Formal certification of code-based cryptographic proofs, ACM SIG-PLAN Notices, vol.44, pp.90-101, 2009. ,
Universal equivalence and majority on probabilistic programs over finite fields, 2020. ,
Fine-grained Semantics for Probabilistic Programs, 27th European Symposium on Programming (ESOP'18), vol.10801, pp.145-185, 2018. ,
On exponential sums in finite fields, American Journal of Mathematics, vol.88, pp.71-105, 1966. ,
Linicrypt: a model for practical cryptography, 36th Annual International Cryptology Conference (CRYPTO'16), vol.9816, pp.416-445, 2016. ,
Asymmetric Distances for Approximate Differential 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, pp.631-648, 1960. ,
Exponential functions, linear recurrence sequences, 2002. ,
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. ,
The Complexity of Verifying Circuits as Differentially Private, 2019. ,
, Fun with fields. Ph.D. Dissertation. UC Berkeley, 2016.
Decision procedures for simulatability, 17th European Symposium on Research in Computer Security (ESORICS'12), vol.7459, pp.573-590, 2012. ,
Sets definable over finite fields: their zetafunctions, Trans. Amer. Math. Soc, vol.223, pp.45-59, 1976. ,
Counting points on varieties over finite fields of small characteristic, 2006. ,
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. ,
How to Simulate It -A Tutorial on the Simulation Proof Technique, Tutorials on the Foundations of Cryptography, Yehuda Lindell, pp.277-346, 2017. ,
The computational complexity of probabilistic planning, Journal of Artificial Intelligence Research, vol.9, pp.1-36, 1998. ,
The automorphism group over finite fields, 2001. ,
Deciding polynomialtranscendental problems, Journal of Symbolic Computation, vol.47, pp.16-31, 2012. ,
The distance between terms of an algebraic recurrence sequence, Journal für die reine und angewandte Mathematik, vol.349, pp.63-76, 1984. ,
On Probabilistic Program Equivalence and Refinement, CONCUR 2005 -Concurrency Theory, 16th International Conference, vol.3653, pp.156-170, 2005. ,
Unification in Primal Algebras, Their Powers and Their Varieties, J. ACM, vol.37, 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 loworder 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 defined by counting quantifiers, J. ACM, vol.38, pp.753-774, 1991. ,
The problem of appearance of a zero in a linear recurrence sequence, Mat. Zametki, vol.38, pp.609-615, 1985. ,
Numbers of solutions of equations in finite fields, Bulletin of the AMS, 1949. ,