Demo Data from VLDB 2026 / reviewers in the wild / expert
Mayeul de Bellabre
dblp:376/4402
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0008-2278-0411ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 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
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption |
0.9 | 1 | 2025 | Fast Homomorphic Evaluation of LWR-based PRFs · CCS 2025 |
Cryptographic primitives and cryptanalysis
pseudorandom functions |
0.9 | 1 | 2025 | Fast Homomorphic Evaluation of LWR-based PRFs · CCS 2025 |
Cryptographic primitives and cryptanalysis › cryptographic assumptions
learning with rounding |
0.3 | 1 | 2025 | Fast Homomorphic Evaluation of LWR-based PRFs · CCS 2025 |
Methods — techniques the papers use, named apart from their topics
homomorphic evaluation · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Fast Homomorphic Evaluation of LWR-based PRFsabstractCertain applications of fully homomorphic encryption (such as transciphering, universal thresholdizers, and PIR) require randomness while operating over encrypted data. This randomness has to be obliviously generated in the encrypted domain and remain encrypted throughout the computation. Moreover, it should be guaranteed that independent-looking random coins can be obliviously generated for different computations. Amit Deo, Marc Joye, Benoît Libert, Benjamin R. Curtis, Mayeul de Bellabre |
CCS | 5 |