This book presents the first comprehensive overview of various verifiable computing techniques, which allow the computation of a function on outsourced data to be delegated to a server. It provides a brief description of all the approaches and highlights the properties each solution achieves. Further, it analyzes the level of security provided, how efficient the verification process is, who can act as a verifier and check the correctness of the result, which function class the verifiable computing scheme supports, and whether privacy with respect to t he input and/or output data is provided. On the basis of this analysis the authors then compare the different approaches and outline possible directions for future work.
The book is of interest to anyone wanting to understand the state of the art of this research field.
Introduction
Preliminaries
Proof Based Verifiable Computing
Verifiable Computing from Fully Homomorphic Encryption
Homomorphic Authenticators
Verifiable Computing Frameworks from Functional Encryption and Functional Signatures
Verifiable Computing for Specific Applications
Analysis of the State of the Art
Conclusion
This work is the first comprehensive overview and comparison of all existing constructions and provides a good introduction to the research field of verifiable computing
This survey provides a good overview of the literature and helps people to understand this research field and the state of the art with respect to verifiable computing
For all existing approaches we provide a brief description of the approach and highlight the properties the solution achieve. More precisely, we analyse which level of security it provides, how efficient the verification process l]