Multi-Client Verifiable Computation with Stronger Security Guarantees

Gordon, Steven; Katz, Jonathan; Liu, Feng-Hao; Shi, Elaine; Zhou, Hong-Sheng

doi:10.1007/978-3-662-46497-7_6

Cited by 44 publications

(32 citation statements)

References 32 publications

(70 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, their scheme fails to achieve adaptive soundness, and is susceptible to selective failure attacks. Recently, Gordon et al investigated the simulation-based security mechanism that automatically detects many vulnerable selective failure attacks during MVC session [96]. The authors presented MVC construction based on falsifiable assumption that is feasible to work only when clients are not allowed to collude with server.…”

Section: Fully Homomorphic Encryption (Fhe)mentioning

confidence: 99%

Primitives towards verifiable computation: a survey

Ahmad

Wang

Hong

et al. 2018

Front. Comput. Sci.

View full text Add to dashboard Cite

Verifiable computation (VC) paradigm has got the captivation that in real term is highlighted by the concept of third party computation. In more explicate terms, VC allows resource constrained clients/organizations to securely outsource expensive computations to untrusted service providers, while acquiring the publicly or privately verifiable results. Many mainstream solutions have been proposed to address the diverse problems within the VC domain. Some of them imposed assumptions over performed computations, while the others took advantage of interactivity /non-interactivity, zero knowledge proofs, and arguments. Further proposals utilized the powers of probabilistic checkable or computationally sound proofs. In this survey, we present a chronological study and classify the VC proposals based on their adopted domains. First, we provide a broader overview of the theoretical advancements while critically analyzing them. Subsequently, we present a comprehensive view of their utilization in the state of the art VC approaches. Moreover, a brief overview of recent proof based VC systems is also presented that lifted up the VC domain to the verge of practicality. We use the presented study and reviewed results to identify the similarities and alterations, modifications, and hybridization of different approaches, while comparing their advantages and reporting their overheads. Finally, we discuss implementation of such VC based systems, their applications, and the likely future directions.

show abstract

Section: Fully Homomorphic Encryption (Fhe)mentioning

confidence: 99%

Primitives towards verifiable computation: a survey

Ahmad

Wang

Hong

et al. 2018

Front. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…In secure MPC protocols, clients (jointly) perform some computation without revealing to each other their private inputs. There are two protocols for such scenarios, [6] based on Yao's garbled circuits, FHE and non-interactive proxy oblivious transfer, and [16] based on the same building blocks plus multi-sender attribute-based encryption. These protocols do not require clients to directly interact with each other at setup.…”

Section: Related Workmentioning

confidence: 99%

“…This is a reasonable assumption as it is usually a well-established company and does not want to jeopardize its reputation by colluding with others. The non-colluding assumption is well-accepted and widely used in the literature [18,16]. Moreover, we allow an adversary who corrupts a client to be semi-honest.…”

Section: Security Modelmentioning

confidence: 99%

VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets

Abadi

Terzis

Dong

2017

Financial Cryptography and Data Security

View full text Add to dashboard Cite

Abstract. Private set intersection (PSI) protocols have many real world applications. With the emergence of cloud computing the need arises to carry out PSI on outsourced datasets where the computation is delegated to the cloud. However, due to the possibility of cloud misbehaviors, it is essential to verify the integrity of any outsourced datasets, and result of delegated computation. Verifiable Computation on private datasets that does not leak any information about the data is very challenging, especially when the datasets are outsourced independently by different clients. In this paper we present VD-PSI, a protocol that allows multiple clients to outsource their private datasets and delegate computation of set intersection to the cloud, while being able to verify the correctness of the result. Clients can independently prepare and upload their datasets, and with their agreement can verifiably delegate the computation of set intersection an unlimited number of times, without the need to download or maintain a local copy of their data. The protocol ensures that the cloud learns nothing about the datasets and the intersection. VD-PSI is efficient as its verification cost is linear to the intersection cardinality, and its computation and communication costs are linear to the dataset cardinality. Also, we provide a formal security analysis in the standard model.

show abstract

“…Another line of work, closely related to ours is that on multi-client verifiable computation [17,30]. This primitive, introduced by Choi et al [17], aims to extend VC to the setting where inputs are provided by multiple users, and one of these users wants to verify the result's correctness.…”

Section: Related Workmentioning

confidence: 99%

Multi-key Homomorphic Authenticators

Fiore

Mitrokotsa

Nizzardo

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Homomorphic authenticators (HAs) enable a client to authenticate a large collection of data elements m1, . . . , mt and outsource them, along with the corresponding authenticators, to an untrusted server. At any later point, the server can generate a short authenticator σ f,y vouching for the correctness of the output y of a function f computed on the outsourced data, i.e., y = f (m1, . . . , mt). Recently researchers have focused on HAs as a solution, with minimal communication and interaction, to the problem of delegating computation on outsourced data. The notion of HAs studied so far, however, only supports executions (and proofs of correctness) of computations over data authenticated by a single user. Motivated by realistic scenarios (ubiquitous computing, sensor networks, etc.) in which large datasets include data provided by multiple users, we study the concept of multi-key homomorphic authenticators. In a nutshell, multi-key HAs are like HAs with the extra feature of allowing the holder of public evaluation keys to compute on data authenticated under different secret keys. In this paper, we introduce and formally define multi-key HAs. Secondly, we propose a construction of a multi-key homomorphic signature based on standard lattices and supporting the evaluation of circuits of bounded polynomial depth. Thirdly, we provide a construction of multi-key homomorphic MACs based only on pseudorandom functions and supporting the evaluation of low-degree arithmetic circuits. Albeit being less expressive and only secretly verifiable, the latter construction presents interesting efficiency properties.

show abstract

Multi-Client Verifiable Computation with Stronger Security Guarantees

Cited by 44 publications

References 32 publications

Primitives towards verifiable computation: a survey

Primitives towards verifiable computation: a survey

VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets

Multi-key Homomorphic Authenticators

Contact Info

Product

Resources

About