Sum it Up: Verifiable Additive Homomorphic Secret Sharing
Paper in proceeding, 2020
In this paper, we propose three concrete constructions of verifiable additive homomorphic secret sharing (VAHSS) to solve this problem. Our instantiations combine an additive homomorphic secret sharing (HSS) scheme, which relies on Shamir’s secret sharing scheme over a finite field 𝔽, for computing the sum of the clients’ secret inputs, and three different methods for achieving public verifiability. More precisely, we employ: (i) homomorphic collision-resistant hash functions; (ii) linear homomorphic signatures; as well as (iii) a threshold RSA signature scheme. In all three cases we provide a detailed correctness, security and verifiability analysis and discuss their efficiency.
homomorphic secret sharing
verifiable computation
public verifiability
function secret sharing
Author
Georgia Tsaloli
Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)
Aikaterini Mitrokotsa
Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
Vol. 11975 LNCS 2020 115-132978-303040920-3 (ISBN)
Seoul, South Korea,
Subject Categories
Other Computer and Information Science
Computer Science
Computer Systems
DOI
10.1007/978-3-030-40921-0_7
ISBN
9783030409203