Partially Homomorphic Encryption (Hardcover, 1st ed. 2021)

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.

General

Imprint:	Springer Nature Switzerland AG
Country of origin:	Switzerland
Release date:	September 2021
First published:	2021
Authors:	Cetin Kaya Koc • Funda OEzdemir • Zeynep OEdemis OEzger
Dimensions:	235 x 155mm (L x W)
Format:	Hardcover
Pages:	146
Edition:	1st ed. 2021
ISBN-13:	978-3-03-087628-9
Categories:	Books > Reference & Interdisciplinary > Communication studies > Coding theory & cryptology Books > Computing & IT > Computer communications & networking > Network security Books > Science & Mathematics > Mathematics > Number theory > General Books > Computing & IT > Applications of computing > Databases > Data security & data encryption Promotions
LSN:	3-03-087628-4
Barcode:	9783030876289

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!