Face Recognition with Renewable and Privacy Preserving Binary Templates

Kevenaar, Tom A. M.; Schrijen, Geert Jan; Veen, Michiel van der; Akkermans, A.H.M.; Zuo, Fei

doi:10.1109/autoid.2005.24

Cited by 120 publications

(148 citation statements)

References 11 publications

Supporting

Mentioning

146

Contrasting

Order By: Relevance

“…Kuan et al [6] presented a method for extracting cryptographic keys from dynamic handwritten signatures. A similar approach 4 for face templates was presented by Kevenaar et al [7] in which they generate binary feature vectors from biometric face data that can be protected by using helper data introduced into this bit sequence.…”

Section: Previous Workmentioning

confidence: 99%

Symmetric hash functions for secure fingerprint biometric systems

Tulyakov

Farooq

Mansukhani

et al. 2007

Pattern Recognition Letters

102

View full text Add to dashboard Cite

Securing biometrics databases from being compromised is one of the most important challenges that must be overcome in order to demonstrate the viability of biometrics based authentication. In this paper we present a novel method of hashing fingerprint minutia and performing fingerprint identification in the hash space. Our approach uses a family of symmetric hash functions and does not depend on the location of the (usually unstable) singular points (core and delta). In fact, most approaches of hashing minutia and developing a cancellable system described in the literature assume the location of the singular points. Others assume a pre-alignment between the test and the stored fingerprint templates. These assumptions are unrealistic given that fingerprints are very often only partially captured by the commercially available sensors. The Equal Error Rate (EER) achieved by our system is about 3%. We also present the performance analysis of a hybrid system that has an EER of about 2% which is very close to the performance of plain matching in the minutia space.

show abstract

Section: Previous Workmentioning

confidence: 99%

Symmetric hash functions for secure fingerprint biometric systems

Tulyakov

Farooq

Mansukhani

et al. 2007

Pattern Recognition Letters

102

View full text Add to dashboard Cite

show abstract

“…However, the drawback of not having a score is that it is not possible to apply fusion at score-level. Therefore, published work on fusion with template protection are mainly focussed on fusion at feature-level or at decision-level [33,34,[46][47][48]. However, we show in Chapter 7 that by extending the PI reconstruction process with the derivation of a dissimilarity score, it is possible to apply fusion at score-level, given some limitations on the match and non-match regions that can be created.…”

Section: Fusionmentioning

confidence: 99%

“…bits with a smaller bit-error probability [33][34][35][42][43][44][45]. We limit the scope of our analysis to the simple binarization scheme, the reliable component selection (RCS) scheme [33][34][35], and the DROBA scheme [42].…”

Section: Bit Extraction Part (Ad 1 )mentioning

confidence: 99%

“…A more detailed description of the HDS is provided in Section 2.3.1. An abstract overview of the HDS scheme as used in [33][34][35] is portrayed in Figure 1.5 and consists of two main parts: (i) Bit Extraction and (ii) Bit Protection part. In the enrolment phase, first a real-valued feature vector is extracted from each acquired enrolment sample by the Feature Extraction module.…”

Section: Helper Data System (Hds)mentioning

confidence: 99%

“…In the verification phase, the key can be released by combining the protected template with a newly captured probe biometric sample. Examples of known key binding and release implementations are the Code-Offset Construction [40,64,65], Fuzzy Commitment Scheme (FCS) [36,[66][67][68][69][70][71], the Helper Data System (HDS) [33][34][35]72,73], Quantization Index Modulation (QIM) [48,74,75], and the Fuzzy Vault [46,[76][77][78][79][80][81][82][83][84][85][86]. The first three schemes are related to each other as portrayed in Figure 2.6.…”

Section: Key Bindingmentioning

confidence: 99%

See 2 more Smart Citations

On the Performance of Helper Data Template Protection Schemes

Kelkboom

View full text Add to dashboard Cite

Security and efficiency analysis of the Hamming distance computation protocol based on oblivious transfer

Kiraz

Genç

Kardaş

2015

Security Comm Networks

View full text Add to dashboard Cite

Abstract-In Financial Cryptography 2013, Bringer, Chabanne and Patey proposed two cryptographic protocols for the computation of Hamming distance in the two-party setting. Their first scheme uses Oblivious Transfer and provides security in the semi-honest model. The other scheme uses Committed Oblivious Transfer (COT) and is claimed to provide full security in the malicious case. The proposed protocols have direct implications to biometric authentication schemes between a prover and a verifier where the verifier has biometric data of the users in plain form.In this paper, we show that their protocol against malicious adversaries is not actually secure. Namely, we show a generic attack such that a malicious user can compute a Hamming distance which is different from the actual value. For biometric authentication systems, this attack allows a malicious adversary to pass the authentication without knowledge of the honest user's input with at most O(n) complexity instead of O(2 n ), where n is the input length. We propose an enhanced version of their protocol where this attack is eliminated. The security of our modified protocol is proved using simulation-based paradigm. Also as for efficiency concerns, the modified protocol utilizes Verifiable Oblivious Transfer (VOT) which excludes the commitments to outputs (as they exist in COT). We show that the use of VOT does not reduce the security of the protocol but improves the efficiency significantly.

show abstract

Face Recognition with Renewable and Privacy Preserving Binary Templates

Cited by 120 publications

References 11 publications

Symmetric hash functions for secure fingerprint biometric systems

Symmetric hash functions for secure fingerprint biometric systems

On the Performance of Helper Data Template Protection Schemes

Security and efficiency analysis of the Hamming distance computation protocol based on oblivious transfer

Contact Info

Product

Resources

About