Oblivious sampling with applications to two-party \(k\)-means clustering

DOI10.1007/s00145-020-09349-wzbMath1457.94104OpenAlexW3025904053MaRDI QIDQ2188971

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

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Sampling theory in information and communication theory (94A20)

Related Items (2)

Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load ⋮ Unsupervised Machine Learning on encrypted data

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Encrypted integer division and secure comparison
• Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
• Security and composition of multiparty cryptographic protocols
• Optimal Size Integer Division Circuits
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Advances in Cryptology – CRYPTO 2004
• The effectiveness of lloyd-type methods for the k-means problem
• Oblivious Polynomial Evaluation
• Theory of Cryptography
• Oblivious Scalar-Product Protocols
• Theory of Cryptography

This page was built for publication: Oblivious sampling with applications to two-party \(k\)-means clustering