Practical and Provably Secure Distributed Aggregation: Verifiable Additive Homomorphic Secret Sharing

Item Type Journal paper
Abstract

Often clients (e.g., sensors, organizations) need to outsource joint computations that are based on some joint inputs to external untrusted servers. These computations often rely on the aggregation of data collected from multiple clients, while the clients want to guarantee that the results are correct and, thus, an output that can be publicly verified is required. However, important security and privacy challenges are raised, since clients may hold sensitive information. In this paper, we propose an approach, called verifiable additive homomorphic secret sharing (VAHSS), to achieve practical and provably secure aggregation of data, while allowing for the clients to protect their secret data and providing public verifiability i.e., everyone should be able to verify the correctness of the computed result. We propose three VAHSS constructions by combining an additive homomorphic secret sharing (HSS) scheme, for computing the sum of the clients’ secret inputs, and three different methods for achieving public verifiability, namely: (i) homomorphic collision-resistant hash functions; (ii) linear homomorphic signatures; as well as (iii) a threshold RSA signature scheme. In all three constructions, we provide a detailed correctness, security, and verifiability analysis and detailed experimental evaluations. Our results demonstrate the efficiency of our proposed constructions, especially from the client side.

Authors Tsaloli, Georgia; Banegas, Gustavo & Mitrokotsa, Katerina
Research Team Chair of Cybersecurity, School of Computer Science
Journal or Publication Title Cryptography
Language English
Subjects computer science
HSG Classification contribution to scientific community
Refereed Yes
Date 21 September 2020
Publisher MDPI
Volume 4
Number 3
Page Range 25-47
Number of Pages 22
Publisher DOI 10.3390/cryptography4030025
Official URL https://www.mdpi.com/2410-387X/4/3/25
Depositing User Prof. Dr. Katerina Mitrokotsa
Date Deposited 24 Dec 2020 08:46
Last Modified 07 Apr 2021 08:00
URI: https://www.alexandria.unisg.ch/publications/261813

Download

[img] Text
cryptography-04-00025-v2.pdf - Published Version

Download (874kB)

Citation

Tsaloli, Georgia; Banegas, Gustavo & Mitrokotsa, Katerina (2020) Practical and Provably Secure Distributed Aggregation: Verifiable Additive Homomorphic Secret Sharing. Cryptography, 4 (3). 25-47.

Statistics

https://www.alexandria.unisg.ch/id/eprint/261813
Edit item Edit item
Feedback?