atlas

Research map / Federated learning and privacy / Privacy attacks and secure learning

Kona: An Efficient Privacy-Preservation Framework for KNN Classification by Communication Optimization

ICML 2025 · Federated learning and privacy › Privacy attacks and secure learning · approach: Encryption-based private learning

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Kona is a two-party MPC framework for privacy-preserving KNN classification that removes online communication for Euclidean distance computation via Euclidean triples and cuts neighbor-selection rounds with a divide-and-conquer bubble protocol.

Problem

Existing secure KNN classification frameworks incur large online communication size for secure Euclidean square distance computation and many communication rounds for selecting the k nearest neighbors, which hurts practicality especially over WANs.

Approach

Input-independent but function-dependent Euclidean triples (u, v, w=(u-v)^2) tailored to squared Euclidean distance so that distances are computed locally with no online communication, plus a divide-and-conquer compare-swap bubble protocol that reduces selection rounds from O(kn) to O(k log n).

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Kona instead of SecKNN for privacy-preserving KNNKNN classification · Eight UCI datasetscommunication size: 1.10× to 3121.25× reductionHelped
Use Kona instead of SecKNN for privacy-preserving KNNKNN classification · Eight UCI datasetscommunication rounds: 16.7× to 5783.21× reductionHelped
Use Kona instead of SecKNN for privacy-preserving KNNKNN classification · Eight UCI datasets, WANruntime: 14.36× to 232.60× speedupsHelped
Transform plaintext KNN computation to privacy-preserving computation with KonaKNN classification · Eight UCI datasetsaccuracyNo clear effect
Add Euclidean triples (ablation)SecKNN · Eight UCI datasetscommunication size: 1.10× to 3064.94×Helped
Add Euclidean triples (ablation)SecKNN · Eight UCI datasets, WAN and LANruntime: 1.00× to 10.16×Helped
Add the DQBubble protocol (ablation)SecKNN · Eight UCI datasetscommunication rounds: 16.16× to 5688.51×Helped
Add the DQBubble protocol (ablation)SecKNN · Eight UCI datasets, WANruntime: 1.62× to 164.56×Helped

Limitations

Experimental setup

Datasets: Toxicity Iris Arcene PEMS-SF RNA-seq Spambase Mnist Dota2 Games

Benchmarks: Toxicity Iris Arcene PEMS-SF RNA-seq Spambase Mnist Dota2 Games

Metrics: communication size communication rounds online runtime accuracy

Baselines: SecKNN scikit-learn KNN sun & yang homomorphic encryption KNN Liu et al. secret-sharing KNN

Builds on: SecKNN function secret sharing masked secret sharing additive secret sharing

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy