東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Privately and publicly verifiable co...

Demirel, Denise.

FindBook

Google Book

Amazon

博客來

Privately and publicly verifiable computing techniques = a survey /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Privately and publicly verifiable computing techniques/ by Denise Demirel, Lucas Schabhuser, Johannes Buchmann.
其他題名:	a survey /
作者:	Demirel, Denise.
其他作者:	Schabhuser, Lucas.
出版者:	Cham :Springer International Publishing : : 2017.,
面頁冊數:	xii, 64 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Computer programs - Verification. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-53798-6
ISBN:	9783319537986

Privately and publicly verifiable computing techniques = a survey /
Demirel, Denise.

Privately and publicly verifiable computing techniquesa survey /[electronic resource] :by Denise Demirel, Lucas Schabhuser, Johannes Buchmann. - Cham :Springer International Publishing :2017. - xii, 64 p. :ill., digital ;24 cm. - SpringerBriefs in computer science,2191-5768. - SpringerBriefs in computer science..

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 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 the 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.

ISBN: 9783319537986

Standard No.: 10.1007/978-3-319-53798-6doiSubjects--Topical Terms:

813796
Computer programs
--Verification.

LC Class. No.: QA76.6

Dewey Class. No.: 005.14

Privately and publicly verifiable computing techniques = a survey /
LDR:02231nmm a2200337 a 4500 001 2092574
003 DE-He213
005 20170330152225.0
006 m d
007 cr nn 008maaau
008 171117s2017 gw s 0 eng d
020 $a 9783319537986 $q (electronic bk.)
020 $a 9783319537979 $q (paper)
024 7 $a 10.1007/978-3-319-53798-6 $2 doi
035 $a 978-3-319-53798-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.6
072 7 $a UMB $2 bicssc
072 7 $a URY $2 bicssc
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 005.14 $2 23
090 $a QA76.6 $b .D381 2017
100 1 $a Demirel, Denise. $3 2191238
245 1 0 $a Privately and publicly verifiable computing techniques $h [electronic resource] : $b a survey / $c by Denise Demirel, Lucas Schabhuser, Johannes Buchmann.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xii, 64 p. : $b ill., digital ; $c 24 cm.
490 1 $a SpringerBriefs in computer science, $x 2191-5768
505 0 $a 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.
520 $a 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 the 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.
650 0 $a Computer programs $x Verification. $3 813796
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Data Structures, Cryptology and Information Theory. $3 891008
650 2 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Discrete Mathematics. $3 1569938
650 2 4 $a Performance and Reliability. $3 893430
700 1 $a Schabhuser, Lucas. $3 3226544
700 1 $a Buchmann, Johannes. $3 588962
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a SpringerBriefs in computer science. $3 1567571
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-53798-6
950 $a Computer Science (Springer-11645)