Efficient privacy-preserving outsourced k-means clustering on distributed data
From MaRDI portal
Publication:6554885
Recommendations
- Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load
- Secure collaborative outsourced \(k\)-nearest neighbor classification with multiple owners in cloud environment
- Privacy Preserving Unsupervised Clustering over Vertically Partitioned Data
- Towards a practical cluster analysis over encrypted data
- Oblivious sampling with applications to two-party k-means clustering
Cites work
- scientific article; zbMATH DE number 1583777 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- A modular approach to key safeguarding
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An Efficient Public Key Cryptosystem with a Privacy Enhanced Double Decryption Mechanism
- Chinese remaindering with errors
- Efficient and Secure Comparison for On-Line Auctions
- Efficient unconditionally secure comparison and privacy preserving machine learning classification protocols
- Encrypted integer division and secure comparison
- Foundations of Cryptography
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- One-round secure comparison of integers
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Theory of Cryptography
This page was built for publication: Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554885)
