Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jean-Baptiste Orfila
dblp:154/6414
· DBLP profile ↗
7ranked-venue papers
0as first author
4since 2021 · last 2025
0009-0001-4526-0434ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 7 · 4 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
4 papers |
Cryptographic primitives and cryptanalysis · 94% Cryptographic protocols and secure computation · 6% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption |
2.3 | 3 | 2025 | Accelerating TFHE with Sorted Bootstrapping Techniques · ASIACRYPT (7) 2025 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 |
1.9 | 3 | 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 › post-quantum cryptography
lattice-based cryptography |
1.6 | 2 | 2025 | Accelerating TFHE with Sorted Bootstrapping Techniques · ASIACRYPT (7) 2025 New Secret Keys for Enhanced Performance in (T)FHE · CCS 2024 |
Cryptographic primitives and cryptanalysis › homomorphic encryption
bootstrapping optimization |
0.9 | 1 | 2025 | Accelerating TFHE with Sorted Bootstrapping Techniques · ASIACRYPT (7) 2025 |
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
TFHE bootstrapping |
0.9 | 1 | 2025 | Accelerating TFHE with Sorted Bootstrapping Techniques · ASIACRYPT (7) 2025 |
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 › TFHE
programmable bootstrapping |
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
TFHE |
0.5 | 1 | 2021 | Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE · ASIACRYPT (3) 2021 |
Methods — techniques the papers use, named apart from their topics
secret key optimization · 0.8hardness assumptions · 0.8precision analysis · 0.7parameter optimization · 0.7bootstrapping · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Accelerating TFHE with Sorted Bootstrapping Techniques
Loris Bergerat, Jean-Baptiste Orfila, Adeline Roux-Langlois, Samuel Tap |
ASIACRYPT (7) | 2 |
| 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 | 4 |
| 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. | 6 |
| 2021 | Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE
Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap |
ASIACRYPT (3) | 3 |
| 2017 | LOCALPKI: A User-Centric Formally Proven Alternative to PKIXabstractInternational audience Jean-Guillaume Dumas, Pascal Lafourcade 0001, Francis Melemedjian, Jean-Baptiste Orfila, Pascal Thoniel |
SECRYPT | 4 |
| 2017 | Dual protocols for private multi-party matrix multiplication and trust computations
Jean-Guillaume Dumas, Pascal Lafourcade 0001, Jean-Baptiste Orfila, Maxime Puys |
Comput. Secur. | 3 |
| 2016 | Private Multi-party Matrix Multiplication and Trust ComputationsabstractInternational audience Jean-Guillaume Dumas, Pascal Lafourcade 0001, Jean-Baptiste Orfila, Maxime Puys |
SECRYPT | 3 |