Fingerprint Template Protection Research Articles

Cancelable fingerprint template protection based on random quantization and improved bloom filter

Cancelable fingerprint template protection based on random quantization and improved bloom filter

One-Factor Cancellable Fingerprint Template Protection Based on Index Self-Encoding

The existing one-factor cancellable biometrics algorithms generally require random sequences to reorder the biometrics, which reduces the discrimination of the transformed biometrics. Some algorithms hide and transmit the random sequence by XORing the random sequence with original biometrics, which may cause the leakage of the original biometrics. Therefore, this paper proposes a one-factor cancellable fingerprint template protection based on index self-encoding. First, the integer sequence generated by the hash function is used as the index. The random sequence is automatically encoded directly by the index value, and the generated binary sequence retains the original biological characteristics to the greatest extent. Second, self-encoding binary sequence and random binary sequence are XORed to obtain the encoded key without directly storing binary factor sequences. Experiments are implemented on the fingerprint database of FVC2002 and FVC2004, the results show that the recognition rate is enhanced; meanwhile, it fits the design criteria of cancellable biometrics.

FinCaT: a novel approach for fingerprint template protection using quadrant mapping via non-invertible transformation

FinCaT: a novel approach for fingerprint template protection using quadrant mapping via non-invertible transformation

A CANCELLABLE AND IRREVOCABLE APPROACH FOR FINGERPRINT TEMPLATE PROTECTION USING OPTIMAL ITERATIVE SOLUBILITY ALGORITHM AND SECURE POINT BASE

Biometric authentication scheme is a robust, reliable, and convenient way for person authentication with security. It is necessary to protect biometric information for maintaining secrecy. In this paper, fingerprint template protection is carried out using the optimal iterative solubility (OIS) algorithm. The purpose of developing the OIS algorithm is to generate the matrix coefficient of the template protection matrix. The processing steps for fingerprint template protection involve two phases such as enrolment and authentication. In the enrolment phase, the identity vector of the input fingerprint image is generated with the assistance of minutiae points, secure point base (SPB) and OIS algorithm, and then, the database is created. In the authentication phase, the query image is considered as an input, and the identity vector is generated based on the query image in the same manner as enrolment phase. Moreover, the cross indexing-based matching is done using Tanimoto coefficient to make final decisions in order to check whether the user authorization is accepted or rejected. The experimental result demonstrates that the developed OIS algorithm attained a maximum accuracy of 0.96, minimum false acceptance rate (FAR) of 0.077, minimum false rejection rate (FRR) of 0.070, and maximum genuine acceptance rate (GAR) of 0.964, correspondingly.

Adaptation of Pair-Polar Structures to Compute a Secure and Alignment-Free Fingerprint Template

The unalterable nature of fingerprint biometrics leads to permanent identity loss of a user if an original fingerprint template is compromised. Moreover, it is evident in the literature that reconstructing a fingerprint image from an original fingerprint template is a feasible task. In order to protect the fingerprint template, we propose a noninvertible and alignment-free fingerprint template protection technique by exploiting the pair-polar minutiae structures. In the proposed technique, a secure fingerprint template is generated in the form of a set of binary vectors. These vectors are computed from the many-to-one mapping of the transformed pair-polar coordinates into a 3-D grid. Results of the proposed technique are analyzed in terms of revocability, unlinkability, security, and performance on six publicly available databases of Fingerprint Verification Competition 2002 and 2004. The overall analysis of the results clearly shows the effectiveness of the proposed technique as compared to the existing state-of-the-art techniques.

Chaotic-Based Encryption Algorithm using Henon and Logistic Maps for Fingerprint Template Protection

Fingerprint is a reliable user authentication method as it is unique to individual users that makes it efficient for authenticating users. In a fingerprint authentication system, user fingerprint information is stored in databases in an image format known as a fingerprint template. Although fingerprint is reliable, the templates stored in the database are exposed to security threats either during the data transmission process over the network or in storage. Therefore, there is a need to protect the fingerprint template, especially in unsecured networks to maintain data privacy and confidentiality. Many past studies proposed fingerprint template protection (FTP) using chaotic-based encryption algorithms that are more suitable to secure images than conventional encryption such as DES, AES, and RSA. The chaotic-based encryption algorithms have been improved a lot in terms of their robustness. However, the robustness of the algorithm caused a trade-off to encryption speed where it remains an issue in FTP. Hence, this study aims to improve the limitations found in the existing chaotic-based encryption algorithms for FTP by improving its encryption speed using Henon and Logistic map. A series of simulations were conducted using MATLAB to evaluate the performance of the proposed chaotic-based encryption algorithm for FTP through different analyses covering key sensitivity, histogram, correlations, differential, information entropy, and encryption/decryption speed. The performance proposed encryption algorithm was promising which could be a starting point for detailed analysis and implementation in real application domains.

