Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ilaria Chillotti
dblp:175/5881
· DBLP profile ↗
12ranked-venue papers
6as first author
4since 2021 · last 2024
0000-0002-0319-4707ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 11 · 5 first-author · 3 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
11 papers |
Cryptographic primitives and cryptanalysis · 86% Cryptographic protocols and secure computation · 13% Privacy and data protection · 1% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 50% Memory systems · 50% |
Topics — the 15 heaviest of 15, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
homomorphic encryption |
3.6 | 8 | 2024 | New Secret Keys for Enhanced Performance in (T)FHE · CCS 2024 Parameter Optimization and Larger Precision for (T)FHE · J. Cryptol. 2023 Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE · ASIACRYPT (3) 2021 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption |
2.6 | 4 | 2024 | Scooby: Improved multi-party homomorphic secret sharing based on FHE · Inf. Comput. 2024 New Secret Keys for Enhanced Performance in (T)FHE · CCS 2024 Parameter Optimization and Larger Precision for (T)FHE · J. Cryptol. 2023 |
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
TFHE |
1.3 | 4 | 2021 | Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE · ASIACRYPT (3) 2021 TFHE: Fast Fully Homomorphic Encryption Over the Torus · J. Cryptol. 2020 Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE · ASIACRYPT (1) 2017 |
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption › TFHE
programmable bootstrapping |
0.8 | 2 | 2021 | Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE · ASIACRYPT (3) 2021 Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE · ASIACRYPT (1) 2017 |
Cryptographic protocols and secure computation › secret sharing
homomorphic secret sharing |
0.8 | 1 | 2024 | Scooby: Improved multi-party homomorphic secret sharing based on FHE · Inf. Comput. 2024 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
0.8 | 1 | 2024 | New Secret Keys for Enhanced Performance in (T)FHE · CCS 2024 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
bootstrapping |
0.6 | 2 | 2019 | Improved Bootstrapping for Approximate Homomorphic Encryption · EUROCRYPT (2) 2019 Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds · ASIACRYPT (1) 2016 |
Cryptographic protocols and secure computation
arithmetic circuits |
0.5 | 1 | 2021 | Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE · ASIACRYPT (3) 2021 |
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
CKKS |
0.4 | 1 | 2019 | Improved Bootstrapping for Approximate Homomorphic Encryption · EUROCRYPT (2) 2019 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
multi-key homomorphic encryption |
0.4 | 1 | 2019 | Multi-Key Homomorphic Encryption from TFHE · ASIACRYPT (2) 2019 |
Cryptographic protocols and secure computation › oblivious data structures
oblivious RAM |
0.4 | 1 | 2019 | Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE · CCS 2019 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
circuit bootstrapping |
0.3 | 1 | 2017 | Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE · ASIACRYPT (1) 2017 |
Privacy and data protection
privacy-preserving data analysis |
0.1 | 1 | 2020 | SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search · USENIX Security Symposium 2020 |
Memory systems
access pattern hiding |
0.1 | 1 | 2019 | Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE · CCS 2019 |
Storage systems › networked storage
remote storage |
0.1 | 1 | 2019 | Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE · CCS 2019 |
Methods — techniques the papers use, named apart from their topics
secret key optimization · 0.8leveled TFHE · 0.8homomorphic permutation protocol · 0.8hardness assumptions · 0.8precision analysis · 0.7parameter optimization · 0.7bootstrapping · 0.5secure computation · 0.4approximate nearest neighbor search · 0.4ring learning with errors · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | New Secret Keys for Enhanced Performance in (T)FHEabstractFully Homomorphic Encryption has known impressive improvements in the last 15 years, going from a technology long thought to be impossible to an existing family of encryption schemes able to solve a plethora of practical use cases related to the privacy of sensitive information. Recent results mainly focus on improving techniques within the traditionally defined framework of GLWE-based schemes, but the recent CPU implementation improvements are mainly incremental. To keep improving this technology, one solution is to modify the aforementioned framework, by using slightly different hardness assumptions. Loris Bergerat, Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Adeline Roux-Langlois, Samuel Tap |
CCS | 2 |
| 2024 | Scooby: Improved multi-party homomorphic secret sharing based on FHE
Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Barry Van Leeuwen |
Inf. Comput. | 1 |
| 2023 | Parameter Optimization and Larger Precision for (T)FHE
Loris Bergerat, Anas Boudi, Quentin Bourgerie, Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap |
J. Cryptol. | 4 |
| 2021 | Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE
Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap |
ASIACRYPT (3) | 1 |
| 2020 | SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search
Hao Chen 0030, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi |
USENIX Security Symposium | 2 |
| 2020 | TFHE: Fast Fully Homomorphic Encryption Over the Torus
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène |
J. Cryptol. | 1 |
| 2019 | Multi-Key Homomorphic Encryption from TFHE
Hao Chen 0030, Ilaria Chillotti, Yongsoo Song |
ASIACRYPT (2) | 2 |
| 2019 | Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHEabstractOblivious RAM (ORAM) is a cryptographic primitive that allows a client to hide access pattern to its data encrypted and stored at a remote server. Traditionally, ORAM algorithms assume the server acts purely as a storage device. Under this assumption, ORAM has at least log(N) bandwidth blowup for N data entries. After three decades of improvements, ORAM algorithms have reached the optimal logarithmic bandwidth blowup. Nonetheless, in many practical use-cases a constant bandwidth overhead is desirable. To this purpose, Devadas et al. (TCC 2016) formalized the server computation model for ORAM and proposed Onion ORAM which relies on homomorphic computation to achieve constant worst-case bandwidth blowup. This line of work is generally believed to be purely theoretical, due to the large overheads of homomorphic computation. In this paper, we present Onion Ring ORAM, the first efficient constant bandwidth ORAM scheme in the single server model, based on the Onion ORAM construction and the leveled version of the TFHE scheme by Chillotti et al.. We propose a series of improvements, most notably including a more efficient homomorphic permutation protocol. We implement Onion Ring ORAM and show that it can outperform state-of-the-art logarithmic-bandwidth ORAM like Path ORAMs and Ring ORAM when the network throughput is limited. Under one setting, our construction reduces monetary cost per access by 40% and end-to-end latency by 35% over Ring ORAM. Hao Chen 0030, Ilaria Chillotti, Ling Ren 0001 |
CCS | 2 |
| 2019 | Improved Bootstrapping for Approximate Homomorphic Encryption
Hao Chen 0030, Ilaria Chillotti, Yongsoo Song |
EUROCRYPT (2) | 2 |
| 2017 | Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène |
ASIACRYPT (1) | 1 |
| 2016 | Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène |
ASIACRYPT (1) | 1 |
| 2016 | A Homomorphic LWE Based E-voting Scheme
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène |
PQCrypto | 1 |