I am a CNRS research scientist at IRIF, Université de Paris. I received my PhD from École Normale Supérieure de Paris (ENS) in November 2017, under the supervision of David Pointcheval and Hoeteck Wee. In 2017 – 2019, I was a postdoctoral researcher at Karlsruhe Institute of Technology (KIT), in the team of Dennis Hofheinz.
My main research interests are secure multiparty computation and zero-knowledge proofs (both foundational and practical aspects), as well as the theoretical foundations of cryptography. For an up-to-date list of my publications, you can check my publication page, my dblp profile, or my Google scholar profile. All my publications become available at some point in open access format on the ePrint archive; see the list here. My PhD thesis can be found here.
This website contains a few posts which might be useful to students in cryptography, gathered in the blog section. It includes in particular:
- A LaTeX template for writing research papers in cryptography;
- A probability cheat sheet, with basic tools and results that I believe should be part of the cryptographer’s toolbox;
- A Q&A section, where I gathered some of my answers to common questions on the cryptography stackexchange.
Students and postdocs
I have the pleasure to advise several amazing PhD students, and I will not be accepting any new PhD requests in the next few years. However, if you are interested in doing a postdoc on topics related to secure computation next year, I will likely have one or two openings. Drop me a mail, and consider applying to the openings of the Algorithm and Complexity team of IRIF (around October 2021).
|Past & Current students||Time period||Status||Notes|
|Bui Dung||Starting Oct. 2021||PhD||Secure Computation for Privacy-Preserving Analysis of Medical Data|
|Clément Ducros||Starting Oct. 2021||PhD||Linear Codes for Quantum-Resistant Secure Computation (co-advised with Alain Couvreur)|
|Eliana Carozza||Starting Oct. 2021||PhD||Quantumly hard algebraic problems and their advanced cryptographic applications (co-advised with Antoine Joux)|
|Ulysse Léchine||Starting Oct.2021||PhD||Average-case hardness, entropy, and one-way functions (co-advised with Thomas Seiller)|
|Bui Dung||Mar. 2021 – Aug. 2021||Master||Batch equality tests and secure comparison from pseudorandom correlation generators|
|Clément Ducros||Mar. 2021 – Aug. 2021||Master||Secure computation meets linear-time encodable codes|
|Maryam Zarezadeh||Nov. 2020 – Apr. 2021||Visiting student|
|Pierre Meyer||Sep. 2020 –||PhD||Secure computation with constrained communication (co-advised with Elette Boyle)|
|Elahe Sadeghi||Jul. 2020 – Oct. 2020||Internship||Statistical ZAPs from group-based assumptions|
|Michael Reichle||Feb. 2020 – Aug. 2020||Master||Efficient range proofs with transparent setup from bounded integer commitments. Michael’s work led to a paper, to be presented at EUROCRYPT’21.|
|Pierre Meyer||Nov. 2020 – Jan. 2020||Internship||Breaking the circuit size barrier for secure computation under quasi-polynomial LPN. Pierre’s work led to a paper, to be presented at EUROCRYPT’21.|
|Dominik Hartmann||Feb. 2019 – Aug. 2020||Master||Compilers for non-interactive zero-knowledge proofs. Dominik’s work led to a paper, presented at CRYPTO’20.|
|Sebastian Faller||Oct. 2018 – Feb. 2019||Bachelor||Lattice-based implicit zero-knowledge arguments|
|Michael Reichle||May 2018 – Sep. 2018||Bachelor||Non-interactive keyed-verification anonymous credentials. Michael’s work led to a paper, presented at PKC’19.|
|Samuel Kopmann||Nov. 2017 – Mar. 2018||Bachelor||Improved designated-verifier non-interactive zero-knowledge arguments|
The list of conferences and workshops where I served as a member of the committee.
|2021||EUROCRYPT, IWSEC, WAHC|
|2020||EUROCRYPT, IWSEC, WAHC|