Koç / Özdemir / Ödemis Özger Partially Homomorphic Encryption

1. Auflage 2021
ISBN: 978-3-030-87629-6
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 146 Seiten, eBook

Reihe: Computer Science (R0)

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.

Zielgruppe

Research

Autoren/Hrsg.

Koç, Çetin Kaya

Özdemir, Funda

Ödemis Özger, Zeynep

Inhaltsverzeichnis

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.