Privacy-Preserving Data Aggregation with Public Verifiability Against Internal Adversaries

Conference Paper (2024)
Author(s)

Marco Palazzo (TU Delft - Electrical Engineering, Mathematics and Computer Science)

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

Alessandro Brighente (Università degli Studi di Padova)

Mauro Conti (TU Delft - Electrical Engineering, Mathematics and Computer Science, Università degli Studi di Padova)

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

Research Group
Cyber Security
More Info
expand_more
Publication Year
2024
Language
English
Related content
Research Group
Cyber Security
Pages (from-to)
6957-6974
Publisher
USENIX Association
ISBN (electronic)
9781939133441
Event
33rd USENIX Security Symposium, USENIX Security 2024 (2024-08-14 - 2024-08-16), Philadelphia, United States
Downloads counter
217
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

We consider the problem of publicly verifiable privacy-preserving data aggregation in the presence of a malicious aggregator colluding with malicious users. State-of-the-art solutions either split the aggregator into two parties under the assumption that they do not collude, or require many rounds of interactivity and have non-constant verification time. In this work, we propose mPVAS, the first publicly verifiable privacy-preserving data aggregation protocol that allows arbitrary collusion, without relying on trusted third parties during execution, where verification runs in constant time. We also show three extensions to mPVAS: mPVAS+, for improved communication complexity, mPVAS-IV, for the identification of malicious users, and mPVAS-UD, for graceful handling of reduced user availability without the need to redo the setup. We show that our schemes achieve the desired confidentiality, integrity, and authenticity. Finally, through both theoretical and experimental evaluations, we show that our schemes are feasible for real-world applications.