Shared Spotlight Meridian: Distributed Sparse Pseudorandom Functions for Scalable Federated Learning
Youlong Ding, Peihua Mai, Jingqi Zhang, Sherman S. M. Chow, Minxin Du, Yan Pang
Abstract
Secure federated learning enables multiple clients to train a shared model while keeping raw data private. Minimizing communication is natural in secure multiparty computation, yet cryptographic mechanisms create tension. Consequently, existing secure aggregation protocols are illsuited to high-dimensional sparse updates and forfeit sparsification gains, inflating communication by orders of magnitude relative to plaintext aggregation.
Seeking efficiency under privacy, we introduce distributed sparse pseudorandom functions. Hidden alignment comes from a secretly shared spotlight index that illuminates the chosen coordinate and serves as a meridian that anchors aggregations of nonzero entries. Enabled by our cryptographic advances, we present a secure aggregation protocol with near-optimal client communication. Relative to a plaintext baseline, each client sends at most one extra bit per nonzero gradient element. Multi-server security holds unless all servers collude. At the client side, computational overhead is small, and server communication is optimal. Near-baseline accuracy is seen across computer vision, natural language processing, and recommendation experiments, with plaintext-level bandwidth savings.
- Here, we assume i matches the coordinate that the client will use. 2. Advanced encryption standard, or any pseudorandom permutation
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 560cc79f-c982-4d6a-8fc9-c02273b8a4f1Cited by top-tier papers1
Ask how each one uses itBuilds on16
- LoRA: Low-Rank Adaptation of Large Language ModelsEdward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu et al.ICLR 2022 · 18,833 citations
- Practical Secure Aggregation for Privacy-Preserving Machine LearningKallista A. Bonawitz, Vladimir Ivanov, Ben Kreuter, Antonio Marcedone et al.CCS 2017 · 3,936 citations
- Function Secret Sharing: Improvements and ExtensionsElette Boyle, Niv Gilboa, Yuval IshaiCCS 2016 · 404 citations
- Lightweight Techniques for Private Heavy HittersDan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa et al.S&P 2021 · 134 citations
- Rethinking gradient sparsification as total error minimizationAtal Narayan Sahu, Aritra Dutta, Ahmed M. Abdelmoniem, Trambak Banerjee et al.NeurIPS 2021 · 85 citations
Related papers
- NFSA: Non-Forward Secure Aggregation with One Server via Two Layer Secret SharingYufei ZhouCCS 2026
- The Fundamental Price of Secure Aggregation in Differentially Private Federated LearningWei-Ning Chen, Christopher A. Choquette-Choo, Peter Kairouz, Ananda Theertha SureshICML 2022 · 82 citations
- The Resource Problem of Using Linear Layer Leakage Attack in Federated LearningJoshua C. Zhao, Ahmed Roushdy Elkordy, Atul Sharma, Yahya H. Ezzeldin et al.CVPR 2023
- Lighthouse: Single-Server Secure Aggregation with O(1) Server-Committee Communication at ScaleSanjam Garg, Alireza Kavousi, Dimitris Kolonelos, Erkan Tairi et al.USENIX Security 2026 · 1 citation
- PREAMBLE: Private and Efficient Aggregation via Block Sparse VectorsHilal Asi, Vitaly Feldman, Hannah Keller, Guy N. Rothblum et al.NeurIPS 2025 · 1 citation
