A face template protection scheme based on chaotic map, error correction code and locality sensitive hashing

Abstract Face recognition has been widely used in many fields and has become an important identification method. The templates in face recognition systems are associated with the facial biometric features of users, and once leaked, it will pose a persistent threat to the users. Therefore, it is particularly important to protect the security of templates. In this work, a novel face template protection scheme is proposed by combining chaotic map, error correction code and locality sensitive hashing. The scheme utilizes two sets of parameters: global keys and user keys, and the generated data consists of two parts: storage key and biometric template. When generating a template, the extracted feature vector is permuted by using chaotic sequences to disrupt the correlation between different dimensions. Then, the user keys are processed by error correction code to generate the storage key, which can be used to recover the user keys during authentication. Finally, the permuted vector is processed by the proposed random number based locality sensitive hashing to generate biometric template. Experimental results and theoretical analysis show that the scheme has good accuracy and security, and can effectively resist various attacks on the face template.

Authors

Institutions

Publication Details

Journal
Cybersecurity
Published
2025-11-13
DOI
https://doi.org/10.1186/s42400-025-00373-6
Primary Topic
Biometric Identification and Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A face template protection scheme based on chaotic map, error correction code and locality sensitive hashing

Yong Wang, Jinyuan Liu, Zhuo Liu, Kun Wang
Cybersecurity
Biometric Identification and Security
article

A face template protection scheme based on chaotic map, error correction code and locality sensitive hashing

Yong Wang, Jinyuan Liu, Zhuo Liu, Kun Wang
article en

Abstract

Abstract Face recognition has been widely used in many fields and has become an important identification method. The templates in face recognition systems are associated with the facial biometric features of users, and once leaked, it will pose a persistent threat to the users. Therefore, it is particularly important to protect the security of templates. In this work, a novel face template protection scheme is proposed by combining chaotic map, error correction code and locality sensitive hashing. The scheme utilizes two sets of parameters: global keys and user keys, and the generated data consists of two parts: storage key and biometric template. When generating a template, the extracted feature vector is permuted by using chaotic sequences to disrupt the correlation between different dimensions. Then, the user keys are processed by error correction code to generate the storage key, which can be used to recover the user keys during authentication. Finally, the permuted vector is processed by the proposed random number based locality sensitive hashing to generate biometric template. Experimental results and theoretical analysis show that the scheme has good accuracy and security, and can effectively resist various attacks on the face template.

CybersecurityVol. 8(1)
Chongqing University of Posts and Telecommunications (CN), Chongqing University of Science and Technology (CN), Guizhou Education University (CN), People's Government of Shaanxi Province (CN)
National Natural Science Foundation of China, Natural Science Foundation of Chongqing, Chongqing Municipal Education Commission
Openalex Percentile: Top 57%
Biometric Identification and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.