Sum It Up: Verifiable Additive Homomorphic Secret Sharing
Type
conference paper
Date Issued
2019
Author(s)
Tsaloli, Georgia
Abstract
In many situations, clients (e.g., researchers, companies, hospitals) need to outsource joint computations based on joint inputs to external cloud servers in order to provide useful results. Often 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 and the cloud servers can be untrusted. Our goal is to allow the clients to protect their secret data, while providing public verifiability i.e., everyone should be able to verify the correctness of the computed result.
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
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
Language
English
HSG Classification
contribution to scientific community
Start page
115
End page
132
Event Title
Information Security and Cryptology - ICISC 2019 - 22nd International Conference, Seoul, South Korea, December 4-6, 2019, Revised Selected Papers
Official URL
Subject(s)
Division(s)
Eprints ID
262278
File(s)![Thumbnail Image]()
Loading...
open.access
Name
PaperC.pdf
Size
755.46 KB
Format
Adobe PDF
Checksum (MD5)
4e5fefdd39ac7ebee0f018d30e79e886