DocumentCode :
54142
Title :
Fully Private Noninteractive Face Verification
Author :
Troncoso-Pastoriza, J.R. ; Gonzalez-Jimenez, D. ; Perez-Gonzalez, F.
Author_Institution :
Signal Theor. & Commun. Dept., Univ. of Vigo, Vigo, Spain
Volume :
8
Issue :
7
fYear :
2013
fDate :
Jul-13
Firstpage :
1101
Lastpage :
1114
Abstract :
Face recognition is one of the foremost applications in computer vision, which often involves sensitive signals; privacy concerns have been raised lately and tackled by several recent privacy-preserving face recognition approaches. Those systems either take advantage of information derived from the database templates or require several interaction rounds between client and server, so they cannot address outsourced scenarios. We present a private face verification system that can be executed in the server without interaction, working with encrypted feature vectors for both the templates and the probe face. We achieve this by combining two significant contributions: 1) a novel feature model for Gabor coefficients´ magnitude driving a Lloyd-Max quantizer, used for reducing plaintext cardinality with no impact on performance; 2) an extension of a quasi-fully homomorphic encryption able to compute, without interaction, the soft scores of an SVM operating on quantized and encrypted parameters, features and templates. We evaluate the private verification system in terms of time and communication complexity, and in verification accuracy in widely known face databases (XM2VTS, FERET, and LFW). These contributions open the door to completely private and noninteractive outsourcing of face verification.
Keywords :
client-server systems; computational complexity; computer vision; cryptography; data privacy; face recognition; feature extraction; support vector machines; FERET; Gabor coefficient magnitude; LFW; Lloyd-Max quantizer; SVM; XM2VTS; client-server interaction; communication complexity; computer vision; database template; encrypted feature vector; encrypted parameter; face database; feature model; fully private noninteractive face verification; plaintext cardinality reduction; privacy concerns; privacy-preserving face recognition approach; private face verification system; probe face; quantized parameter; quasifully homomorphic encryption; sensitive signals; time complexity; verification accuracy; Databases; Encryption; Face; Feature extraction; Privacy; Servers; Biometrics; Gabor coefficients; Gabor magnitude; complexity; face verification; full homomorphic encryption; generalized Gaussian; privacy; quantization; statistical model;
fLanguage :
English
Journal_Title :
Information Forensics and Security, IEEE Transactions on
Publisher :
ieee
ISSN :
1556-6013
Type :
jour
DOI :
10.1109/TIFS.2013.2262273
Filename :
6514926
Link To Document :
بازگشت