000 | 03362nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-030-87629-6 | ||
003 | DE-He213 | ||
005 | 20240423125405.0 | ||
007 | cr nn 008mamaa | ||
008 | 210929s2021 sz | s |||| 0|eng d | ||
020 |
_a9783030876296 _9978-3-030-87629-6 |
||
024 | 7 |
_a10.1007/978-3-030-87629-6 _2doi |
|
050 | 4 | _aQA268 | |
072 | 7 |
_aGPJ _2bicssc |
|
072 | 7 |
_aURY _2bicssc |
|
072 | 7 |
_aCOM083000 _2bisacsh |
|
072 | 7 |
_aGPJ _2thema |
|
072 | 7 |
_aURY _2thema |
|
082 | 0 | 4 |
_a005.824 _223 |
100 | 1 |
_aKoç, Çetin Kaya. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aPartially Homomorphic Encryption _h[electronic resource] / _cby Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özger. |
250 | _a1st ed. 2021. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021. |
|
300 |
_aX, 146 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
505 | 0 | _aIntroduction -- 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 | _aThis 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 | _aCryptography. | |
650 | 0 | _aData encryption (Computer science). | |
650 | 0 | _aData protection. | |
650 | 0 | _aNumber theory. | |
650 | 1 | 4 | _aCryptology. |
650 | 2 | 4 | _aData and Information Security. |
650 | 2 | 4 | _aNumber Theory. |
700 | 1 |
_aÖzdemir, Funda. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
700 | 1 |
_aÖdemiş Özger, Zeynep. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030876289 |
776 | 0 | 8 |
_iPrinted edition: _z9783030876302 |
776 | 0 | 8 |
_iPrinted edition: _z9783030876319 |
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-87629-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
942 | _cSPRINGER | ||
999 |
_c177413 _d177413 |