Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Samuel Tap

dblp:294/0685 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2025
0009-0003-1778-5297ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5 · 5 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
5 papers
Cryptographic primitives and cryptanalysis · 95% Cryptographic protocols and secure computation · 5%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption
2.542025
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.932024
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.622025
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.912025
Accelerating TFHE with Sorted Bootstrapping Techniques · ASIACRYPT (7) 2025
Cryptographic primitives and cryptanalysis
stream cipher
0.912025
Transistor: a TFHE-Friendly Stream Cipher · CRYPTO (5) 2025
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
TFHE bootstrapping
0.912025
Accelerating TFHE with Sorted Bootstrapping Techniques · ASIACRYPT (7) 2025
Cryptographic protocols and secure computation
arithmetic circuits
0.512021
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.512021
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.512021
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

TFHE · 0.9secret key optimization · 0.8hardness assumptions · 0.8precision analysis · 0.7parameter optimization · 0.7bootstrapping · 0.5
YearPublicationVenuePosition
2025 Accelerating TFHE with Sorted Bootstrapping Techniques
Loris Bergerat, Jean-Baptiste Orfila, Adeline Roux-Langlois, Samuel Tap
ASIACRYPT (7)4
2025 Transistor: a TFHE-Friendly Stream Cipher
Jules Baudrin, Sonia Belaïd, Nicolas Bon 0001, Christina Boura, Anne Canteaut, Gaëtan Leurent, Pascal Paillier, Léo Perrin, Matthieu Rivain, Yann Rotella, Samuel Tap
CRYPTO (5)11
2024 New Secret Keys for Enhanced Performance in (T)FHE
abstract
Fully 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
CCS6
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.7
2021 Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE
Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap
ASIACRYPT (3)4