DBScholar

Back to papers

FedKNN: Secure Federated k-Nearest Neighbor Search

Summary: FedKNN enables secure federated kNN with diverse similarity measures, tackling privacy-preserving computation for hard-to-compute distances (graph/sequence). It introduces DANN and DANN* (differentially oblivious) to minimize local work, offering privacy–efficiency trade-offs with up to 4.8x/2.7x gains on graph/sequence kNN. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6882
Venue
SIGMOD
Year
2024
Pagerank
7.0287643e-05
Overall Rank
3,906 | 73.21%
DOI
10.1145/3639266

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhang_sigmod24,
        title = {{FedKNN: Secure Federated k-Nearest Neighbor Search}},
        author = {Zhang, Xinyi and Wang, Qichen and Xu, Cheng and Peng, Yun and Xu, Jianliang},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3639266},
        url = {https://dl.acm.org/doi/10.1145/3639266},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers