Practical and Provably Secure Distributed Aggregation: Verifiable Additive Homomorphic Secret Sharing
Journal article, 2020
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.
homomorphic secret sharing
verifiable computation
public verifiability
function secret sharing
Author
Georgia Tsaloli
Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)
Gustavo Souza Banegas
Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)
Aikaterini Mitrokotsa
Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)
Cryptography
2410-387X (eISSN)
Vol. 4 3 25Subject Categories
Media Engineering
Computer Science
Computer Vision and Robotics (Autonomous Systems)
DOI
10.3390/cryptography4030025