Oblivious sampling with applications to two-party k-means clustering

DOI10.1007/S00145-020-09349-WMaRDI QIDQ2188971zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(k\)-means clusteringsecure multiparty computation

Mathematics Subject Classification ID

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)

Recommendations

• Towards a practical cluster analysis over encrypted data
• Secure sampling with sublinear communication
• Theory of Cryptography
• Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
• On distributed \(k\)-anonymization

Cites work

• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 1942435 (Why is no real title available?)
• scientific article; zbMATH DE number 1759770 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
• Encrypted integer division and secure comparison
• Foundations of Cryptography
• Oblivious Polynomial Evaluation
• Oblivious Scalar-Product Protocols
• Optimal Size Integer Division Circuits
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Security and composition of multiparty cryptographic protocols
• The effectiveness of Lloyd-type methods for the \(k\)-means problem
• Theory of Cryptography
• Theory of Cryptography

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

Describes a project that uses

Uses Software

• SuLQ

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)