Loading…

Support vector machine classification over encrypted data

Support vector machine is one of the most extensively used machine learning algorithms. A typical application scenario of support vector machine classification is the client-server model where a client holding an image requests a server holding a support vector machine model to provide image classif...

Full description

Saved in:
Bibliographic Details
Published in:Applied intelligence (Dordrecht, Netherlands) Netherlands), 2022-04, Vol.52 (6), p.5938-5948
Main Authors: Huang, Hai, Wang, Yongjian, Zong, Haoran
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Support vector machine is one of the most extensively used machine learning algorithms. A typical application scenario of support vector machine classification is the client-server model where a client holding an image requests a server holding a support vector machine model to provide image classification services. However, applying support vector machine in the client-server model requires careful attention to maintain data privacy. In this paper, we will propose a privacy-preserving support vector machine classification scheme based on fully homomorphic encryption. Our scheme guarantees that the server cannot learn the user’s image while providing classification service and the client eventually obtains the classification result without learning about the support vector machine model. We introduce several novel techniques to optimize our proposal. Specifically, we use the single instruction multiple data techniques to accelerate the linear component and the approximate method to compute the non-linear component. Our scheme significantly improves computational and communication performance compared to the state-of-the-art work. Experimental results show that our scheme takes only seconds to classify an encrypted image while the state-of-the-art work takes several hundred seconds.
ISSN:0924-669X
1573-7497
DOI:10.1007/s10489-021-02727-2