2017 IEEE Symposium on Computers and Communications (ISCC) 2017
DOI: 10.1109/iscc.2017.8024510
|View full text |Cite
|
Sign up to set email alerts
|

Implementing private k-means clustering using a LWE-based cryptosystem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…In order to solve this problem, Zhang et al [26] introduced contour coefficients into the privacy-preserving scheme of kmeans clustering. Theodouli et al [27] put forth an encryption system framework based on the Learning With error (LWE) problem to evaluate the k-means algorithm. Kim and Chang [28] constructed an efficient secure comparison protocol for privacy-preserving k-means clustering scheme.…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to solve this problem, Zhang et al [26] introduced contour coefficients into the privacy-preserving scheme of kmeans clustering. Theodouli et al [27] put forth an encryption system framework based on the Learning With error (LWE) problem to evaluate the k-means algorithm. Kim and Chang [28] constructed an efficient secure comparison protocol for privacy-preserving k-means clustering scheme.…”
Section: A Related Workmentioning
confidence: 99%
“…Overall, the primary technologies employed for designing privacy-preserving clustering schemes can be broadly categorized into two types: differential privacy ( [22], [25], [26], [35]- [38], [41]) and homomorphic encryption ( [21], [23], [24], [27]- [32], [34], [39], [40]). The introduction of differential privacy often impacts the accuracy of the model because it protects individual data privacy by introducing random noise, potentially affecting the computation and reducing result accuracy.…”
Section: A Related Workmentioning
confidence: 99%
“…The authors [42] demonstrate a solution to perform k-means using a collaboration between the client and a server. They used the BV scheme [43].…”
Section: Individual Clusteringmentioning
confidence: 99%
“…Based on an LWE-based homomorphic cryptosystem, Theodouli et al [218] introduced a privacy-preserving k-means clustering framework, and also described three user-server interactive algorithms for computing new clusters. Receiving the encrypted distances (between data records and current clusters), the client decrypts the distances and compares the distances to obtain the individual minimum for each data record.…”
Section: ) Clustering and Association Rule Miningmentioning
confidence: 99%
“…The three algorithms achieve different tradeoffs between the security and the consumed resources of the client and the server. In practical applications, the above schemes [216]- [218] still require nonnegligible computation burdens for the users, whether for computing the trapdoor information or decrypting all distance values. To reduce the participation amount of the users, Almutairi et al [219] proposed a homomorphic k-means solution by employing a structure called updatable distance matrix (UDM) for storing the information of data records.…”
Section: ) Clustering and Association Rule Miningmentioning
confidence: 99%