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 is, whether anyone or only the client 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 the input and/or output data is given Includes supplementary material: sn.pub/extras