Privately and Publicly Verifiable Computing Techniques

A Survey
1. Auflage 2017
ISBN: 978-3-319-53797-9
Verlag: Springer

Buch, Englisch, 64 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1299 g

Reihe: SpringerBriefs in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Demirel, Denise

Schabhüser, Lucas

Buchmann, Johannes

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik

Inhaltsverzeichnis

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.