Next Article in Journal
Secure Boot for Reconfigurable Architectures
Previous Article in Journal
Chaotic Quantum Key Distribution
Open AccessArticle

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

Department of Computer Science and Engineering, Chalmers University of Technology, 41296 Gothenburg, Sweden
*
Author to whom correspondence should be addressed.
Information Security and Cryptology—ICISC 2019 Conference, Seoul, Korea, 4–6 December 2019.
Cryptography 2020, 4(3), 25; https://doi.org/10.3390/cryptography4030025
Received: 29 July 2020 / Revised: 10 September 2020 / Accepted: 16 September 2020 / Published: 21 September 2020
(This article belongs to the Special Issue Techniques and Protocols to Preserve and Enhance Privacy)
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. View Full-Text
Keywords: function secret sharing; homomorphic secret sharing; verifiable computation; public verifiability function secret sharing; homomorphic secret sharing; verifiable computation; public verifiability
Show Figures

Figure 1

MDPI and ACS Style

Tsaloli, G.; Banegas, G.; Mitrokotsa, A. Practical and Provably Secure Distributed Aggregation: Verifiable Additive Homomorphic Secret Sharing. Cryptography 2020, 4, 25.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop