Partially Homomorphic Encryption
Seiten
2021
|
1st ed. 2021
Springer International Publishing (Verlag)
978-3-030-87628-9 (ISBN)
Springer International Publishing (Verlag)
978-3-030-87628-9 (ISBN)
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.
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.
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 book shows that it is always enjoyable to learn interesting algorithms and their underlying beautiful mathematics." (Ioan Tomescu, zbMATH 0741.4774, 2021)
“This book shows that it is always enjoyable to learn interesting algorithms and their underlying beautiful mathematics.” (Ioan Tomescu, zbMATH 0741.4774, 2021)
| Erscheinungsdatum | 28.10.2021 |
|---|---|
| Zusatzinfo | X, 146 p. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 391 g |
| Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
| Schlagworte | Cryptology • Elliptic Curves • Field Theory • group theory • homomorphic encryption • Number Theory |
| ISBN-10 | 3-030-87628-4 / 3030876284 |
| ISBN-13 | 978-3-030-87628-9 / 9783030876289 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Geschichte, Techniken, Anwendungen
Buch | Softcover (2022)
C.H.Beck (Verlag)
CHF 13,90
Die faszinierende Geschichte der Verschlüsselung
Buch | Softcover (2022)
Springer (Verlag)
CHF 48,95
