國立高雄大學圖資館 |

Language: English

Back

Partially homomorphic encryption

Koc, Cetin Kaya.

Partially homomorphic encryption

Record Type:	Electronic resources : Monograph/item
Title/Author:	Partially homomorphic encryptionby Cetin Kaya Koc, Funda Ozdemir, Zeynep Odemis Ozger.
Author:	Koc, Cetin Kaya.
other author:	Ozdemir, Funda.
Published:	Cham :Springer International Publishing :2021.
Description:	x, 146 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Cryptography.
Online resource:	https://doi.org/10.1007/978-3-030-87629-6
ISBN:	9783030876296$q(electronic bk.)

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$q(electronic bk.)

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

189522
Cryptography.

LC Class. No.: QA268

Dewey Class. No.: 005.824

Partially homomorphic encryption
LDR:02346nmm a2200337 a 4500 001 609334
003 DE-He213
005 20210929203411.0
006 m d
007 cr nn 008maaau
008 220222s2021 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 338656
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 189522
650 0 $a Homomorphisms (Mathematics) $3 189531
650 1 4 $a Cryptology. $3 825728
650 2 4 $a Systems and Data Security. $3 274481
650 2 4 $a Number Theory. $3 274059
700 1 $a Ozdemir, Funda. $3 906896
700 1 $a Odemis Ozger, Zeynep. $3 906897
710 2 $a SpringerLink (Online service) $3 273601
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)