My research topic relates to succinct proofs of computational integrity based on error-correcting codes.
I am particularly interested in the transparent and post-quantum flavour of zero-knowledge proof systems for computational integrity, which relies heavily on efficient proximity tests to algebraic codes.
Main interests: probabilistically checkable proofs, interactive proof systems, zero-knowledge proofs, computational complexity, algebraic techniques and locality in coding theory.
Office 2039, Bâtiment Alan Turing
Campus de l'Ecole Polytechnique
91120 Palaiseau Cedex - France
* This action benefits from the support of the Chair "Blockchain & B2B Platforms", led by l’X – Ecole Polytechnique and the Fondation de l’Ecole Polytechnique, sponsored by Capgemini.