scholarly journals Studies of the Robustness of a Transformation-Based Multi-Biometric Template Schemes Protection

2022 ◽  
Vol 11 (1) ◽  
pp. 335-344
Author(s):  
Fatima Bedad ◽  
Réda Adjoudj ◽  
Nassima Bousahba
Keyword(s):  
Biometric Template

Fused Iris Biometric Template Formation Using Logistic Maps and LFSR

2020 ◽  
Author(s):  
Shoaib Amin Banday ◽  
Ifrah Shakeel ◽  
Maliha Hamid ◽  
Waris Matto
Keyword(s):  
Biometric Template

scholarly journals Towards Better Performance for Protected Iris Biometric System with Confidence Matrix

Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 910
Author(s):  
Tong-Yuen Chai ◽  
Bok-Min Goi ◽  
Wun-She Yap
Keyword(s):  
Data Privacy ◽  
Recognition Performance ◽  
Generalized Solution ◽  
Performance Degradation ◽  
Public Confidence ◽  
Data Types ◽  
Privacy And Security ◽  
Biometric Data ◽  
Biometric Template ◽  
Template Protection

Biometric template protection (BTP) schemes are implemented to increase public confidence in biometric systems regarding data privacy and security in recent years. The introduction of BTP has naturally incurred loss of information for security, which leads to performance degradation at the matching stage. Although efforts are shown in the extended work of some iris BTP schemes to improve their recognition performance, there is still a lack of a generalized solution for this problem. In this paper, a trainable approach that requires no further modification on the protected iris biometric templates has been proposed. This approach consists of two strategies to generate a confidence matrix to reduce the performance degradation of iris BTP schemes. The proposed binary confidence matrix showed better performance in noisy iris data, whereas the probability confidence matrix showed better performance in iris databases with better image quality. In addition, our proposed scheme has also taken into consideration the potential effects in recognition performance, which are caused by the database-associated noise masks and the variation in biometric data types produced by different iris BTP schemes. The proposed scheme has reported remarkable improvement in our experiments with various publicly available iris research databases being tested.

scholarly journals Acceleration of Inner-Pairing Product Operation for Secure Biometric Verification

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2859
Author(s):  
Seong-Yun Jeon ◽  
Mun-Kyu Lee
Keyword(s):  
Mobile Technologies ◽  
Smart Devices ◽  
Biometric Data ◽  
Product Operation ◽  
Biometric Verification ◽  
Naive Method ◽  
Biometric Template ◽  
Need To Evaluate ◽  
Time Required ◽  
Pairing Product

With the recent advances in mobile technologies, biometric verification is being adopted in many smart devices as a means for authenticating their owners. As biometric data leakage may cause stringent privacy issues, many proposals have been offered to guarantee the security of stored biometric data, i.e., biometric template. One of the most promising solutions is the use of a remote server that stores the template in an encrypted form and performs a biometric comparison on the ciphertext domain, using recently proposed functional encryption (FE) techniques. However, the drawback of this approach is that considerable computation is required for the inner-pairing product operation used for the decryption procedure of the underlying FE, which is performed in the authentication phase. In this paper, we propose an enhanced method to accelerate the inner-pairing product computation and apply it to expedite the decryption operation of FE and for faster remote biometric verification. The following two important observations are the basis for our improvement—one of the two arguments for the decryption operation does not frequently change over authentication sessions, and we only need to evaluate the product of multiple pairings, rather than individual pairings. From the results of our experiments, the proposed method reduces the time required to compute an inner-pairing product by 30.7%, compared to the previous best method. With this improvement, the time required for biometric verification is expected to decrease by up to 10.0%, compared to a naive method.

scholarly journals Palmprint Based Multidimensional Fuzzy Vault Scheme

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Hailun Liu ◽  
Dongmei Sun ◽  
Ke Xiong ◽  
Zhengding Qiu
Keyword(s):  
Error Correcting Code ◽  
Experimental Results ◽  
Fuzzy Vault ◽  
Biometric Template ◽  
Template Protection ◽  
Biometric Template Protection

Fuzzy vault scheme (FVS) is one of the most popular biometric cryptosystems for biometric template protection. However, error correcting code (ECC) proposed in FVS is not appropriate to deal with real-valued biometric intraclass variances. In this paper, we propose a multidimensional fuzzy vault scheme (MDFVS) in which a general subspace error-tolerant mechanism is designed and embedded into FVS to handle intraclass variances. Palmprint is one of the most important biometrics; to protect palmprint templates; a palmprint based MDFVS implementation is also presented. Experimental results show that the proposed scheme not only can deal with intraclass variances effectively but also could maintain the accuracy and meanwhile enhance security.

scholarly journals Machine Learning for Biometrics

2012 ◽  
pp. 704-723
Author(s):  
Albert Ali Salah
Keyword(s):  
Machine Learning ◽  
Learning Approaches ◽  
Relevant Research ◽  
Robust Identification ◽  
Research Issues ◽  
Personal Traits ◽  
Machine Learning Methods ◽  
Biometric Template ◽  
Fusion Methods ◽  
Areas Of Interest

Biometrics aims at reliable and robust identification of humans from their personal traits, mainly for security and authentication purposes, but also for identifying and tracking the users of smarter applications. Frequently considered modalities are fingerprint, face, iris, palmprint and voice, but there are many other possible biometrics, including gait, ear image, retina, DNA, and even behaviours. This chapter presents a survey of machine learning methods used for biometrics applications, and identifies relevant research issues. The author focuses on three areas of interest: offline methods for biometric template construction and recognition, information fusion methods for integrating multiple biometrics to obtain robust results, and methods for dealing with temporal information. By introducing exemplary and influential machine learning approaches in the context of specific biometrics applications, the author hopes to provide the reader with the means to create novel machine learning solutions to challenging biometrics problems.

scholarly journals An Efficient and Privacy-Preserving Biometric Identification Scheme Based on the FITing-Tree

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Xiaopeng Yang ◽  
Hui Zhu ◽  
Songnian Zhang ◽  
Rongxing Lu ◽  
Xuesong Gao
Keyword(s):  
Homomorphic Encryption ◽  
Security Analysis ◽  
Privacy Preserving ◽  
Biometric Identification ◽  
Large Dataset ◽  
Biometric Data ◽  
Communication Costs ◽  
Identification Scheme ◽  
Biometric Template ◽  
Cloud Servers

Biometric identification services have been applied to almost all aspects of life. However, how to securely and efficiently identify an individual in a huge biometric dataset is still very challenging. For one thing, biometric data is very sensitive and should be kept secure during the process of biometric identification. On the other hand, searching a biometric template in a large dataset can be very time-consuming, especially when some privacy-preserving measures are adopted. To address this problem, we propose an efficient and privacy-preserving biometric identification scheme based on the FITing-tree, iDistance, and a symmetric homomorphic encryption (SHE) scheme with two cloud servers. With our proposed scheme, the privacy of the user’s identification request and service provider’s dataset is guaranteed, while the computational costs of the cloud servers in searching the biometric dataset can be kept at an acceptable level. Detailed security analysis shows that the privacy of both the biometric dataset and biometric identification request is well protected during the identification service. In addition, we implement our proposed scheme and compare it to a previously reported M-Tree based privacy-preserving identification scheme in terms of computational and communication costs. Experimental results demonstrate that our proposed scheme is indeed efficient in terms of computational and communication costs while identifying a biometric template in a large dataset.

Sign in / Sign up

Export Citation Format

Share Document