2007
DOI: 10.1016/j.patrec.2007.08.008
|View full text |Cite
|
Sign up to set email alerts
|

Symmetric hash functions for secure fingerprint biometric systems

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0
1

Year Published

2010
2010
2015
2015

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 102 publications
(30 citation statements)
references
References 18 publications
0
28
0
1
Order By: Relevance
“…Thus, the biometric matching takes place directly in the transformed domain. Biohashing [7], cancelable biometrics [8], and robust hashing [9] are some of the well-known schemes that can be grouped under feature transformation. Some feature transformation schemes [7] are non-invertible only when the supplementary data (e.g., key or password) is assumed to be a secret.…”
Section: Biometric Template Protection Approachesmentioning
confidence: 99%
“…Thus, the biometric matching takes place directly in the transformed domain. Biohashing [7], cancelable biometrics [8], and robust hashing [9] are some of the well-known schemes that can be grouped under feature transformation. Some feature transformation schemes [7] are non-invertible only when the supplementary data (e.g., key or password) is assumed to be a secret.…”
Section: Biometric Template Protection Approachesmentioning
confidence: 99%
“…PCA and ICA (independent component analysis) coefficients are extracted and both feature vectors are randomly scrambled and added in order to create a transformed template. Tulyakov et al [162,163] propose a method for generating cancelable fingerprint hashes. Instead of aligning fingerprint minutiae, the authors apply order invariant hash functions, i.e., symmetric complex hash functions.…”
Section: Further Investigations On Cancelable Biometricsmentioning
confidence: 99%
“…Lee et al [167] presented a method for generating alignment-free cancelable fingerprint templates. Similar to [59,162,163], orientation information is used for each minutiae point. Cancelability is provided by a user's PIN and the user-specific random vector is used to extract translation and rotation invariant values of minutiae points.…”
Section: Further Investigations On Cancelable Biometricsmentioning
confidence: 99%
“…In this scheme, each minutiae is transformed according to the orientation field around that minutiae, which makes the relative translation of the minutiae invariant to the positioning of the finger. Tulyakov et al 22 use each minutia along with its two nearest neighbors to select one of the several symmetric functions available. The selected symmetric function is then evaluated on the three minutiae to obtain the coordinates of the transformed minutia.…”
Section: Interest Point Based Template Transformationmentioning
confidence: 99%