1. Revisiting Private Stream Aggregation: Lattice-Based PSA 2018 Lattices MPC NDSS Privacy
    Daniela Becker and Jorge Guajardo and Karl-Heinz Zimmermann
    [View PDF on ndss-symposium.org]
    [Show BibTex Citation]

    author = {Daniela Becker and
    Jorge Guajardo and
    Karl{-}Heinz Zimmermann},
    title = {Revisiting Private Stream Aggregation: Lattice-Based {PSA}},
    booktitle = {25th Annual Network and Distributed System Security Symposium, {NDSS}
    2018, San Diego, California, USA, February 18-21, 2018},
    year = {2018},
    url = {http://wp.internetsociety.org/ndss/wp-content/uploads/sites/25/2018/02/ndss2018\_02B-3\_Becker\_paper.pdf},
    timestamp = {Thu, 09 Aug 2018 10:57:16 +0200},
    biburl = {https://dblp.org/rec/bib/conf/ndss/BeckerGZ18},
    bibsource = {dblp computer science bibliography, https://dblp.org}

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 216 and 1000 participants we achieve a performance gain in decryption of roughly 150 times compared to previous results in Shi et al. (NDSS 2011).