Partially Homomorphic Encryption
Autor Çetin Kaya Koç, Funda Özdemir, Zeynep Ödemiş Özgeren Limba Engleză Paperback – oct 2022
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.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 758.98 lei 6-8 săpt. | |
| Springer International Publishing – oct 2022 | 758.98 lei 6-8 săpt. | |
| Hardback (1) | 764.70 lei 6-8 săpt. | |
| Springer International Publishing – 30 sep 2021 | 764.70 lei 6-8 săpt. |
Preț: 758.98 lei
Preț vechi: 925.59 lei
-18% Nou
Puncte Express: 1138
Preț estimativ în valută:
145.27€ • 152.40$ • 120.51£
145.27€ • 152.40$ • 120.51£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030876319
ISBN-10: 3030876314
Pagini: 146
Ilustrații: X, 146 p.
Dimensiuni: 155 x 235 mm
Greutate: 0.23 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3030876314
Pagini: 146
Ilustrații: X, 146 p.
Dimensiuni: 155 x 235 mm
Greutate: 0.23 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
Cuprins
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.
Recenzii
“This book shows that it is always enjoyable to learn interesting algorithms and their underlying beautiful mathematics.” (Ioan Tomescu, zbMATH 0741.4774, 2021)
Textul de pe ultima copertă
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.
Caracteristici
Applies a unified mathematical notation Algorithms can be applied to private computation problems in healthcare, finance and national security Researchers have addressed issues related to these algorithms' formulation, arithmetic, efficiency and security