Secure and non-interactive k-NN classifier using symmetric fully homomorphic encryption - Cnam - Conservatoire national des arts et métiers Access content directly
Conference Papers Year : 2022

Secure and non-interactive k-NN classifier using symmetric fully homomorphic encryption

Abstract

"Machine learning as a service" (MLaaS) in the cloud accelerates the adoption of machine learning techniques. Nevertheless, the externalization of data on the cloud raises a serious vulnerability issue because it requires disclosing private data to the cloud provider. This paper deals with this problem and brings a solution for the K-nearest neighbors (k-NN) algorithm with a homomorphic encryption scheme (called TFHE) by operating on end-to-end encrypted data while preserving privacy. The proposed solution addresses all stages of k-NN algorithm with fully encrypted data, including the majority vote for the class-label assignment. Unlike existing techniques, our solution does not require intermediate interactions between the server and the client when executing the classification task. Our algorithm has been assessed with quantitative variables and has demonstrated its efficiency on large and relevant real-world data sets while scaling well across different parameters on simulated data.
Fichier principal
Vignette du fichier
PSD_versions_auteure.pdf (506.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03933277 , version 1 (10-01-2023)

Identifiers

Cite

Yulliwas Ameur, Rezak Aziz, Vincent Audigier, Samia Bouzefrane. Secure and non-interactive k-NN classifier using symmetric fully homomorphic encryption. Privacy in statistical databases (PSD'2022), Sep 2022, Paris, France. pp.142-154, ⟨10.1007/978-3-031-13945-1_11⟩. ⟨hal-03933277⟩
181 View
88 Download

Altmetric

Share

Gmail Facebook X LinkedIn More