Dual Hashing Index Cancellable Finger Vein Template Based on Gaussian Random Mapping

In the existing cancellable finger vein template protection schemes, the original biometric features cannot be well protected, which results in poor security. In addition, the performance of matching recognition performances after generating a cancellable template is poor. Therefore, a dual hashing index cancellable finger vein template protection based on Gaussian random mapping is proposed in this study. The scheme is divided into an enrollment stage and a verification stage. In the two stages, symmetric data encryption technology was used to generate encryption templates for matching. In the enrollment stage, first, the extracted finger vein features were duplicated to obtain an extended feature vector; then, this extended vector was uniformly and randomly permuted to obtain a permutation feature vector. The above two vectors were combined into a two-dimensional feature matrix. The extended and permuted feature vector made full use of the original biometric features and further enhanced the non-invertibility. Second, a random Gaussian projection vector with m x q dimensions was generated, and a random orthogonal projection matrix was generated by the Schmidt orthogonalization of the previously generated random vector. This approach accurately transferred the characteristics of the biometric features to another feature space and ensured that the biological template is revocable. Finally, the inner product of the two-dimensional feature vector and random orthogonal projection matrix was obtained and superimposed into a row. The dual index values of the largest and second largest values were repeated m times to obtain a hash code for matching. The secondary maximum value index was introduced to adjust the error generated by the random matrix, which improved the recognition rate of the algorithm. In the verification stage, another hash code for matching was generated based on symmetric data encryption technology, and then the two hash codes were cross matched to obtain the final matching result. The experimental results show that this scheme attains good recognition performance with the PolyU and SDUMLA-FV databases, that it meets the design standard for cancellable biometric identification, and that it is robust to security and privacy attacks.