scholarly journals Iris Template Protection Based on Local Ranking

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Dongdong Zhao ◽  
Shu Fang ◽  
Jianwen Xiang ◽  
Jing Tian ◽  
Shengwu Xiong
Keyword(s):  
Iris Recognition ◽  
Recognition Performance ◽  
Biometric Data ◽  
Protection Method ◽  
Shifting Strategy ◽  
Real World Applications ◽  
Template Protection ◽  
Exclusive Or ◽  
Application Specific ◽  
Iris Data

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.

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 A New Design for Alignment-Free Chaffed Cancelable Iris Key Binding Scheme

Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 164
Author(s):  
Tong-Yuen Chai ◽  
Bok-Min Goi ◽  
Yong-Haur Tay ◽  
and Zhe Jin
Keyword(s):  
Data Privacy ◽  
Iris Recognition ◽  
Large Scale ◽  
Security Analysis ◽  
Security And Privacy ◽  
Biometric Data ◽  
Alignment Free ◽  
Biometric Template ◽  
Significant Performance ◽  
Template Protection

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.

A Method of Iris Recognition Based on Local Gray Minimum Values

2012 ◽  
Vol 198-199 ◽  
pp. 310-313
Author(s):  
Jing Lei Kang ◽  
Ye Cai Guo
Keyword(s):  
Computer Simulations ◽  
Iris Recognition ◽  
Feature Matching ◽  
Recognition Performance ◽  
Recognition Algorithm ◽  
Iris Image ◽  
Xor Operation ◽  
Characteristic Points ◽  
Exclusive Or ◽  
Minimum Points

Feature matching is a most important step of the iris recognition algorithm, directly determining the success or failure of iris recognition. In order to have a better performance in the iris recognition, a method of iris recognition based on local gray minimum values is proposed. This method firstly records the position of local gray minimum points in the iris region; the minimum consolidation method is used to compress the characteristic points, and then encoding the compression iris image after extracting features. Finally, do exclusive OR (XOR) operation between encoding and template information to get the final recognition results. The computer simulations show the proposed method has very good recognition performance.

IRIS AND FINGER VEIN MULTI MODEL RECOGNITION SYSTEM BASED ON SIFT FEATURES

2018 ◽  
Vol 1 (2) ◽  
pp. 34-44
Author(s):  
Faris E Mohammed ◽  
Dr. Eman M ALdaidamony ◽  
Prof. A. M Raid
Keyword(s):  
Iris Recognition ◽  
Recognition Performance ◽  
Recognition System ◽  
Individual Identification ◽  
Work Place ◽  
Identification Process ◽  
Finger Vein ◽  
Noise Point ◽  
Vein Recognition ◽  
A New Technique

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    

Cancellable Biometrics for On-line Signature Recognition

2011 ◽  
pp. 290-315 ◽  
Author(s):  
Emanuele Maiorana ◽  
Patrizio Campisi ◽  
Alessandro Neri
Keyword(s):  
Recognition System ◽  
Design Of Algorithms ◽  
Biometric Data ◽  
The Public ◽  
Protection Scheme ◽  
Protection Method ◽  
Signature Database ◽  
On Line ◽  
Signature Recognition ◽  
Recognition Systems

With the widespread diffusion of biometrics-based recognition systems, there is an increasing awareness of the risks associated with the use of biometric data. Significant efforts are therefore being dedicated to the design of algorithms and architectures able to secure the biometric characteristics, and to guarantee the necessary privacy to their owners. In this work we discuss a protected on-line signature-based biometric recognition system, where the considered biometrics are secured by applying a set of non-invertible transformations, thus generating modified templates from which retrieving the original information is computationally as hard as random guessing it. The advantages of using a protection method based on non-invertible transforms are exploited by presenting three different strategies for the matching of the transformed templates, and by proposing a multi-biometrics approach based on score-level fusion to improve the performances of the considered system. The reported experimental results, evaluated on the public MCYT signature database, show that the achievable recognition rates are only slightly affected by the proposed protection scheme, which is able to guarantee the desired security and renewability for the considered biometrics.

Overview

2011 ◽  
pp. 1-23
Author(s):  
David Zhang ◽  
Fengxi Song ◽  
Yong Xu ◽  
Zhizhen Liang
Keyword(s):  
Pattern Recognition ◽  
Recognition Performance ◽  
Recognition System ◽  
Biometric System ◽  
Biometric Recognition ◽  
Biometric Data ◽  
Pattern Recognition System ◽  
Biometric Systems ◽  
History Of

A biometric system can be regarded as a pattern recognition system. In this chapter, we discuss two advanced pattern recognition technologies for biometric recognition, biometric data discrimination and multi-biometrics, to enhance the recognition performance of biometric systems. In Section 1.1, we discuss the necessity, importance, and applications of biometric recognition technology. A brief introduction of main biometric recognition technologies are presented in Section 1.2. In Section 1.3, we describe two advanced biometric recognition technologies, biometric data discrimination and multi-biometric technologies. Section 1.4 outlines the history of related work and highlights the content of each chapter of this book.

An effective template protection method for face and voice cancellable identification

2014 ◽  
Vol 11 (3) ◽  
pp. 157-166 ◽  
Author(s):  
Anne M.P. Canuto ◽  
Fernando Pintro ◽  
Michael C. Fairhurst
Keyword(s):  
Protection Method ◽  
Template Protection
Sign in / Sign up

Export Citation Format

Share Document