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.
Rezensionen / Stimmen
"This book shows that it is always enjoyable to learn interesting algorithms and their underlying beautiful mathematics." (Ioan Tomescu, zbMATH 0741.4774, 2021)
Auflage
Sprache
Verlagsort
Verlagsgruppe
Springer International Publishing
Zielgruppe
Illustrationen
Maße
Höhe: 235 mm
Breite: 155 mm
Dicke: 9 mm
Gewicht
ISBN-13
978-3-030-87631-9 (9783030876319)
DOI
10.1007/978-3-030-87629-6
Schweitzer Klassifikation
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.
