Oblivious sampling with applications to two-party k-means clustering
DOI10.1007/S00145-020-09349-WzbMATH Open1457.94104OpenAlexW3025904053MaRDI QIDQ2188971FDOQ2188971
Authors: Paul Bunn, Rafail Ostrovsky 
Publication date: 15 June 2020
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-020-09349-w
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Distributed systems (68M14) Sampling theory in information and communication theory (94A20) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)
Cites Work
- The effectiveness of Lloyd-type methods for the \(k\)-means problem
- Theory of Cryptography
- Security and composition of multiparty cryptographic protocols
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- Oblivious Polynomial Evaluation
- Optimal Size Integer Division Circuits
- Advances in Cryptology – CRYPTO 2004
- Encrypted integer division and secure comparison
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
- Theory of Cryptography
- Oblivious Scalar-Product Protocols
Cited In (6)
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
- Unsupervised Machine Learning on encrypted data
- Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load
- Secure sampling with sublinear communication
- Towards a practical cluster analysis over encrypted data
- Accelerating the secure distributed computation of the mean by a Chebyshev expansion
Uses Software
This page was built for publication: Oblivious sampling with applications to two-party \(k\)-means clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188971)
