Name
Abstract | ||
|---|---|---|
Verifiable computation allows a client to outsource computations to a worker with a cryptographic proof of correctness of the result that can be verified faster than performing the computation. Recently, the highly efficient Pinocchio system was introduced as a major leap towards practical verifiable computation. Unfortunately, Pinocchio and other efficient verifiable computation systems require the client to disclose the inputs to the worker, which is undesirable for sensitive inputs. To solve this problem, we propose Trinocchio: a system that distributes Pinocchio to three (or more) workers, that each individually do not learn which inputs they are computing on. We fully exploit the almost linear structure of Pinochhio proofs, letting each worker essentially perform the work for a single Pinocchio proof; verification by the client remains the same. Moreover, we extend Trinocchio to enable joint computation with multiple mutually distrusting inputters and outputters and still very fast verification. We show the feasibility of our approach by analysing the performance of an implementation in a case study. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-39555-5_19 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Cryptography,Computer science,Correctness,Quadratic equation,Outsourcing,Verifiable computation,Theoretical computer science,Computation,Distributed computing | Journal | 9696 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.39 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Berry Schoenmakers | 1 | 1550 | 119.18 |
| Meilof Veeningen | 2 | 35 | 4.99 |
| Niels de Vreede | 3 | 8 | 2.57 |