Cryptology ePrint Archive: Report 2020/1611

SLAP: Simple Lattice-Based Private Stream Aggregation Protocol

Jonathan Takeshita and Ryan Karl and Ting Gong and Taeho Jung

Abstract: Today, users' data is gathered and analyzed on a massive scale. While user data analytics such as personalized advertisement need to make use of this data, users may not wish to divulge their information without security and privacy guarantees. Private Stream Aggregation (PSA) allows the secure aggregation of time-series data, affording security and privacy to users' private data, which is much more efficient than general secure computation such as homomorphic encryption, multiparty computation, and secure hardware based approaches. Earlier PSA protocols face limitations including needless complexity or a lack of post-quantum security. In this work, we present SLAP, a lattice-based PSA protocol. SLAP features two variants with post-quantum security, with simpler and more efficient computations enabled by (1) the white- box approach that builds the encryption directly from the Ring Learning With Error assumption and (2) the state-of-the-art algorithmic optimization in lattice-based cryptography. We show that SLAP meets the security and privacy requirements of PSA, and show experimentally the improvements of SLAP over similar work. We show a speedup of 20.76x over the previous state-of-the-art lattice-based PSA work's aggregation, and apply techniques including RNS, NTT, and batching to obtain a throughput of over 600,000 aggregations per second.

Category / Keywords: cryptographic protocols / Lattice-based cryptography, Private stream aggregation, SIMD, RNS

Date: received 28 Dec 2020

Contact author: jtakeshi at nd edu,rkarl@nd edu,tgong@nd edu,tjung@nd edu

Available format(s): PDF | BibTeX Citation

Version: 20201229:184619 (All versions of this report)

Short URL: ia.cr/2020/1611


[ Cryptology ePrint archive ]