Private Analytics via Streaming, Sketching, and Silently Verifiable Proofs
Mayank Rathee, Yuwen Zhang, Henry Corrigan-Gibbs, Raluca Ada Popa
Abstract
We present Whisper, a system for privacy-preserving collection of aggregate statistics. Like prior systems, a Whisper deployment consists of a small set of non-colluding servers; these servers compute aggregate statistics over data from a large number of users without learning the data of any individual user. Whisper’s main contribution is that its server-to-server communication cost and its server-side storage costs scale sublinearly with the total number of users. In particular, prior systems required the servers to exchange a few bits of information to verify the well-formedness of each client submission. In contrast, Whisper uses silently verifiable proofs, a new type of proof system on secret-shared data that allows the servers to verify an arbitrarily large batch of proofs by exchanging a single 128-bit string. This improvement comes with increased client-to-server communication, which, in cloud computing, is typically cheaper (or even free) than the cost of egress for server-to-server communication. To reduce server storage, Whisper approximates certain statistics using smallspace sketching data structures. Applying randomized sketches in an environment with adversarial clients requires a careful and novel security analysis. In a deployment with two servers and 100,000 clients of which 1% are malicious, Whisper can improve server-to-server communication for vector sum by three orders of magnitude while each client’s communication increases by only 10%.
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 237381b1-504a-4e61-be09-87a5ee482be1Cited by top-tier papers4
- ORQ: Complex Analytics on Private Data with Strong Security GuaranteesEli Baum, Sam Buxbaum, Nitin Mathai, Muhammad Faisal et al.SOSP 2025 · 4 citations
- Heli: Heavy-Light Private AggregationRyan Lehmkuhl, Henry Corrigan-Gibbs, Emma Dauterman, David J. WuUSENIX Security 2026 · 1 citation
- C rypt D ough : A Unified Analytics Engine for Secure Multiparty ComputationMuhammad Faisal, Alessandra Lanz, Sam Buxbaum, Adam Godel et al.SOSP 2026
- Harnessing Sparsification in Federated Learning: A Secure, Efficient, and Differentially Private RealizationShuangqing Xu, Yifeng Zheng, Zhongyun HuaCCS 2025
Builds on21
- 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
- Heavy Hitter Estimation over Set-Valued Data with Local Differential PrivacyZhan Qin, Yin Yang, Ting Yu, Issa Khalil et al.CCS 2016 · 344 citations
- Lightweight Techniques for Private Heavy HittersDan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa et al.S&P 2021 · 134 citations
- Efficient Private Statistics with Succinct SketchesLuca Melis, George Danezis, Emiliano De CristofaroNDSS 2016 · 128 citations
Related papers
- TACITA: Threshold Aggregation without Client InteractionVarun Madathil, Arthur Lazzaretti, Zeyu Liu, Charalampos PapamanthouCCS 2026 · 2 citations
- Arithmetic SketchingDan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa et al.CRYPTO 2023 · 4 citations
- PRISM: Private Verifiable Set Computation over Multi-Owner Outsourced DatabasesYin Li, Dhrubajyoti Ghosh, Peeyush Gupta, Sharad Mehrotra et al.SIGMOD 2021 · 26 citations
- Secure Single-Server Aggregation with (Poly)Logarithmic OverheadJames Henry Bell, Kallista A. Bonawitz, Adrià Gascón, Tancrède Lepoint et al.CCS 2020 · 13 citations
- Hekaton: Horizontally-Scalable zkSNARKs Via Proof AggregationMichael Rosenberg, Tushar Mopuri, Hossein Hafezi, Ian Miers et al.CCS 2024 · 7 citations
