Homomorphic Encryption Schemes: A Survey

Homomorphic Encryption Schemes: A Survey

Kannan Balasubramanian (Mepco Schlenk Engineering College, India) and Jayanthi Mathanan (Mepco Schlenk Engineering College, India)
DOI: 10.4018/978-1-5225-2915-6.ch008
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Homomorphic encryption is a technique that enables mathematical operations to be performed on encrypted data. This type of encryption can be used to perform operations on encrypted data by a server without having to provide the key. An example application is searching or querying an encrypted database. The encryption schemes are classified as additive or multiplicative homomorphic if they support addition or multiplication on encrypted data. The Cryptosystems are classified as fully homomorphic, partially homomorphic or somewhat homomorphic based on the type and number of operations supported on the ciphertext.
Chapter Preview
Top

Partially Homomorphic Cryptosystems

In the following examples, the notation є(x) is used to denote the encryption of the message x.

Complete Chapter List

Search this Book:
Reset