From Secrecy to Soundness: Efficient Verification via Secure Computation

d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 Computer Science Department, Technion We study the problem of verifiable computation (VC) in which a computationally weak client wishes to delegate the computation of a function f on an input x to a computationally strong but untrusted server. We present new general approaches for constructing VC protocols, as well as solving the related problems of program checking and self-correcting. The new approaches reduce the task of verifiable computation to suitable variants of secure multiparty computation (MPC) protocols. In particular, we show how to efficiently convert the secrecy property of MPC protocols into soundness of a VC protocol via the use of a message authentication code (MAC). The new connections allow us to apply results from the area of MPC towards simplifying, unifying, and improving over previous ...

• Type: Conference
• Year: 2010
• Where: ICALP
• Authors: Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
• Keywords: Computer Science Department, ICALP 2010, Programming Languages, Vc Protocol, Verifiable Computation