Pura: An Efficient Privacy-Preserving Solution for Face Recognition
Not on the map. Why?
Abstract (arXiv)
Face recognition is an effective technology for identifying a target person by facial images. However, sensitive facial images raises privacy concerns. Although privacy-preserving face recognition is one of potential solutions, this solution neither fully addresses the privacy concerns nor is efficient enough. To this end, we propose an efficient privacy-preserving solution for face recognition, named Pura, which sufficiently protects facial privacy and supports face recognition over encrypted data efficiently. Specifically, we propose a privacy-preserving and non-interactive architecture for face recognition through the threshold Paillier cryptosystem. Additionally, we carefully design a suite of underlying secure computing protocols to enable efficient operations of face recognition over encrypted data directly. Furthermore, we introduce a parallel computing mechanism to enhance the performance of the proposed secure computing protocols. Privacy analysis demonstrates that Pura fully safeguards personal facial privacy. Experimental evaluations demonstrate that Pura achieves recognition speeds up to 16 times faster than the state-of-the-art.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 53 references that are in the map. First posted on arXiv 21 May 2025.
Builds on
7 of 53 references.
References · 7
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
- 2014Learning Face Representation from Scratchcited by 453
- 2020Privacy Preserving Face Recognition Utilizing Differential Privacycited by 30
- 2014Face Recognition Methods & Applicationscited by 11
- 2022A Deep Dive into Dataset Imbalance and Bias in Face Identificationcited by 11
- 2013Secure k-Nearest Neighbor Query over Encrypted Data in Outsourced Environmentscited by 3
- 2023SOCI^+: An Enhanced Toolkit for Secure OutsourcedComputation on Integerscited by 1
Built on by
Not cited yet.