Ilaria Chillotti
Artificial Intelligence · 2016–2019
A researcher in the Science corpus: 3 papers; trusts 28 researchers and is trusted by 6 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 48 citations into it; #20,413 of 35,345 by trust here, #19,439 by citations
- Computational Theory and Mathematics — 34 citations into it; #6,794 of 12,182 by trust here, #4,531 by citations
- Information Systems — 10 citations into it
- Privacy & Security — 10 citations into it
- Computer Vision and Pattern Recognition — 5 citations into it
Whom Ilaria Chillotti trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Zvika Brakerski
- Oded Regev
- Chris Peikert
- Daniele Micciancio
- Léo Ducas
- Vinod Vaikuntanathan
- Jean-Sébastien Coron
- Vadim Lyubashevsky
- Shai Halevi
Who trusts Ilaria Chillotti overall
- Hao Chen
- M. Sadegh Riazi
- Pan Yang
- Sai Sri Sathya
- Amartya Sanyal
- Abbas Acar
- Nicolas Gama
- Florian Bourse
- Kim Laine
- Ho Bae
Papers from Ilaria Chillotti's perspective
Ordered by how strongly the researchers Ilaria Chillotti trusts endorse each paper. Same corpus, a different order for every researcher.
- On Ideal Lattices and Learning with Errors over Rings
- Fully homomorphic encryption using ideal lattices
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- On lattices, learning with errors, random linear codes, and cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (IACR Cryptology ePrint Archive)
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- A fully homomorphic encryption scheme
- Efficient Fully Homomorphic Encryption from (Standard) LWE
Their papers
- TFHE: Fast Fully Homomorphic Encryption Over the Torus (2019) — 1,179 citations
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds (2016) — 804 citations
- Improving TFHE: faster packed homomorphic operations and efficient circuit bootstrapping (2017) — 38 citations