On the methodology of fingerprint template protection schemes conception : meditations on the reliability

Among the most major potential attacks against fingerprint authentication systems are those that target the stored reference templates. These threats are extremely damaging as they can lead to the invasion of user privacy. The countermeasures to secure fingerprint templates are therefore an indisputable necessity. In literature, although there are so many approaches that address this kind of vulnerability, it turns out to be very difficult to generalize their uses. Given that each system has its own particularities, going from the fingerprint trait acquisition to the matching process, the majority of protection schemes, that are proposed as generic solutions, are not sufficiently mature for large-scale deployment. Consequently, we believe that the methodology of fingerprint template protection schemes conception should be oriented to build specific protection schemes for every unprotected system, which will provide the best compromise between performance and security compared to any generic protection solution. By adopting this methodology, we propose in this paper a new protection scheme for fingerprint templates that is well adapted to a well-known existing unprotected fingerprint minutia system. Our experimental results, obtained using standard benchmarks such as FVC 2002 DB1 and DB2, have proven that the proposed technique meets the requirements of revocability, unlinkability, non-invertibility, and high recognition accuracy.

Fingerprint Template Protection Using Irreversible Minutiae Tetrahedrons

Abstract The use of fingerprint continues to increase constantly with the propagation of biometric authentication technologies. Fingerprint is today the most widely used biometric modality for human verification and identification, due to its practical use and its discriminative structure that allows to different identities to be easily distinguished. Unfortunately, this emergence has been accompanied by a number of problems and challenges related to identity theft and to security issues in general. To address these concerns, many approaches have been proposed in which only few of them were able to reach an acceptable level of both security and performance. In this paper, we propose a new fingerprint template protection scheme that enhances the security of protected system while preserving performance. The proposed approach is a minutiae-based technique that performs fingerprint matching in a transformed space using irreversible minutiae tetrahedrons. Using the original Fingerprint Verification Competition (FVC) protocol, the provided experimental results on FVC2002 DB1, DB2 and DB3 fingerprint databases have shown satisfactory recognition rates. Our results are compared to some existing techniques that use the same protocol of test. We have proved as well that the proposed scheme meets the requirements of revocability, unlinkability and irreversibility.

A novel fingerprint template protection and fingerprint authentication scheme using visual secret sharing and super-resolution

Fingerprint is the most recommended and extensively practicing biometric trait for personal authentication. Most of the fingerprint authentication systems trust minutiae as the characteristic for authentication. These characteristics are preserved as fingerprint templates in the database. However, it is observed that the databases are not secure and can be negotiated. Recent studies reveal that, if a person’s minutiae points are dripped, fingerprint can be restored from these points. Similarly, if the fingerprint records are lost, it is a permanent damage. There is no mechanism to replace the fingerprint as it is part of the human body. Hence there is a necessity to secure the fingerprint template in the database. In this paper, we introduce a novel fingerprint template protection and fingerprint authentication scheme using visual secret sharing and super-resolution. During enrollment, a secret fingerprint image is encrypted into n shares. Each share is stored in a distinct database. During authentication, the shares are collected from various databases. The original secret fingerprint image is restored using a multiple image super-resolution procedure. The experimental results show that the reconstructed fingerprints are similar to the original fingerprints. The proposed method is robust, secure, and efficient in terms of fingerprint template protection and authentication.

Chaotic-Based Encryption Algorithm using Henon and Logistic Maps for Fingerprint Template Protection

