I am currently Cryptography Research Director at Zama. My main research subjects are Fully Homomorphic Encryption, Multi-Party Computation and Cloud Computing.
I did a B.S. in Mathematics at University of Cagliari, Italy (2012) and a M.S. in Cryptology at University Joseph Fourier of Grenoble, France (2014). From 2015 to 2018 I was a PhD student in the Crypto team at the Laboratory of Mathematics of Versailles, under the supervision of Louis Goubin and Nicolas Gama. I defended the PhD thesis Towards efficient and secure Fully Homomorphic Encryption and cloud computing in May 2018. I’ve been also:
- An ATER (research and teaching) at University of Versailles (UVSQ, Versailles, France) during the 2017-2018 accademic year.
- A research intern in the Cryptography Research group at Microsoft Research (Redmond, WA, USA) during Summer 2018.
- A visiting scientist for the Lattices: Algorithms, Complexity, and Cryptography program at Simons Institute (Berkeley, CA, USA) in January-February 2020.
- A Post-Doc in the COSIC research group in KU Leuven (Leuven, Belgium) from November 2018 and April 2020.
Contact
E-mail:
firstName (dot) familyName (at) zama (dot) ai
GitHub:
https://github.com/ilachill, https://github.com/ilaria-zama
ORCID:
https://orcid.org/0000-0002-0319-4707
Publications
2023
- Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE (long version). I. Chillotti, E. Orsini, P. Scholl, B. Van Leeuwen. I & C 2023 (to appear).
- Faster Secret Keys for (T)FHE. L. Bergerat, I. Chillotti, D. Ligier, J.-B. Orfila, A. Roux-Langlois, S. Tap. IACR Cryptology ePrint Archive 2023. PDF
- Parameter Optimization & Larger Precision for (T)FHE. L. Bergerat, A. Boudi, Q. Bourgerie, I. Chillotti, D. Ligier, J.-B. Orfila, S. Tap. Journal of Cryptology 2023. PDF
2022
- Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE. I. Chillotti, E. Orsini, P. Scholl, N. Smart, B. Van Leeuwen. SCN 2022. PDF
2021
- Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE. I. Chillotti, D. Ligier, J.-B. Orfila, S. Tap. Asiacrypt 2021. PDF
- Ultra-Fast Homomorphic Encryption Models enable Secure Outsourcing of Genotype Imputation. M. Kim, A. O. Harmanci, J.-P. Bossuat, S. Carpov, J. H. Cheon, I. Chillotti, W. Cho, D. Froelicher, N. Gama, M. Georgieva, S. Hong, J.-P. Hubaux, D. Kim, K. Lauter, Y. Ma, L. Ohno-Machado, H. J Sofia, Y. Son, Y. Song, J. R Troncoso-Pastoriza, X. Jiang. Cell Systems 2021. PDF
- Programmable Bootstrapping Enables Efficient Homomorphic Inference of Deep Neural Networks. I. Chillotti, M. Joye, P. Paillier. CSCML 2021. PDF
2020
- CONCRETE: Concrete Operates oN Ciphertexts Rapidly by Extending TfhE. I. Chillotti, M. Joye, D. Ligier, J.-B. Orfila, S. Tap. Demo paper at WAHC 2020. PDF
- New Challenges for Fully Homomorphic Encryption. I. Chillotti, M. Joye, P. Paillier. Privacy-preserving Machine Learning (PPML-PriML 2020) NeurIPS 2020 workshop. PDF
- SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. H. Chen, I. Chillotti, Y. Dong, O. Poburinnaya, I. Razenshteyn, M. S. Riazi. USENIX Security Symposium 2020. PDF
- TFHE: Fast Fully Homomorphic Encryption over the Torus. I. Chillotti, N. Gama, M. Georgieva, M. Izabachène. Journal of Cryptology 2020. PDF
2019
- Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE. H. Chen, I. Chillotti, L. Ren. CCS 2019. PDF
- Multi-Key Homomophic Encryption from TFHE. H. Chen, I. Chillotti, Y. Song. ASIACRYPT 2019. PDF
- Improved Bootstrapping for Approximate Homomorphic Encryption. H. Chen, I. Chillotti, Y. Song. EUROCRYPT 2019. PDF
2018
- Scaling Up Secure Nearest Neighbor Search. H. Chen, I. Chillotti, O. Poburinnaya, I. Razenshteyn, M. S. Riazi. Privacy Preserving Machine Learning (PPML’18), NeurIPS 2018 Workshop.
- Towards efficient and secure Fully Homomorphic Encryption and cloud computing. I. Chillotti. PhD manuscript (Université de Versailles Saint-Quentin-en-Yvelines, Paris-Saclay). PDF
- High-Precision Privacy-Preserving Real-Valued Function Evaluation. C. Boura, I. Chillotti, N. Gama, D. Jetchev, S. Peceny, A. Petric. Financial Cryptography and Data Security 2018. PDF
2017
- Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE. I. Chillotti, N. Gama, M. Georgieva, M. Izabachène. ASIACRYPT 2017. PDF
2016
- Attacking FHE-based applications by software fault injections. I. Chillotti, N. Gama, L. Goubin. IACR Cryptology ePrint Archive 2016. PDF.
- Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. I. Chillotti, N. Gama, M. Georgieva, M. Izabachène. ASIACRYPT 2016 (Best Paper). PDF.
- A homomorphic LWE based e-voting scheme. I. Chillotti, N. Gama, M. Georgieva, M. Izabachène. PQCrypto 2016. PDF.
Open-source development
-
CONCRETE: Concrete Operates oN Ciphertexts Rapidly by Extending TfhE. GitHub
-
MK-TFHE: Multi-Key Homomophic Encryption from TFHE. GitHub
-
TFHE: Fast Fully Homomorphic Encryption over the Torus. A fast open-source library for fully homomorphic encryption. GitHub
Awards
- 1st place - Track II - iDASH 2019 competition, IDASH PRIVACY & SECURITY WORKSHOP 2019 - secure genome analysis competition, Track II on Secure Genotype Imputation using Homomorphic Encryption, together with Sergiu Carpov, Nicolas Gama and Mariya Georgieva (TFHE-Chimera team).
- Finalist of the PhD Thesis Prize GDR Sécurité Informatique 2019 for the thesis Towards efficient and secure Fully Homomorphic Encryption and cloud computing.
- Best Paper Award at Asiacrypt 2016 for the paper Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds.
Talks
- An Overview of FHE, TFHE and Concrete Framework.
- September 2023 - At Cryptography and Coding Theory (Perugia, Italy) - joint to Damien Ligier.
- Parameter Optimization & Larger Precision for (T)FHE.
- June 2023 - At Journées Nationales 2023 du GDR Sécurité Informatique (Campus Cyber, Paris, France) - joint to Damien Ligier.
- June 2023 - At London Crypto Day 2023 (Royal Holloway, Egham, UK).
- An update on the Concrete Framework.
- March 2023 - At 6th HomomorphicEncryption.org Standards Meeting (Seoul, South Korea) - joint to Damien Ligier.
- Introduction to FHE and the TFHE scheme.
- February 2023 - At EECS 598-09 Privacy-Enhanced Technologies (PETs) by Todd Austin - Electrical Engineering and Computer Science - The University of Michigan (remote invited lecture).
- July 2022 - At Workshop on Foundations and Applications of Lattice-based Cryptography (ICMS, Edinburgh, UK).
- Fully Homomorphic Encryption.
- September 2022 - At SantaCrypt 2022 (Prague, Czech Republic) and at Summer School 2022: Graz Security Week (Graz, Austria).
- April 2022 - At ANSSI seminar (Paris, France, webinar).
- An overview of the Concrete Framework.
- September 2022 - At 5th HomomorphicEncryption.org Standards Meeting (Geneva, Switzerland) - joint to Damien Ligier.
- Introduction to FHE, TFHE and Machine Learning applications.
- April 2022 - At Journées C2 2022 (Hendaye, France).
- October/November 2021 - At nChain seminar (nChain UK, webinar).
- June 2021 - At CRC Seminar Series (TII Abu Dhabi, webinar).
- May 2021 - At IMDEA seminar (IMDEA Madrid, webinar).
- Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE.
- February 2022 - At CryptoExperts seminar (Paris, France, webinar).
- December 2021 - At Asiacrypt 2021 (joint to D. Ligier, J.-B. Orfila and S. Tap). Video
- June 2021 - At Seminaire CRYPTO (UVSQ, Versailles, France).
- Fully Homomorphic Encryption – end-to-end encryption everywhere.
- November 2021 - At New Bridges between Mathematics and Data Science: a Scientific Debate (Valladolid, Spain).
- Programmable Bootstrapping Enables Efficient Homomorphic Inference of Deep Neural Networks.
- July 2021 - At CSCML 2021 (Israel, webinar).
- TFHE deep dive.
- April 2021 - At FHE.org Meetup (webinar). Video
- New Challenges for Fully Homomorphic Encryption.
- December 2020 - At PPML-PriML 2020 poster session (virtual NeurIPS 2020 workshop).
- Introduction to FHE and applications to Machine Learning.
- December 2020 - At Seminario di Logica e Informatica Teorica (Università Roma Tre, webinar).
- Introduction to FHE.
- June 2020 - At ETSI Security Week Webinar (webinar).
- SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search.
- June 2020 - At TPMPC 2020 (webinar).
- Introduction to FHE and the TFHE Scheme.
- April 2020 - At the “Lattices: From Theory to Practice” workshop (Simons Institute, webinar). Video
- Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE.
- November 2019 - At COSIC seminar (KU Leuven, Belgium) and ACM CCS 2019 (London, UK).
- TFHE-Chimera Team IDash 2019 submission for Track II.
- October 2019 - At iDASH 2019 workshop (Bloomington, Indiana, USA).
- Multi-Key Homomophic Encryption from TFHE.
- January 2020 - At LACS seminar (University of Luxembourg, Luxembourg).
- October 2019 - At COED Day (KU Leuven, Belgium).
- September 2019 - At Crypto seminar Lyon (ENS Lyon, France).
- Improved Bootstrapping for Approximate Homomorphic Encryption.
- May 2019 - At Eurocrypt 2019 (Darmstadt, Germany).
- March 2019 - At Séminaire C2 (Rennes, France).
- November 2018 - At Public Key seminar COSIC (KU Leuven, Belgium).
- TFHE: Fully Homomorphic Encryption over the Torus.
- February 2019 - At COED seminar (KU Leuven, Belgium) and ISG Research Seminar (Royal Holloway, UK).
- Towards efficient and secure Fully Homomorphic Encryption and cloud computing.
- May 2018 - PhD defence (University of Versailles, France).
- Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE.
- May 2018 - At LATCA workshop 2018 (Bertinoro, Italy)
- December 2017 - At Asiacrypt 2017 (Hong Kong, China).
- October 2017 - At Lattice and crypto meetings (ENS Lyon, France).
- Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds.
- April 2017 - At Séminaire GTBAC (Télécom ParisTech, France) and Journées Codage et Cryptographie 2017 (France).
- February 2017 - At Séminaire de cryptographie (ENS Paris, France).
- January 2017 - At Séminaire de cryptographie (University of Caen, France).
- November 2016 - At Lattice and crypto meetings (ENS Lyon, France) and Séminaires CRYPTO (University of Versailles, France).
- An Homomorphic LWE based E-voting Scheme.
- April 2016 - At Séminaires CRYPTO (University of Versailles, France).
- February 2016 - At PQCrypto 2016 (Japan). Slides
- Fully Homomorphic Encryption.
- September 2017 - At Journée du LMV (University of Versailles, France).
- December 2015 - At Séminaires des jeunes LMV (University of Versailles, France) and Seminari di Matematica (University of Cagliari, Italy).
- Safe-Error attacks on the Cloud.
- October 2015 - At Journées Codage et Cryptographie 2015 (France).
Panels
- August 2023 - Privacy Preserving AI at GHTC 2023, affiliated event at Crypto 2023 (Santa Barbara, California, USA).
Blogposts
Zama Blog
- June 2023 - Parameter Optimization & Larger Precision for (T)FHE (with Loris Bergerat, Anas Boudi, Quentin Bourgerie, Damien Ligier, Jean-Baptiste Orfila and Samuel Tap) blogpost
- May 2022 - TFHE Deep Dive
- September 2021 - What’s New in Concrete (with Ben Curtis, Damien Ligier, Alexandre Péré) Medium, Substack
COSIC Cryptography Blog
- April 2020 - CO6GC: Homomorphic Encryption (part 1): computing with secrets (with Charlotte Bonte) blogpost
- December 2019 - Asiacrypt 2019
- November 2019 - ACM CCS 2019 and workshops
- PPML’19 – Garbled Neural Networks are practical blogpost
- CCS’19 – “I don’t see why I would ever want to use it”: analyzing the usability of popular smartphone password managers blogpost
- CCS’19 – Practical fully secure three-party computation via sublinear distributed zero-knowledge proofs blogpost
- Sparse-secret LWE at WAHC’19 (with Ilia Iliashenko) blogpost
- October 2019 - IDASH 2019 – KU Leuven among the winners blogpost
- July 2019 - The three musketeers of secure computation: MPC, FHE AND FE blogpost
International schools
- TFHE and applications.
- March 2023 - At ISC Virtual Winter School, SBU, Tehran (Iran, webinar).
- Introduction to FHE and the TFHE scheme.
- July 2022 - At Contemporary algebraic and geometric techniques in coding theory and cryptography (virtual summer school).
- Fully homomorphic encryption.
- July 2016 - At CryptoBG International Summer School 2016 (Bulgaria).
- Implementing a Fully Homomorphic Encryption scheme.
- July 2015 - At CryptoBG International Summer School 2015 (Bulgaria).
Vulgarization and Interviews
- May 2022 - Interview for the Blog Docteurs SPI.
- January 2022 - Les promesses du chiffrement homomorphe pour traiter les données privées by Clémentine Laurens, for Le Monde.
- April 2016 - Cryptography, at Ateliers BD Sciences (Exploradôme Vitry-sur-Seine, France).
Programme Committee Member
- CIFRIS23 - Rome (Italy), December 14-15, 2023.
- FHE.org 2023 - Tokyo (Japan), March 26, 2023.
- RWC 2023 - Tokyo (Japan), March 27-29, 2023.
- Asiacrypt 2022 - December 5-9, 2022.
- PKC 2022 - March 7-11, 2022.
- WAHC 2021 - November 14, 2021.
- CFAIL 2021 - August, 14, 2021.
- WAHC 2020 - Virtual Corona Edition, December 15, 2020.
- Crypto 2020 - Santa Barbara, CA (USA), August 16-20, 2020.
- MathCrypt 2019 - Santa Barbara, CA (USA), August 18, 2019.
Organization Committee Member
- General Chair - FHE.org 2024 - Affiliated event to Real World Crypto 2024, Toronto (Canada), March 24, 2024. webpage
- FHE.org 2022 - Affiliated event to EUROCRYPT 2022, Trondheim (Norway), May 29, 2022. webpage
Editorial Board
- Journal of Mathematical Cryptology - De Gruyter, 2023. webpage
Teaching and Students
Zama
- Loris Bergerat: Intern (2021) and PhD Student (2022 - ) - with D. Ligier and J.-B. Orfila.
- Anas Boudi: PhD student (2022 - ) - with D. Ligier and J.-B. Orfila.
KU Leuven
- Student project supervision: 1 student M2 (MS.2) Electrical Engineering (2020).
University of Versailles (UVSQ)
- Cryptography: TD (tutorial) 30h - M1 (MS.1) Computer Science (2015, 2016) and M1 (MS.1) Mathematics (2017).
- Student project supervision: 2 students M1 (MS.1) Computer Science (2016) and 3 students M1 (MS.1) Mathematics (2018).
- Complements of discrete mathematics: TD (tutorial) 15h - M1 (MS.1) Computer Science (2015, 2016, 2017).
- Cryptography: TD (tutorial) 36h - L3 (BS.3) Computer Science (2018).
- Mathematics for computer science: TD (tutorial) 36h - L2 (BS.2) Bio-informatics (2017).
- Foundations of computer science II: TD (tutorial) 36h - L1 (BS.1) Mathematics and Computer Science (2018).
- Foundations of computer science I: TD (tutorial) 36h - L1 (BS.1) Bio-informatics (2017).