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

Joep Peeters

dblp:200/8762 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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
Biometric security · 33% Privacy and data protection · 33% Cryptographic protocols and secure computation · 33%

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

TopicWeightPapersLastEvidence papers
Biometric security › biometric authentication
biometric verification
0.512021
Fast and Accurate Likelihood Ratio-Based Biometric Verification Secure Against Malicious Adversaries · IEEE Trans. Inf. Forensics Secur. 2021
Cryptographic protocols and secure computation
malicious security
0.512021
Fast and Accurate Likelihood Ratio-Based Biometric Verification Secure Against Malicious Adversaries · IEEE Trans. Inf. Forensics Secur. 2021
Privacy and data protection › biometric privacy
privacy-preserving biometric verification
0.512021
Fast and Accurate Likelihood Ratio-Based Biometric Verification Secure Against Malicious Adversaries · IEEE Trans. Inf. Forensics Secur. 2021

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

zero-knowledge proofs · 0.5likelihood ratio classifier · 0.5homomorphic encryption · 0.5
YearPublicationVenuePosition
2021 Fast and Accurate Likelihood Ratio-Based Biometric Verification Secure Against Malicious Adversaries
abstract
Biometric verification has been widely deployed in current authentication solutions as it proves the physical presence of individuals. Several solutions have been developed to protect the sensitive biometric data in such systems that provide security against honest-but-curious (a.k.a. semi-honest) attackers. However, in practice, attackers typically do not act honestly and multiple studies have shown severe biometric information leakage in such honest-but-curious solutions when considering dishonest, malicious attackers. In this paper, we propose a provably secure biometric verification protocol to withstand malicious attackers and prevent biometric data from any leakage. The proposed protocol is based on a homomorphically encrypted log likelihood-ratio (HELR) classifier that supports any biometric modality (e.g., face, fingerprint, dynamic signature, etc.) encoded as a fixed-length real-valued feature vector. The HELR classifier performs an accurate and fast biometric recognition. Furthermore, our protocol, which is secure against malicious adversaries, is designed from a protocol secure against semi-honest adversaries enhanced by zero-knowledge proofs. We evaluate both protocols for various security levels and record a sub-second speed (between 0.37s and 0.88s) for the protocol secure against semi-honest adversaries and between 0.95s and 2.50s for the protocol secure against malicious adversaries.
Amina Bassit, Florian Hahn 0001, Joep Peeters, Tom A. M. Kevenaar, Raymond N. J. Veldhuis, Andreas Peter 0001
IEEE Trans. Inf. Forensics Secur.3