Cryptology ePrint Archive: Report 2015/480

Trinocchio: Privacy-Friendly Outsourcing by Distributed Verifiable Computation

Berry Schoenmakers, Meilof Veeningen, and Niels de Vreede

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 Pinocchio system achieved faster verification than computation in practice for the first time. 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.

Category / Keywords:

Original Publication (with major differences): Proceedings ACNS 2016
DOI:
10.1007/978-3-319-39555-5_19

Date: received 20 May 2015, last revised 7 Jul 2016

Contact author: meilof at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20160707:135212 (All versions of this report)

Short URL: ia.cr/2015/480

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]