Updated: mar. 27 septembre 2022

All my talks

Conference talks

  • On the hardness of the NTRU problem. Asiacrypt 2021, virtual, December 2021. [slides][slides of the recorded talk]
  • Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE. Eurocrypt 2020, virtual, May 2020. [slides]
  • An LLL algorithm for module lattices. Asiacrypt 2019, Kobe, December 2019. [slides]
  • Approx-SVP in Ideal Lattices with Pre-Processing. Eurocrypt 2019, Darmstadt, May 2019. [slides]
  • On the Statistical Leak of the GGH13 Multilinear Map and some Variants. Asiacrypt 2018, Brisbane, December 2018. [slides]
  • Cryptanalysis of branching program obfuscators (joint talk with Minki Hhan). Crypto 2018, Santa Barbara, August 2018. [slides]

Workshops and summer schools

  • Lattice-based crypto, part 1: Algorithmic problems over lattices. Course for the AsCrypto 2021 summer school (Bogota), virtual, October 2021. [slides][exercises]
  • An LLL algorithm for module lattices. Lattices: Geometry, Algorithms and Hardness, Simons Institute, Berkeley, February 2020. [slides]
  • Attacks on GGH13-based obfuscation. Opacity workshop (Eurocrypt affiliated event), Darmstadt, May 2019. [slides]

Seminars

  • On the hardness of the NTRU problem. Séminaire ECO, LIRMM, Montpellier, December 2021. [slides]
  • Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. Séminaire de théorie des nombres de Toulouse, October 2021. [slides]
  • On the hardness of the NTRU problem. Séminaire de cryptographie de Rennes, October 2021. [slides]
  • Overview of attacks on ideal lattices. Talk at ANSSI, Paris, September 2021. [slides][printable version]
  • On the hardness of the NTRU problem. Aric seminar, Lyon, September 2021. [slides]
  • On the hardness of the NTRU problem. Student seminar at CWI (Amsterdam), virtual, July 2021. [slides]
  • On the hardness of the NTRU problem. Lattice reunion (Simons Institute, Berkeley), virtual, June 2021. [slides]
  • Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. Séminaire de théorie des nombres, Bordeaux, May 2021. (on a virtual board)
  • Sampling relatively factorizable elements in ideals of number fields. Caramba seminar (Loria, Nancy), virtual, April 2021. [slides]
  • Algorithmic problems over ideal lattices. Discrete Mathematics, Codes and Cryptography eSeminar (Paris 8), virtual, March 2021. [slides]
  • On the hardness of the NTRU problem. Student seminar at CWI (Amsterdam), virtual, July 2021. [slides]
  • Algebraic lattices in cryptography. Journées d'inauguration de la fédération MARGAUx, La Rochelle, June 2021. [slides]
  • On the hardness of the NTRU problem. Lattice reunion (Simons Institute, Berkeley), virtual, June 2021. [slides]
  • Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. Séminaire de théorie des nombres, Bordeaux, May 2021. (on a virtual board)
  • Sampling relatively factorizable elements in ideals of number fields. Caramba seminar (Loria, Nancy), virtual, April 2021. [slides]
  • Algorithmic problems over ideal lattices. Discrete Mathematics, Codes and Cryptography eSeminar (Paris 8), virtual, March 2021. [slides]
  • Introduction to lattice-based cryptography. Webinar series on “Cryptography, Network Security and Cybersecurity”, organised by Maulana Abul Kalam Azad University of Technology, September 2020. [slides]
  • Overview of algorithms for Ideal-SVP and Module-SVP. Lattices: Algorithms and Complexity seminar, Simons Institute, Berkeley, February 2020. (on the board)
  • An LLL algorithm for module lattices. Seminar, Institut Fourier, Grenoble, January 2020. [slides]
  • An LLL algorithm for module lattices. Groupe de travail de crypto basée sur les codes, Inria Paris, January 2020. (On the board, no slides. Here are the manuscript notes I wrote to prepare the talk, and here is the one slide animation.)
  • An LLL algorithm for module lattices. Grace seminar, LIX, Palaiseau, December 2019. [slides]
  • An LLL algorithm for module lattices. Séminaire Lfant, Bordeaux, November 2019. [slides]
  • An LLL algorithm for module lattices. Séminaire ECO/ESCAPE, Montpellier, November 2019. [slides]
  • Approx-SVP in Ideal Lattices with Pre-Processing. Séminaire de cryptographie de Rennes, May 2019. [slides]
  • Theoretical Obfuscation. Quarkslab seminar, Paris, May 2019. [slides]
  • Approx-SVP in Ideal Lattices with Pre-Processing. Prometheus and RISC seminar, CWI, Amsterdam, May 2019. [slides]
  • Quantum attack against some candidate obfuscators based on GGH13. Séminaire C2, Paris, November 2018. [slides]
  • Approx-SVP in Ideal Lattices with Pre-Processing. TMeet talk, IIT Madras, October 2018. [slides]
  • Approx-SVP in Ideal Lattices with Pre-Processing. Aric seminar, Lyon, June 2018. [slides]

Other

  • Algebraic lattices in cryptography. Journées d'inauguration de la fédération MARGAUx, La Rochelle, June 2021. [slides]
  • Program Obfuscation. CWI PhD seminar, Amsterdam, July 2019. [slides]
  • Approx-SVP in Ideal Lattices with Pre-Processing. Journées C2, Aussois, October 2018. [slides]
  • Approx-SVP in Ideal Lattices with Pre-Processing. CAEN 2018, Caen, June 2018. [slides]
  • Quantum Attack against Branching Program Indistinguishablility Obfuscators over GGH13. Monthly lattice and crypto meetings, Lyon, September 2017.
  • On the Statistical Leak of the GGH13 Multilinear Map and some Variants. Journées C2, la Bresse, April 2017. [slides]