Fingerprint is a reliable user authentication method as it is unique to individual users that makes it efficient for authenticating users. In a fingerprint authentication system, user fingerprint information is stored in databases in an image format known as a fingerprint template. Although fingerprint is reliable, the templates stored in the database are exposed to security threats either during the data transmission process over the network or in storage. Therefore, there is a need to protect the fingerprint template, especially in unsecured networks to maintain data privacy and confidentiality. Many past studies proposed fingerprint template protection (FTP) using chaotic-based encryption algorithms that are more suitable to secure images than conventional encryption such as DES, AES, and RSA. The chaotic-based encryption algorithms have been improved a lot in terms of their robustness. However, the robustness of the algorithm caused a trade-off to encryption speed where it remains an issue in FTP. Hence, this study aims to improve the limitations found in the existing chaotic-based encryption algorithms for FTP by improving its encryption speed using Henon and Logistic map. A series of simulations were conducted using MATLAB to evaluate the performance of the proposed chaotic-based encryption algorithm for FTP through different analyses covering key sensitivity, histogram, correlations, differential, information entropy, and encryption/decryption speed. The performance proposed encryption algorithm was promising which could be a starting point for detailed analysis and implementation in real application domains.

Security and performance enhancement of fingerprint biometric template using symmetric hashing

There are several fingerprint template protection methods among them the most common method is the symmetric hashing of the fingerprint template. The main problems still unsolved in the case of symmetric hashing are the excessive drop in accuracy, the reversibility and the linkability of hashed template. The experimental analysis of the existing hash method point out that there is an excessive drop in accuracy of matching. In this paper a modified symmetric hash method is proposed in which a key value is used as a multiplication parameter. The modified symmetric hash function is a combination of salting and non invertible transformation. Systematic experimentation point out that the accuracy of matching of the modified symmetric hash method is much better than the existing method. The security of the modified hashed fingerprint template is analysed based on irreversibility and unlinkability and the modified hashed fingerprint templates are more secure than the hashed fingerprint templates.

Evaluating biometrics fingerprint template protection for an emergency situation

Biometric template protection approaches have been developed to secure the biometric templates against image reconstruction on the stored templates. Two cancellable fingerprint template protection approaches namely minutiae-based bit-string cancellable fingerprint template and modified minutiae-based bit-string cancellable fingerprint template, are selected to be evaluated. Both approaches include the geometric information of the fingerprint into the extracted minutiae. Six modified fingerprint data sets are derived from the original fingerprint images in FVC2002DB1_B and FVC2002DB2_B by conducting the rotation and changing the quality of original fingerprint images according to the environment conditions during an emergency situation such as wet or dry fingers and disoriented angle of fingerprint images. The experimental results show that the modified minutiae-based bit-string cancellable fingerprint template performs well on all conditions during an emergency situation by achieving the matching accuracy between 83% and 100% on FVC2002DB1_B data set and between 99% and 100% on FVC2002DB2_B data set.

Security performance evaluation of biometric lightweight encryption for fingerprint template protection

Security performance evaluation of biometric lightweight encryption for fingerprint template protection

3-Dimensional Secured Fingerprint Shell

Biometric systems relying on fingerprint usually use minutiae points information and store it directly in the database. However, databases are prone to get attacked by an adversary. As fingerprint can be generated using the information of its minutiae points, it is essential to ensure the security of the fingerprint data in biometric systems. Another problem associated with fingerprint authentication systems is the variation among fingerprint images of the same subject, which occurs due to rotation and translation of finger at the time of capturing fingerprints through sensors. A technique called Fingerprint Shell is proposed by Moujahdi et al. as a secured representation of fingerprint template. However, this technique uses only one intra-subject invariant feature, which is the distances between minutiae points and singular point to generate a 2-dimensional spiral curve which is used as a secured user template. In this paper, we analyze the weaknesses of the Fingerprint Shell and propose a highly secured fingerprint template protection technique in which a 3-dimensional spiral curve is generated as a secured user template for a fingerprint. To obtain the proposed secured fingerprint template, we utilize three intra-subject invariant features, namely distances between minutiae points and singular point, the orientation information of minutiae points and the ridge counts between minutiae points and singular point. Outcomes of the experimental analysis conducted on FVC (2000, 2002 and 2004) and IIT Kanpur databases show highly encouraging performance and exhibit the viability of the proposed technique. The technique has also been analyzed with respect to various attacks and is found to be highly secure and robust.

Security analysis of prealigned fingerprint template using fuzzy vault scheme

