Outsourcing Computations to a Cloud That You Don't Trust
Licentiatavhandling, 2019

In many application scenarios, data need to be collected, stored and processed. Often sensitive data are collected from IoT devices, which are constrained regarding their resources, and, thus, remote, untrusted cloud servers are required to perform the computations. However, cloud computing raises many security and privacy concerns since cloud providers cannot be fully trustworthy. Data owners want their sensitive information to remain private and expect confidentiality guarantees; while users want to utilize the computations' results and desire correctness guarantees. Furthermore, in some cases, standard cryptographic primitives are not sufficient to ensure that there is no leakage of information.

In this work, we focus on the problem of outsourcing joint computations from joint sensitive inputs to multiple untrusted servers, while at the same time achieving public verifiability (i.e., everyone can verify the correctness of the computed result). Additionally, we investigate how to avoid any leakage of information by providing differential privacy guarantees on the outsourced computation. More precisely, we introduce the notion of verifiable homomorphic secret sharing (VHSS) which allows multiple clients to outsource joint computations on multiple servers providing also the capability to verify the correctness of the computed result. We propose a concrete instantiation of VHSS for the function that computes the product of n secret inputs. Besides, we suggest three instantiations of computing the sum of n secret inputs by employing homomorphic collision-resistant hash functions, linearly homomorphic signatures, and a threshold signature scheme, respectively. Moreover, we design a protocol that provides both differential privacy and verifiable computation guarantees for outsourced computations.

differential privacy

function secret sharing

homomorphic secret sharing

verifiable computation


public verifiability

EE, EDIT building, Rännvägen 6, Chalmers
Opponent: Prof. Melek Ōnen, Digital Security Department , EURECOM, France


Georgia Tsaloli

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

Differential Privacy meets Verifiable Computation: Achieving Strong Privacy and Integrity Guarantees

Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT,; Vol. Volume 2: SECRYPT(2019)p. 425-430

Paper i proceeding

Verifiable homomorphic secret sharing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),; Vol. 11192 LNCS(2018)p. 40-55

Paper i proceeding

G. Tsaloli and A. Mitrokotsa, Sum it Up: Veri fiable Additive Homomorphic Secret Sharing



Datavetenskap (datalogi)



Informations- och kommunikationsteknik


Chalmers tekniska högskola

EE, EDIT building, Rännvägen 6, Chalmers

Opponent: Prof. Melek Ōnen, Digital Security Department , EURECOM, France

Mer information

Senast uppdaterat