Efficient Cancelable Iris Template Generation for Wearable Sensors

Abstract

When biometric authentication is performed on On-Body Wearable Wireless Networks, a cancelable template is useful to protect biometric information. A cancelable template generation method converts the original biometric information into irreversibly transformed information to protect the original biometric information. If a cancelable template is damaged or leaked, it can be replaced with another cancelable template. In 2017, Dwivedi et al. proposed a novel cancelable iris template generation scheme based on the randomized look-up table mapping. So far their scheme is the most accurate scheme with respect to EER compared to the previous cancelable iris template generation schemes. However, their scheme is not alignment-free and so is not efficient enough for wearable sensors. In the paper, we first suggest how to improve the accuracy of the Dwivedi et al.’s scheme using the partial sort technique. Our experiment result shows that our suggested scheme is more accurate than the Dwivedi et al.’s scheme under almost all parameter settings. More concretely, our scheme achieves EER 0.09%, whereas the Dwivedi et al.’s scheme achieves EER 0.43% in the best parameter settings for the CASIA-V3-Interval iris database. We also suggest how to improve the efficiency of the Dwivedi et al.’s scheme. Our second scheme is alignment-free by processing IrisCode column-wise, whereas the Dwivedi et al.’s scheme handles IrisCode row-wise. Our experiment shows that our second scheme is 15 times faster than the Dwivedi et al.’s scheme, so our scheme is efficient enough for wearable sensors. Though our second scheme has very high EER under some parameter settings, our second scheme achieves EER 0.53% in the best parameter settings for the CASIA-V3-Interval iris database.

A Review on Protection and Cancelable Techniques in Biometric Systems

“…Finally, the operating principle of Bloom filters has been transferred to protection techniques based on consistent bit extraction and decimal encoding to perform randomized look-up table mapping. An example of this protection scheme is developed by [151] for an iris-based authentication system.…”

Biometric iris templates security based on secret image sharing and chaotic maps

“…Lastly, a hyper-chaotic map is employed to generate a key stream to cipher a watermarked image by block cipher method. Jae and Ik [20] introduced two cancellable schemes for template generation. The first scheme is to enhance the accuracy of the Dwivedi et al method by the partial sort technique, and the second scheme is alignment-free which enhances the effectiveness of the Dwivedi et al method.…”

A standard ranking algorithm for robust iris template protection

“…In another indexing method explored in valuable research [16], a row-wise scheme with decimal encoding-based look-up table (LUT) mapping is suggested to transform the iris code into an irreversible representation. However, the authors of [16] acknowledge the possibility of reversing the iris templates if an attacker gains access to the LUT table . Moving on to a study recommended in [17], which proposes partial sort and alignment-free techniques based on column-wise and LUT mapping for coding the extracted iris simultaneously, the suggested method [17] does not achieve accuracy and efficiency while meeting the security requirements at the same time. Furthermore, the research in [18] introduces a confidence matrix to enhance performance in iris datasets with noise masks, utilizing the index first one (IFO) approach.…”