Biometric systems accumulate information from biometric elements of an individual and used to exceptionally confirm the person with the physical and behavioral properties of the biometric characteristic. Biometrics and cryptography systems have been identified as the two main components of digital security system. Cryptography is combined with biometric to achieve high security. In this paper, fingerprint template protection is proposed which is based on fuzzy vault scheme. Initially, enrolled fingerprint images are preprocessed using some image processing techniques and preprocessed images are prealigned automatically using directed reference point. All the minutiae points are extracted and extracted minutiae features along with secret key are used to produce the fuzzy vault. Query features are given as an input with the stored template to recover the corresponding key. The proposed method is validated on FVC 2002 database. Simulation results prove that the proposed method can achieve high genuine acceptance rate with improved security.

Fingerprint and Iris Template Protection for Health Information System Access and Security

Fingerprint and Iris Template Protection for Health Information System Access and Security

Cancelable Fingerprint Cryptosystem Using Multiple Spiral Curves and Fuzzy Commitment Scheme

The increased use of biometric-based authentication systems in a variety of applications has made biometric template protection an important issue. Unlike conventional systems, biometric cannot be revoked or changed. This made template protection a critical issue to be considered in the recent years. This paper proposes a cancelable fingerprint cryptosystem using multiple spiral curves and fuzzy commitment scheme. The method is built by combining cancelable biometrics and biometric cryptosystems. First, we compute transformed minutiae features using multiple spiral curves. Further, these transformed features are encrypted using fuzzy commitment scheme. Hence, a secure template is obtained. Experimental results and analysis prove the credibility of proposed method with recently presented methods of fingerprint template protection.

Multi-algorithmic cancelable fingerprint template generation based on weighted sum rule and T-operators

With the emergence of biometric-based authentication systems in real-world applications, template protection in biometrics is a significant issue to be considered in the recent years. This paper presents two feature set computation algorithms, namely nearest neighbor feature set (NNFS) and Delaunay triangle feature set (DTFS), for a fingerprint sample. Further, the match scores obtained from these algorithms are fused using weighted sum rule and T-operators (T-norms and T-conorms). The experimental evaluation done on FVC 2002 databases confirms the credibility of fusion method compared to each individual algorithm used for fusing. The EER obtained for proposed method is 0 %, 0.059 %, and 3.93 % for FVC 2002 DB1, DB2, and DB3 databases, respectively. This paper also aims to prove the effectiveness of applying T-operators for fusion at score level in fingerprint template protection.

Generating cancellable fingerprint templates based on Delaunay triangle feature set construction

In this study, the authors propose a novel fingerprint template protection scheme that is developed using Delaunay triangulation net constructed from the fingerprint minutiae. The authors propose two methods namely FS_INCIR and FS_AVGLO to construct a feature set from the Delaunay triangles. The feature set computed is quantised and mapped to a 3D array to produce fixed length 1D bit string. This bit string is applied with a DFT to generate a complex vector. Finally, the complex vector is multiplied by user's key to generate a cancellable template. The proposed computation of feature set maintained a good balance between security and performance. These methods are tested on FVC 2002 and FVC 2004 databases and the experimental results show satisfactory performance. Further, the authors analysed the four requirements namely diversity, revocability, irreversibility and accuracy for protecting biometric templates. Thus, the feasibility of proposed scheme is depicted.

Cancellability and diversity analysis of fingerprint template protection scheme based on compact minutiae pattern

ABSTRACTAs fingerprints continue toward ubiquity in human recognition applications, growing fingerprint databases will pose an increasingly greater risk of irreversible identity theft in the event of a database breach. Consequently, more focus is being placed on researching new and effective ways of securing fingerprint templates during database storage. Recently, a new fingerprint template protection scheme, based on representing a fingerprint by a sparse 3-, 4-, or 5-minutiae pattern, has been proposed. The most important advantage of this method over other fingerprint template protection schemes is that it employs only a small number of identifying features in the creation of the protected template, such that it is impossible to recover the original fingerprint even if the protected template is compromised. In this article, we present a thorough analysis to demonstrate that this new fingerprint construct also boasts impressive cancellability and diversity properties. Cancellability allows for the replacement of a compromised template with a new template from the same fingerprint, and diversity enables a person to enroll into multiple applications using the same fingerprint without the prospect of being tracked across the different applications.