Privacy-Preserving Data Aggregation with Probabilistic Range Validation

Conference Paper (2021)
Author(s)

F.W. Dekker (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Zekeriya Erkin (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Research Group
Cyber Security
DOI related publication
https://doi.org/10.1007/978-3-030-78375-4_4 Final published version
More Info
expand_more
Publication Year
2021
Language
English
Research Group
Cyber Security
Volume number
12727
Pages (from-to)
79-98
ISBN (print)
978-3-030-78374-7
ISBN (electronic)
978-3-030-78375-4
Downloads counter
280
Collections
Institutional Repository
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Privacy-preserving data aggregation protocols have been researched widely, but usually cannot guarantee correctness of the aggregate if users are malicious. These protocols can be extended with zero-knowledge proofs and commitments to work in the malicious model, but this incurs a significant computational cost on the end users, making adoption of these protocols less likely.

We propose a privacy-preserving data aggregation protocol for calculating the sum of user inputs. Our protocol gives the aggregator confidence that all inputs are within a desired range. Instead of zero-knowledge proofs, our protocol relies on a probabilistic hypergraph-based detection algorithm with which the aggregator can quickly pinpoint malicious users. Furthermore, our protocol is robust to user dropouts and, apart from the setup phase, it is non-interactive.

Files

Dekker_Erkin2021_Chapter_Priva... (pdf)
(pdf | 0.818 Mb)
- Embargo expired in 09-12-2021
License info not available