1 option
Privately and Publicly Verifiable Computing Techniques : A Survey / by Denise Demirel, Lucas Schabhüser, Johannes Buchmann.
- Format:
- Book
- Author/Creator:
- Demirel, Denise, author.
- Schabhüser, Lucas, author.
- Buchmann, Johannes, author.
- Series:
- Computer Science (Springer-11645)
- SpringerBriefs in computer science 2191-5768
- SpringerBriefs in Computer Science, 2191-5768
- Language:
- English
- Subjects (All):
- Data structures (Computer science).
- Computer science--Mathematics.
- Computer science.
- Discrete mathematics.
- Computer software--Reusability.
- Computer software.
- Data Structures and Information Theory.
- Mathematics of Computing.
- Discrete Mathematics.
- Performance and Reliability.
- Local Subjects:
- Data Structures and Information Theory.
- Mathematics of Computing.
- Discrete Mathematics.
- Performance and Reliability.
- Physical Description:
- 1 online resource (XII, 64 pages).
- Edition:
- First edition 2017.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2017.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-53798-6
- 9783319537986
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.