z-logo
open-access-imgOpen Access
Sum It Up: Verifiable Additive Homomorphic Secret Sharing
Author(s) -
Georgia Tsaloli,
Aikaterini Mitrokotsa
Publication year - 2020
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/978-3-030-40921-0_7
Subject(s) - homomorphic encryption , verifiable secret sharing , computer science , secret sharing , homomorphic secret sharing , correctness , computer security , server , cloud computing , hash function , theoretical computer science , secure multi party computation , scheme (mathematics) , outsourcing , shamir's secret sharing , cryptography , encryption , computer network , algorithm , programming language , law , mathematics , operating system , mathematical analysis , set (abstract data type) , political science
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom