Abstract book (pdf) - ICPR 2010

09:40-10:00, Paper TuAT7.3
Tokenless Cancelable Biometrics Scheme for Protecting IrisCodes
Ouda, Osama, Chiba Univ.
Tsumura, Norimichi, Chiba Univ.
Nakaguchi, Toshiya, Chiba Univ.
In order to satisfy the requirements of the cancelable biometrics construct, cancelable biometrics techniques rely on other
authentication factors such as password keys and/or user specific tokens in the transformation process. However, such
multi-factor authentication techniques suffer from the same issues associated with traditional knowledge-based and tokenbased
authentication systems. This paper presents a new one-factor cancelable biometrics scheme for protecting Iris Codes.
The proposed method is based solely on Iris Codes; however, it satisfies the requirements of revocability, diversity and
noninvertibility without deteriorating the recognition performance. Moreover, the transformation process is easy to implement
and can be integrated simply with current iris matching systems. The impact of the proposed transformation
process on the the recognition accuracy is discussed and its noninvertibility is analyzed. The effectiveness of the proposed
method is confirmed experimentally using CASIA-IrisV3-Interval dataset.
10:00-10:20, Paper TuAT7.4
A Novel Fingerprint Template Protection Scheme based on Distance Projection Coding
Wang, Ruifang, Chinese Acad. of Sciences
Yang, Xin, Chinese Acad. of Sciences
Liu, Xia, Harbin University of Science and Technology
Zhou, Sujing, Chinese Acad. of Sciences
Li, Peng, Chinese Acad. of Sciences
Cao, Kai, Chinese Acad. of Sciences
Tian, Jie, Chinese Acad. of Sciences
The biometric template, which is stored in the form of raw data, has become the greatest potential threat to the security of
biometric authentication system. As the compromise of the biometric data is permanent, the protection of biometric data
is particularly important. Consequently, biometric template protection technologies have aroused research highlights recently.
One of the most popular template protection methods is biometric cryptosystem method. In this paper, we design
a codebook named distance projection for biometric coding to generate secured biometric template, and propose a novel
fingerprint biometric cryptosystem scheme based on the codebook. Experimental results on FVC2002 DB2 show that the
proposed scheme can obtain positive results on both security and authentication accuracy.
10:20-10:40, Paper TuAT7.5
Combination of Symmetric Hash Functions for Secure Fingerprint Matching
Kumar, Gaurav, State Univ. of New York at Buffalo
Tulyakov, Sergey, Univ. at Buffalo
Govindaraju, Venu, Univ. at Buffalo
Fingerprint based secure biometric authentication systems have received considerable research attention lately, where the
major goal is to provide an anonymous, multipliable and easily revocable methodology for fingerprint verification. In our
previous work, we have shown that symmetric hash functions are very effective in providing such secure fingerprint representation
and matching since they are independent of order of minutiae triplets as well as location of singular points
(e.g. core and delta). In this paper, we extend our prior work by generating a combination of symmetric hash functions,
which increases the security of fingerprint matching by an exponential factor. Firstly, we extract kplets from each fingerprint
image and generate a unique key for combining multiple hash functions up to an order of (k-1). Each of these keys is generated
using the features extracted from minutiae k-plets such as bin index of smallest angles in each k-plet. This combination
provides us an extra security in the face of brute force attacks, where the compromise of few hash functions as well
do not compromise the overall matching. Our experimental results suggest that the EER obtained using the combination
of hash functions (4.98%) is comparable with the baseline system (3.0%), with the added advantage of being more secure.
- 80 -