Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
From Secrecy to Soundness: Efficient Verification via Secure Computation
 

Summary: From Secrecy to Soundness:
Efficient Verification via Secure Computation
(Extended 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
Abstract. 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 proto-
cols, as well as solving the related problems of program checking and
self-correcting. The new approaches reduce the task of verifiable com-
putation to suitable variants of secure multiparty computation (MPC)
protocols. In particular, we show how to efficiently convert the secrecy

  

Source: Applebaum, Benny - Faculty of Mathematics and Computer Science, Weizmann Institute of Science

 

Collections: Computer Technologies and Information Sciences