Hayim Shaul

Scalable Secure Computation of Statistical Functions with Applications to k-Nearest Neighbors.

2018 · arXiv (Cornell University)

Given a set $S$ of $n$ $d$-dimensional points, the $k$-nearest neighbors (KNN) is the problem of quickly finding $k$ points in $S$ that are nearest to a query point $q$. The $k$-nearest neighbors problem has …

Efficient Pruning for Machine Learning Under Homomorphic Encryption

2022 · arXiv (Cornell University)

Privacy-preserving machine learning (PPML) solutions are gaining widespread popularity. Among these, many rely on homomorphic encryption (HE) that offers confidentiality of the model and the data, but at the cost of large latency and memory …