Theory and Practice of Cryptography and Network Security Protocols and Technologies 2013
DOI: 10.5772/56687
|View full text |Cite
|
Sign up to set email alerts
|

Homomorphic Encryption — Theory and Application

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
15
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 39 publications
(15 citation statements)
references
References 121 publications
0
15
0
Order By: Relevance
“…If the plaintext space P is an additive group, the homomorphic cryptosystem is known as additive homomorphism. Likewise, if the plaintext space is a multiplicative group, that homomorphic cryptosystem is considered as multiplicative homomorphism [29,41].…”
Section: Definition Of a Homomorphic Encryption (He) Scheme Andhomomomentioning
confidence: 99%
See 2 more Smart Citations
“…If the plaintext space P is an additive group, the homomorphic cryptosystem is known as additive homomorphism. Likewise, if the plaintext space is a multiplicative group, that homomorphic cryptosystem is considered as multiplicative homomorphism [29,41].…”
Section: Definition Of a Homomorphic Encryption (He) Scheme Andhomomomentioning
confidence: 99%
“…Evidently, the limitation on the range of operations has limited PHE schemes from being accepted as solutions for Big Data outsourced computation [29,41]. A few researchers have attempted to improve the versatility of existing PHE schemes.…”
Section: Partial Homomorphic Encryption (Phe)mentioning
confidence: 99%
See 1 more Smart Citation
“…For instant, having any knowledge about the ciphertext can threaten the security of the scheme. Moreover, most of the schemes where proven to be secure under a model called random oracle model; which is an idealized model that tests the schemes under unrealistic assumptions, and so doesn't fully assess the scheme's practicality [28]. Paillier scheme has proven security against indistinguishable chosen plain text attack (IND-CPA).…”
Section: Paillier Security Analysismentioning
confidence: 99%
“…Any Homomorphic schemes consists of four algorithms. Key generation, encryption, decryption and homomorphic property [28]. Homomorphic property can be divided into two types, additive and multiplicative.…”
Section: Conventional Data Integrity Using Homomorphic Encryption Algmentioning
confidence: 99%