An Efficient and Privacy-Preserving Biometric Identification Scheme Based on the FITing-Tree

Abstract

Biometric identification services have been applied to almost all aspects of life. However, how to securely and efficiently identify an individual in a huge biometric dataset is still very challenging. For one thing, biometric data is very sensitive and should be kept secure during the process of biometric identification. On the other hand, searching a biometric template in a large dataset can be very time-consuming, especially when some privacy-preserving measures are adopted. To address this problem, we propose an efficient and privacy-preserving biometric identification scheme based on the FITing-tree, iDistance, and a symmetric homomorphic encryption (SHE) scheme with two cloud servers. With our proposed scheme, the privacy of the user’s identification request and service provider’s dataset is guaranteed, while the computational costs of the cloud servers in searching the biometric dataset can be kept at an acceptable level. Detailed security analysis shows that the privacy of both the biometric dataset and biometric identification request is well protected during the identification service. In addition, we implement our proposed scheme and compare it to a previously reported M-Tree based privacy-preserving identification scheme in terms of computational and communication costs. Experimental results demonstrate that our proposed scheme is indeed efficient in terms of computational and communication costs while identifying a biometric template in a large dataset.

A Review on Protection and Cancelable Techniques in Biometric Systems

“…In addition, the cancelation and renewal capacity depends on the RNG's power and the algorithm's complexity to generate the encryption keys within the set of allowed elements. Some authentication systems with protection based on homomorphic encryption that calculates the squared Euclidean distance in the encrypted domain were proposed for biometric traits such as fingerprint [102], iris [103], and face [104], [105]. In addition, [106] proposed an authentication system for speaker recognition that implemented cosine similarity in the encrypted domain.…”