
Research Article
SAFE: A Fast Privacy-Preserving Scheme for Multi-client Face Verification
@INPROCEEDINGS{10.1007/978-3-032-23453-7_26, author={Guotao Xu and Bowen Zhao and Yantao Zhong and Zhaoting Ma and Cheng Qiao and Qingqi Pei}, title={SAFE: A Fast Privacy-Preserving Scheme for Multi-client Face Verification}, proceedings={Security and Privacy in Communication Networks. 21st EAI International Conference, SecureComm 2025, Xiangtan, China, July 4--6, 2025, Proceedings, Part III}, proceedings_a={SECURECOMM}, year={2026}, month={11}, keywords={Face verification Threshold Paillier cryptosystem Secure computing Privacy protection}, doi={10.1007/978-3-032-23453-7_26} }- Guotao Xu
Bowen Zhao
Yantao Zhong
Zhaoting Ma
Cheng Qiao
Qingqi Pei
Year: 2026
SAFE: A Fast Privacy-Preserving Scheme for Multi-client Face Verification
SECURECOMM
Springer
DOI: 10.1007/978-3-032-23453-7_26
Abstract
Face verification is a powerful technology that confirms an individual’s identity by analyzing facial images. Unfortunately, privacy concerns regarding sensitive facial data arise with the widespread application of face verification. Existing solutions with privacy protection still confront several issues, including system framework, effective computation, and computational efficiency. In this work, we present a fast privacy-preserving solution for multi-client face verification through the threshold Paillier cryptosystem. Specifically, we propose a general framework that supports non-interactive and privacy-preserving face verification for multiple clients. Additionally, we design two secure computing protocols to enable effective privacy-preserving face verification over encrypted data. We also introduce a parallel computing mechanism based on a twin-server architecture, which significantly enhances the efficiency of SAFE. Rigorous privacy analyses indicate that SAFE does not leak any facial data. Extensive experiments demonstrate that SAFE is up to 9 times faster than the state-of-the-art.

