Javascript must be enabled to continue!
Secure KNN Classification Scheme Based on Homomorphic Encryption for Cyberspace
View through CrossRef
With the advent of the intelligent era, more and more artificial intelligence algorithms are widely used and a large number of user data are collected in the cloud server for sharing and analysis, but the security risks of private data breaches are also increasing in the meantime. CKKS homomorphic encryption has become a research focal point in the cryptography field because of its ability of homomorphic encryption for floating-point numbers and comparable computational efficiency. Based on the CKKS homomorphic encryption, this paper implements a secure KNN classification scheme in cloud servers for Cyberspace (CKKSKNNC) and supports batch calculation. This paper uses the CKKS homomorphic encryption scheme to encrypt user data samples and then uses Euclidean distance, Pearson similarity, and cosine similarity to compute the similarity between ciphertext data samples. Finally, the security classification of the samples is realized by voting rules. This paper selects IRIS data set for experimental, which is the classification data set commonly used in machine learning. The experimental results show that the accuracy of the other three similarity algorithms of the IRIS data is around 97% except for the Pearson correlation coefficient, which is almost the same as that in plaintext, which proves the effectiveness of this scheme. Through comparative experiments, the efficiency of this scheme is proved.
Title: Secure KNN Classification Scheme Based on Homomorphic Encryption for Cyberspace
Description:
With the advent of the intelligent era, more and more artificial intelligence algorithms are widely used and a large number of user data are collected in the cloud server for sharing and analysis, but the security risks of private data breaches are also increasing in the meantime.
CKKS homomorphic encryption has become a research focal point in the cryptography field because of its ability of homomorphic encryption for floating-point numbers and comparable computational efficiency.
Based on the CKKS homomorphic encryption, this paper implements a secure KNN classification scheme in cloud servers for Cyberspace (CKKSKNNC) and supports batch calculation.
This paper uses the CKKS homomorphic encryption scheme to encrypt user data samples and then uses Euclidean distance, Pearson similarity, and cosine similarity to compute the similarity between ciphertext data samples.
Finally, the security classification of the samples is realized by voting rules.
This paper selects IRIS data set for experimental, which is the classification data set commonly used in machine learning.
The experimental results show that the accuracy of the other three similarity algorithms of the IRIS data is around 97% except for the Pearson correlation coefficient, which is almost the same as that in plaintext, which proves the effectiveness of this scheme.
Through comparative experiments, the efficiency of this scheme is proved.
Related Results
Development Paillier's library of fully homomorphic encryption
Development Paillier's library of fully homomorphic encryption
One of the new areas of cryptography considered-homomorphic cryptography. The article presents the main areas of application of homomorphic encryption. An analysis of existing deve...
Towards Secure Big Data Analysis via Fully Homomorphic Encryption Algorithms
Towards Secure Big Data Analysis via Fully Homomorphic Encryption Algorithms
Privacy-preserving techniques allow private information to be used without compromising privacy. Most encryption algorithms, such as the Advanced Encryption Standard (AES) algorith...
Power of Homomorphic Encryption in Secure Data Processing
Power of Homomorphic Encryption in Secure Data Processing
Homomorphic encryption is a form of encryption that allows computations to be performed on encrypted data without first having to decrypt it. This paper presents a detailed discuss...
Achievable CCA2 Relaxation for Homomorphic Encryption
Achievable CCA2 Relaxation for Homomorphic Encryption
Abstract
Homomorphic encryption () protects data in-use, but can be computationally expensive. To avoid the costly bootstrapping procedure that refreshes ciphertexts, som...
OPTIMIZED CLOUD SECURITY ECC-ENHANCED HOMOMORPHIC PAILLIER RE-ENCRYPTION
OPTIMIZED CLOUD SECURITY ECC-ENHANCED HOMOMORPHIC PAILLIER RE-ENCRYPTION
In the dynamic domain of cloud computing, ensuring data security is of utmost importance. Conventional encryption techniques, while providing a high level of ...
Homomorphic Encryption and its Application to Blockchain
Homomorphic Encryption and its Application to Blockchain
The concept, method, algorithm and application of the advanced field of cryptography, homomorphic encryption, as well as its application to the field of blockchain are discussed in...
BHE+ALBERT-Mixplus: A Distributed Symmetric Approximate Homomorphic Encryption Model for Secure Short-Text Sentiment Classification in Teaching Evaluations
BHE+ALBERT-Mixplus: A Distributed Symmetric Approximate Homomorphic Encryption Model for Secure Short-Text Sentiment Classification in Teaching Evaluations
This study addresses the sentiment classification of short texts in teaching evaluations. To mitigate concerns regarding data security in cloud-based sentiment analysis and to over...
Optimising tool wear and workpiece condition monitoring via cyber-physical systems for smart manufacturing
Optimising tool wear and workpiece condition monitoring via cyber-physical systems for smart manufacturing
Smart manufacturing has been developed since the introduction of Industry 4.0. It consists of resource sharing and networking, predictive engineering, and material and data analyti...

