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

Charlotte Bonte

dblp:200/2066 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2022
0000-0002-4365-1845ORCID · corroborated

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

Security and privacy · 2 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
2 papers
Cryptographic primitives and cryptanalysis · 75% Cryptographic protocols and secure computation · 25%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption
0.612022
FINAL: Faster FHE Instantiated with NTRU and LWE · ASIACRYPT (2) 2022
Cryptographic protocols and secure computation
function evaluation
0.312017
Faster Homomorphic Function Evaluation Using Non-integral Base Encoding · CHES 2017
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.312017
Faster Homomorphic Function Evaluation Using Non-integral Base Encoding · CHES 2017

Methods — techniques the papers use, named apart from their topics

learning with errors · 0.6NTRU · 0.6non-integral base encoding · 0.3
YearPublicationVenuePosition
2022 FINAL: Faster FHE Instantiated with NTRU and LWE
Charlotte Bonte, Ilia Iliashenko, Jeongeun Park 0001, Hilder Vitor Lima Pereira, Nigel P. Smart
ASIACRYPT (2)1
2018 Towards practical privacy-preserving genome-wide association study
abstract
The deployment of Genome-wide association studies (GWASs) requires genomic information of a large population to produce reliable results. This raises significant privacy concerns, making people hesitate to contribute their genetic information to such studies. We propose two provably secure solutions to address this challenge: (1) a somewhat homomorphic encryption (HE) approach, and (2) a secure multiparty computation (MPC) approach. Unlike previous work, our approach does not rely on adding noise to the input data, nor does it reveal any information about the patients. Our protocols aim to prevent data breaches by calculating the χ 2 statistic in a privacy-preserving manner, without revealing any information other than whether the statistic is significant or not. Specifically, our protocols compute the χ 2 statistic, but only return a yes/no answer, indicating significance. By not revealing the statistic value itself but only the significance, our approach thwarts attacks exploiting statistic values. We significantly increased the efficiency of our HE protocols by introducing a new masking technique to perform the secure comparison that is necessary for determining significance. We show that full-scale privacy-preserving GWAS is practical, as long as the statistics can be computed by low degree polynomials. Our implementations demonstrated that both approaches are efficient. The secure multiparty computation technique completes its execution in approximately 2 ms for data contributed by one million subjects.
Charlotte Bonte, Eleftheria Makri, Amin Ardeshirdavani, Jaak Simm, Yves Moreau, Frederik Vercauteren
BMC Bioinform.1
2017 Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
Charlotte Bonte, Carl Bootland, Joppe W. Bos, Wouter Castryck, Ilia Iliashenko, Frederik Vercauteren
CHES1