國立虎尾科技大學 |

Partially Homomorphic Encryption

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Partially Homomorphic Encryption/ by Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger.
Author:	Koç, Çetin Kaya.
other author:	Özdemir, Funda.
Description:	X, 146 p.online resource. :
Contained By:	Springer Nature eBook
Subject:	Data encryption (Computer science). -
Online resource:	https://doi.org/10.1007/978-3-030-87629-6
ISBN:	9783030876296

Partially Homomorphic Encryption
Koç, Çetin Kaya.

Partially Homomorphic Encryption[electronic resource] /by Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger. - 1st ed. 2021. - X, 146 p.online resource.

Introduction -- Mathematical Background -- Rivest-Shamir-Adleman Algorithm -- Goldwasser-Micali Algorithm -- ElGamal Algorithm -- Benaloh Algorithm -- Naccache-Stern Algorithm -- Okamoto-Uchiyama Algorithm -- Paillier Algorithm -- Damgård-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:

1051084
Data encryption (Computer science).

LC Class. No.: QA76.9.D335

Dewey Class. No.: 005.82

Partially Homomorphic Encryption
LDR:02709nam a22004095i 4500 001 1054077
003 DE-He213
005 20210929203411.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030876296 $9 978-3-030-87629-6
024 7 $a 10.1007/978-3-030-87629-6 $2 doi
035 $a 978-3-030-87629-6
050 4 $a QA76.9.D335
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.82 $2 23
100 1 $a Koç, Çetin Kaya. $e editor. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1258339
245 1 0 $a Partially Homomorphic Encryption $h [electronic resource] / $c by Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a X, 146 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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 -- Damgård-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 Data encryption (Computer science). $3 1051084
650 0 $a Computer security. $3 557122
650 0 $a Number theory. $3 527883
650 1 4 $a Cryptology. $3 1211076
650 2 4 $a Systems and Data Security. $3 677062
650 2 4 $a Number Theory. $3 672023
700 1 $a Özdemir, Funda. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1359049
700 1 $a Ödemiş Özger, Zeynep. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1359050
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030876289
776 0 8 $i Printed edition: $z 9783030876302
776 0 8 $i Printed edition: $z 9783030876319
856 4 0 $u https://doi.org/10.1007/978-3-030-87629-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)