DEVA : Decentralized, Verifiable Secure Aggregation for Privacy-Preserving Learning
Paper in proceeding, 2021

Aggregating data from multiple sources is often required in multiple applications. In this paper, we introduce DEVA, a protocol that allows a distributed set of servers to perform secure and verifiable aggregation of multiple users’ secret data, while no communication between the users occurs. DEVA computes the sum of the users’ input and provides public verifiability, i.e., anyone can be convinced about the correctness of the aggregated sum computed from a threshold amount of servers. A direct application of the DEVA protocol is its employment in the machine learning setting, where the aggregation of multiple users’ parameters (used in the learning model), can be orchestrated by multiple servers, contrary to centralized solutions that rely on a single server. We prove the security and verifiability of the proposed protocol and evaluate its performance for the execution time and bandwidth, the verification execution, the communication cost, and the total bandwidth usage of the protocol. We compare our findings to the prior work, concluding that DEVA requires less communication cost for a big amount of users.

Secure aggregation





Georgia Tsaloli

Network and Systems

Bei Liang

Beijing Institute of Mathematical Sciences and Applications

Carlo Brunetta

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

Gustavo Banegas

Polytechnic Institute of Paris

Aikaterini Mitrokotsa

University of St Gallen

Network and Systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 13118 LNCS 296-319
9783030913557 (ISBN)

24th International Conference on Information Security, ISC 2021
Virtual, Online, ,

Subject Categories


Communication Systems

Computer Science



More information

Latest update

1/7/2022 2