A Novel Template Protection Algorithm for Iris Recognition

Author(s):  
Zhifang Wang ◽  
Qi Han ◽  
Xiamu Niu ◽  
Christoph Busch

Over the past few years, biometric systems have become prominent in terms of verification of the user identity due to increased demand of security in the networked society. Iris recognition system is a novel technology for the verification of user which is considered as the most secure, reliable and stable technique. It is generally accepted in the areas with high security. Though, security is major concern in this field, a significant number of approaches have been proposed to secure iris biometrics, But still, there is a scope to improve these techniques. Thus, in this work, a novel model is proposed which employs a bitmask compression technique to secure the template obtained for iris by compressing its actual size. In addition; SVM is used for the classification process. Mean Square Error, Bit Error Rate, PSNR, and GAR are different parameters which are used for measuring the effectiveness of the proposed model. The simulation results are carried out in MATLAB software and the comparative results validated the efficacy of the novel model with respect to security, efficacy and accuracy.


Author(s):  
Krishna Prasad K.

Authentication is using one or multiple mechanisms to show that you are who you claim to be. As soon as the identity of the human or machine is demonstrated, then human or machine is authorized to grant some services. The modern research study reveals that fingerprint is not so secured like secured a password which consists of alphanumeric characters, number and special characters. This model proposes instead of password iris of the user, which is also one of the strongest physiological biometrics recognition systems. The iris is absolutely fashioned by way of eighth month of adults, and remains stable throughout the life span. In recent years, the usage of Iris for human identification has substantially grown due to the tremendous advantages with traditional or usual or normal authentication techniques based on private identity numbers (PINs) or passwords. In fact, given that iris is intrinsically and uniquely related to a character, they can't be forgotten, without difficulty stolen or reproduced. But, the use of Iris may additionally have some drawbacks related to viable safety breaches. On the grounds that iris traits are limited and immutable, if an attacker has gets access to the database where they are saved, the system security may be irreparably compromised. To deal with this hassle, an iris structure with template protection becomes very much essential. In this paper the different methods of iris recognition are studied with its features. This paper also discusses about multifactor authentication model.


Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 164
Author(s):  
Tong-Yuen Chai ◽  
Bok-Min Goi ◽  
Yong-Haur Tay ◽  
and Zhe Jin

Iris has been found to be unique and consistent over time despite its random nature. Unprotected biometric (iris) template raises concerns in security and privacy, as numerous large-scale iris recognition projects have been deployed worldwide—for instance, susceptibility to attacks, cumbersome renewability, and cross-matching. Template protection schemes from biometric cryptosystems and cancelable biometrics are expected to restore the confidence in biometrics regarding data privacy, given the great advancement in recent years. However, a majority of the biometric template protection schemes have uncertainties in guaranteeing criteria such as unlinkability, irreversibility, and revocability, while maintaining significant performance. Fuzzy commitment, a theoretically secure biometric key binding scheme, is vulnerable due to the inherent dependency of the biometric features and its reliance on error correction code (ECC). In this paper, an alignment-free and cancelable iris key binding scheme without ECC is proposed. The proposed system protects the binary biometric data, i.e., IrisCodes, from security and privacy attacks through a strong and size varying non-invertible cancelable transform. The proposed scheme provides flexibility in system storage and authentication speed via controllable hashed code length. We also proposed a fast key regeneration without either re-enrollment or constant storage of seeds. The experimental results and security analysis show the validity of the proposed scheme.


2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Dongdong Zhao ◽  
Shu Fang ◽  
Jianwen Xiang ◽  
Jing Tian ◽  
Shengwu Xiong

Biometrics have been widely studied in recent years, and they are increasingly employed in real-world applications. Meanwhile, a number of potential threats to the privacy of biometric data arise. Iris template protection demands that the privacy of iris data should be protected when performing iris recognition. According to the international standard ISO/IEC 24745, iris template protection should satisfy the irreversibility, revocability, and unlinkability. However, existing works about iris template protection demonstrate that it is difficult to satisfy the three privacy requirements simultaneously while supporting effective iris recognition. In this paper, we propose an iris template protection method based on local ranking. Specifically, the iris data are first XORed (Exclusive OR operation) with an application-specific string; next, we divide the results into blocks and then partition the blocks into groups. The blocks in each group are ranked according to their decimal values, and original blocks are transformed to their rank values for storage. We also extend the basic method to support the shifting strategy and masking strategy, which are two important strategies for iris recognition. We demonstrate that the proposed method satisfies the irreversibility, revocability, and unlinkability. Experimental results on typical iris datasets (i.e., CASIA-IrisV3-Interval, CASIA-IrisV4-Lamp, UBIRIS-V1-S1, and MMU-V1) show that the proposed method could maintain the recognition performance while protecting the privacy of iris data.


2018 ◽  
Vol 1 (2) ◽  
pp. 34-44
Author(s):  
Faris E Mohammed ◽  
Dr. Eman M ALdaidamony ◽  
Prof. A. M Raid

Individual identification process is a very significant process that resides a large portion of day by day usages. Identification process is appropriate in work place, private zones, banks …etc. Individuals are rich subject having many characteristics that can be used for recognition purpose such as finger vein, iris, face …etc. Finger vein and iris key-points are considered as one of the most talented biometric authentication techniques for its security and convenience. SIFT is new and talented technique for pattern recognition. However, some shortages exist in many related techniques, such as difficulty of feature loss, feature key extraction, and noise point introduction. In this manuscript a new technique named SIFT-based iris and SIFT-based finger vein identification with normalization and enhancement is proposed for achieving better performance. In evaluation with other SIFT-based iris or SIFT-based finger vein recognition algorithms, the suggested technique can overcome the difficulties of tremendous key-point extraction and exclude the noise points without feature loss. Experimental results demonstrate that the normalization and improvement steps are critical for SIFT-based recognition for iris and finger vein , and the proposed technique can accomplish satisfactory recognition performance. Keywords: SIFT, Iris Recognition, Finger Vein identification and Biometric Systems.   © 2018 JASET, International Scholars and Researchers Association    


Sign in / Sign up

Export Citation Format

Share Document