Verifiable homomorphic secret sharing
Paper i proceeding, 2018

In this paper, we explore the multi-server (i.e., multiple servers are employed to perform computations) and multi-client (i.e., multiple clients outsource joint computations on their joint inputs) scenario that avoids single points of failure and provides higher security and privacy guarantees. More precisely, we introduce the notion of verifiable homomorphic secret sharing (VHSS) for multi-input, that allows n clients to outsource joint computations on their joint inputs to m servers without requiring any communication between the clients or the servers; while providing the verifiable capability to any user to confirm that the final output (rather than each share) is correct. Our contributions are two-fold: (i) we provide a detailed example for casting Shamir’s secret sharing scheme over a finite field F as an n-client, m-server, t-secure perfectly secure, additive HSS scheme for the function f that sums n field elements, and (ii) we propose an instantiation of an n-client, m-server, t-secure computationally secure, multiplicative VHSS scheme for the function f that multiplies n elements under the hardness assumption of the fixed inversion problem in bilinear maps.

Verifiable computation

Homomorphic secret sharing

Function secret sharing

Författare

Georgia Tsaloli

Chalmers, Data- och informationsteknik, Nätverk och system

Bei Liang

Chalmers, Data- och informationsteknik, Nätverk och system

Aikaterini Mitrokotsa

Chalmers, Data- och informationsteknik, Nätverk och system

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 11192 LNCS 40-55

12th International Conference on Provable Security, ProvSec 2018
Jeju, South Korea,

Ämneskategorier

Telekommunikation

Kommunikationssystem

Signalbehandling

DOI

10.1007/978-3-030-01446-9_3

Mer information

Senast uppdaterat

2019-01-07