東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Partially homomorphic encryption

Koc, Cetin Kaya.

FindBook

Google Book

Amazon

博客來

Partially homomorphic encryption

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Partially homomorphic encryption/ by Cetin Kaya Koc, Funda Ozdemir, Zeynep Odemis Ozger.
作者:	Koc, Cetin Kaya.
其他作者:	Ozdemir, Funda.
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	x, 146 p. :ill., digital ;24 cm.
內容註:	Introduction -- Mathematical Background -- Rivest-Shamir-Adleman Algorithm -- Goldwasser-Micali Algorithm -- ElGamal Algorithm -- Benaloh Algorithm -- Naccache-Stern Algorithm -- Okamoto-Uchiyama Algorithm -- Paillier Algorithm -- Damgard-Jurik Algorithm -- Boneh-Goh-Nissim Algorithm -- Sander-Young-Yung Algorithm -- Bibliography -- Index.
Contained By:	Springer Nature eBook
標題:	Cryptography. -
電子資源:	https://doi.org/10.1007/978-3-030-87629-6
ISBN:	9783030876296

Partially homomorphic encryption
Koc, Cetin Kaya.

Partially homomorphic encryption[electronic resource] /by Cetin Kaya Koc, Funda Ozdemir, Zeynep Odemis Ozger. - Cham :Springer International Publishing :2021. - x, 146 p. :ill., digital ;24 cm.

Introduction -- Mathematical Background -- Rivest-Shamir-Adleman Algorithm -- Goldwasser-Micali Algorithm -- ElGamal Algorithm -- Benaloh Algorithm -- Naccache-Stern Algorithm -- Okamoto-Uchiyama Algorithm -- Paillier Algorithm -- Damgard-Jurik Algorithm -- Boneh-Goh-Nissim Algorithm -- Sander-Young-Yung Algorithm -- Bibliography -- Index.

This monograph describes and implements partially homomorphic encryption functions using a unified notation. After introducing the appropriate mathematical background, the authors offer a systematic examination of the following known algorithms: Rivest-Shamir-Adleman; Goldwasser-Micali; ElGamal; Benaloh; Naccache-Stern; Okamoto-Uchiyama; Paillier; Damgaard-Jurik; Boneh-Goh-Nissim; and Sander-Young-Yung. Over recent years partially and fully homomorphic encryption algorithms have been proposed and researchers have addressed issues related to their formulation, arithmetic, efficiency and security. Formidable efficiency barriers remain, but we now have a variety of algorithms that can be applied to various private computation problems in healthcare, finance and national security, and studying these functions may help us to understand the difficulties ahead. The book is valuable for researchers and graduate students in Computer Science, Engineering, and Mathematics who are engaged with Cryptology.

ISBN: 9783030876296

Standard No.: 10.1007/978-3-030-87629-6doiSubjects--Topical Terms:

532586
Cryptography.

LC Class. No.: QA268

Dewey Class. No.: 005.824

Partially homomorphic encryption
LDR:02346nmm a2200337 a 4500 001 2251169
003 DE-He213
005 20210929203411.0
006 m d
007 cr nn 008maaau
008 220215s2021 sz s 0 eng d
020 $a 9783030876296 $q (electronic bk.)
020 $a 9783030876289 $q (paper)
024 7 $a 10.1007/978-3-030-87629-6 $2 doi
035 $a 978-3-030-87629-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA268
072 7 $a GPJ $2 bicssc
072 7 $a COM053000 $2 bisacsh
072 7 $a GPJ $2 thema
072 7 $a URY $2 thema
082 0 4 $a 005.824 $2 23
090 $a QA268 $b .K76 2021
100 1 $a Koc, Cetin Kaya. $3 1001792
245 1 0 $a Partially homomorphic encryption $h [electronic resource] / $c by Cetin Kaya Koc, Funda Ozdemir, Zeynep Odemis Ozger.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a x, 146 p. : $b ill., digital ; $c 24 cm.
505 0 $a Introduction -- Mathematical Background -- Rivest-Shamir-Adleman Algorithm -- Goldwasser-Micali Algorithm -- ElGamal Algorithm -- Benaloh Algorithm -- Naccache-Stern Algorithm -- Okamoto-Uchiyama Algorithm -- Paillier Algorithm -- Damgard-Jurik Algorithm -- Boneh-Goh-Nissim Algorithm -- Sander-Young-Yung Algorithm -- Bibliography -- Index.
520 $a This monograph describes and implements partially homomorphic encryption functions using a unified notation. After introducing the appropriate mathematical background, the authors offer a systematic examination of the following known algorithms: Rivest-Shamir-Adleman; Goldwasser-Micali; ElGamal; Benaloh; Naccache-Stern; Okamoto-Uchiyama; Paillier; Damgaard-Jurik; Boneh-Goh-Nissim; and Sander-Young-Yung. Over recent years partially and fully homomorphic encryption algorithms have been proposed and researchers have addressed issues related to their formulation, arithmetic, efficiency and security. Formidable efficiency barriers remain, but we now have a variety of algorithms that can be applied to various private computation problems in healthcare, finance and national security, and studying these functions may help us to understand the difficulties ahead. The book is valuable for researchers and graduate students in Computer Science, Engineering, and Mathematics who are engaged with Cryptology.
650 0 $a Cryptography. $3 532586
650 0 $a Homomorphisms (Mathematics) $3 726510
650 1 4 $a Cryptology. $3 3382308
650 2 4 $a Systems and Data Security. $3 898223
650 2 4 $a Number Theory. $3 891078
700 1 $a Ozdemir, Funda. $3 3517871
700 1 $a Odemis Ozger, Zeynep. $3 3517872
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-3-030-87629-6
950 $a Computer Science (SpringerNature-11645)