Training Support Vector Machines with privacy-protected data. (December 2017)

• Record Type: Journal Article
• Authors: González-Serrano, Francisco-Javier; Navia-Vázquez, Ángel; Amor-Martín, Adrián
• Is Part Of: Pattern recognition. Volume 72(2017:Dec.)
• Page Start: 93
• Page End: 107
• Publication Date: 2017-12
• Subjects: Machine learning -- Privacy protection -- Homomorphic encryption -- Support Vector Machines; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2017.06.016
• Languages: English
• ISSNs: 0031-3203

Abstract

Highlights: Multiple-key encrypted machine learning scenario. Standard authorization protocol (OAuth 2.0) to get access to encrypted data. A minimal set of outsourced operations to optimize the encryption/decryption hardware (CryptoProcessor). Semiparametric SVM scheme that avoids the use of private instances as part of the model. Analysis of the SVMs performance under the nite-precission conditions required by cryptosystems. Abstract: In this paper, we address a machine learning task using encrypted training data. Our basic scenario has three parties: Data Owners, who own private data; an Application, which wants to train and use an arbitrary machine learning model on the Users' data; and an Authorization Server, which provides Data Owners with public and secret keys of a partial homomorphic cryptosystem (that protects the privacy of their data), authorizes the Application to get access to the encrypted data, and assists it in those computations not supported by the partial homomorphism. As machine learning model, we have selected the Support Vector Machine (SVM) due to its excellent performance in supervised classification tasks. We evaluate two well known SVM algorithms, and we also propose a new semiparametric SVM scheme better suited for the privacy-protected scenario. At the end of the paper, a performance analysis regarding the accuracy and the complexity of the developed algorithms and protocols is presented.