ForTPDS_2015.pdf (417.92 kB)
Download fileEfficient privacy-preserving facial expression classification
journal contribution
posted on 2017-02-02, 10:18 authored by Yogachandran RahulamathavanYogachandran Rahulamathavan, Muttukrishnan RajarajanThis paper proposes an efficient algorithm to perform privacy-preserving (PP) facial expression classification (FEC) in the client-server model. The server holds a database and offers the classification service to the clients. The client uses the service to classify the facial expression (FaE) of subject. It should be noted that the client and server are mutually untrusted parties and they want to perform the classification without revealing their inputs to each other. In contrast to the existing works, which rely on computationally expensive cryptographic operations, this paper proposes a lightweight algorithm based on the randomization technique. The proposed algorithm is validated using the widely used JAFFE and MUG FaE databases. Experimental results demonstrate that the proposed algorithm does not degrade the performance compared to existing works. However, it preserves the privacy of inputs while improving the computational complexity by 120 times and communication complexity by 31 percent against the existing homomorphic cryptography based approach.
History
School
- Loughborough University London
Published in
IEEE Transactions on Dependable and Secure ComputingVolume
14Issue
3Pages
326 - 338Citation
RAHULAMATHAVAN, Y. and RAJARAJAN, M., 2017. Efficient privacy-preserving facial expression classification. IEEE Transactions on Dependable and Secure Computing, 14 (3), pp.326-338.Publisher
© IEEEVersion
- AM (Accepted Manuscript)
Publication date
2015-07-08Notes
© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.ISSN
1545-5971eISSN
1941-0018Publisher version
Language
- en