Cancelable Binary Face Templates Generation Based on Partial Cake-Cutting Transformation and Spherical Hashing

With the rapid development of Internet of Things (IoT), biometric-based authentication systems have been widely used for access control. The wide application of biometric recognition systems has brought convenience but also raised privacy and security concerns. When unprotected templates are stolen, it will permanently leak the original biometric data. Therefore, it is important to ensure the security of biometric templates while meeting the real-time device requirements. Motivated by these issues, in this paper, we proposed a scheme based on partial Cake-cutting transformation and spherical hashing to generate cancelable binary face templates. Firstly, with external random parameters, partial Cake-cutting transformation is established to introduce randomness and preserve the relative distance similarity of face features. Then spherical hashing is utilized to encode the face features into protected binary codes. The protected template has the advantages of high entropy value, low storage consumption, and fast generation speed. Extensive experiments conducted on LFW, CFPW, and CASIA-FaceV5 databases along with theoretical analyses indicate that the proposed scheme shows good matching accuracy and strong resistance to various attacks. Besides, the protected templates can achieve equal or even better accuracy than the unprotected counterparts. Furthermore, the proposed scheme also satisfies the requirements of cancelable biometrics, i.e., irreversibility, revocability, and unlinkability.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-05-19
DOI
https://doi.org/10.1109/jiot.2025.3571052
Citations
2
Primary Topic
Face recognition and analysis
Type
article
Field-Weighted Citation Impact
2.55
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cancelable Binary Face Templates Generation Based on Partial Cake-Cutting Transformation and Spherical Hashing

Zhicheng Cao, Liaojun Pang, Heng Zhao, Yuxing Li et al.
2 citations
IEEE Internet of Things Journal
Face recognition and analysis
2.55
article

Cancelable Binary Face Templates Generation Based on Partial Cake-Cutting Transformation and Spherical Hashing

Zhicheng Cao, Liaojun Pang, Heng Zhao, Yuxing Li, Qingchen Zhang, Qikang Zhang, Zifeng Huang
article en
2 citations

Abstract

With the rapid development of Internet of Things (IoT), biometric-based authentication systems have been widely used for access control. The wide application of biometric recognition systems has brought convenience but also raised privacy and security concerns. When unprotected templates are stolen, it will permanently leak the original biometric data. Therefore, it is important to ensure the security of biometric templates while meeting the real-time device requirements. Motivated by these issues, in this paper, we proposed a scheme based on partial Cake-cutting transformation and spherical hashing to generate cancelable binary face templates. Firstly, with external random parameters, partial Cake-cutting transformation is established to introduce randomness and preserve the relative distance similarity of face features. Then spherical hashing is utilized to encode the face features into protected binary codes. The protected template has the advantages of high entropy value, low storage consumption, and fast generation speed. Extensive experiments conducted on LFW, CFPW, and CASIA-FaceV5 databases along with theoretical analyses indicate that the proposed scheme shows good matching accuracy and strong resistance to various attacks. Besides, the protected templates can achieve equal or even better accuracy than the unprotected counterparts. Furthermore, the proposed scheme also satisfies the requirements of cancelable biometrics, i.e., irreversibility, revocability, and unlinkability.

IEEE Internet of Things JournalVol. 12(15)
Xidian University (CN), Hainan University (CN)
Zero hunger
Openalex Percentile: Top 11%
Face recognition and analysis
2.55
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.