Revisiting Private Stream Aggregation: Lattice-Based PSA
Abstract
In this age of massive data gathering for purposes of personalization, targeted ads, etc. there is an increased need for technology that allows for data analysis in a privacy-preserving manner. Private Stream Aggregation as introduced by Shi et al. (NDSS 2011) allows for the execution of aggregation operations over privacy-critical data from multiple data sources without placing trust in the aggregator and while maintaining differential privacy guarantees. We propose a generic PSA scheme, LaPS, based on the Learning With Error problem, which allows for a flexible choice of the utilized privacy-preserving mechanism while maintaining post-quantum security. We overcome the limitations of earlier schemes by relaxing previous assumptions in the security model and provide an efficient and compact scheme with high scalability. Our scheme is practical, for a plaintext space of 2 16 and 1000 participants we achieve a performance gain in decryption of roughly 150 times compared to previous results in Shi et al. (NDSS 2011).
Ask Lune
Know this paper in minutes, not an afternoon.
Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.
1 top-tier paper has cited it since. Know what they found before your reviewers do.
Lune can draw on
the full paper · the top-tier papers that cite it · related work
Free to start. No credit card required.
Lineage
Cited by top-tier papers1
Related papers
- Efficient Private Statistics with Succinct SketchesLuca Melis, George Danezis, Emiliano De CristofaroNDSS 2016 · 128 citations
- Piquant: Private Quantile Estimation in the Two-Server ModelHannah Keller, Jacob Imola, Fabrizio Boninsegna, Rasmus Pagh et al.CCS 2026
- TACITA: Threshold Aggregation without Client InteractionVarun Madathil, Arthur Lazzaretti, Zeyu Liu, Charalampos PapamanthouCCS 2026 · 2 citations
- Efficient Differentially Private Secure Aggregation for Federated Learning via Hardness of Learning with ErrorsTimothy Stevens, Christian Skalka, Christelle Vincent, John H. Ring et al.USENIX Security 2022
- LZKSA: Lattice-Based Special Zero-Knowledge Proofs for Secure Aggregation's Input VerificationZhi Lu, Songfeng LuCCS 2025 · 2 citations
