Sum It Up: Verifiable Additive Homomorphic Secret Sharing

Item Type Conference or Workshop Item (Paper)
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
Authors Tsaloli, Georgia & Mitrokotsa, Aikaterini
Language English
Subjects computer science
HSG Classification contribution to scientific community
Date 2019
Page Range 115-132
Event Title Information Security and Cryptology - ICISC 2019 - 22nd International Conference, Seoul, South Korea, December 4-6, 2019, Revised Selected Papers
Official URL https://doi.org/10.1007/978-3-030-40921-0\_7
Depositing User Prof. Dr. Katerina Mitrokotsa
Date Deposited 06 Feb 2021 19:07
Last Modified 20 Jul 2022 17:44
URI: https://www.alexandria.unisg.ch/publications/262278

Download

[img] Text
PaperC.pdf

Download (773kB)

Citation

Tsaloli, Georgia & Mitrokotsa, Aikaterini: Sum It Up: Verifiable Additive Homomorphic Secret Sharing. 2019. - Information Security and Cryptology - ICISC 2019 - 22nd International Conference, Seoul, South Korea, December 4-6, 2019, Revised Selected Papers.

Statistics

https://www.alexandria.unisg.ch/id/eprint/262278
Edit item Edit item
Feedback?