کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4969894 | 1449983 | 2017 | 13 صفحه PDF | دانلود رایگان |
- A new scheme to generate cancellable iris template with Jacaard similarity matcher.
- Modification of Min-hashing to strengthen the privacy security in IFO.
- IFO provides strong security and privacy against SHA, MHA, ARM, PIA attacks.
- IFO can be applied to variety of biometric feature with binary representation.
Eye iris has been widely recognized as one of the strongest biometrics attributed to its high accuracy performance. However, templates in conventional iris recognition systems are unprotected and highly vulnerable to numerous security and privacy attacks. Despite a number of cancellable biometric schemes have been proposed but at the expense of substantially decreased accuracy performance. In this paper, we introduce a new cancellable iris scheme, coined as “Indexing-First-One” (IFO) hashing. IFO hashing is inspired from the Min-hashing that primarily used in text retrieval domain. However, IFO hashing has been further strengthened by two novel mechanisms, namely P-order Hadamard product and modulo threshold function. The IFO hashing scheme strikes the balance between accuracy performance and privacy/security protection. Comprehensive experiments on CASIA-v3 iris benchmark database and rigorous analysis demonstrate decent accuracy performance with respect to its original counterparts yet offer strong resilience against several major security and privacy attacks.
Journal: Pattern Recognition - Volume 64, April 2017, Pages 105-117