2015 International Conference on Information Technology (ICIT) 2015
DOI: 10.1109/icit.2015.39
|View full text |Cite
|
Sign up to set email alerts
|

Homomorphic Encryption for Data Security in Cloud Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(7 citation statements)
references
References 10 publications
0
4
0
Order By: Relevance
“…RSA was chosen because it is more efficient than other PHEs [68][69][70]. The homomorphic property of RSA [62][63][64][65][66], which was preferred as Pa this study, was introduced later by Rivest, Adleman, and Dertouzous using th vacy homomorphism" [67], which was an early example of PHE. The RSA volves four algorithms as follows:…”
Section: Rsa-partial Homomorphic Encryptionmentioning
confidence: 99%
“…RSA was chosen because it is more efficient than other PHEs [68][69][70]. The homomorphic property of RSA [62][63][64][65][66], which was preferred as Pa this study, was introduced later by Rivest, Adleman, and Dertouzous using th vacy homomorphism" [67], which was an early example of PHE. The RSA volves four algorithms as follows:…”
Section: Rsa-partial Homomorphic Encryptionmentioning
confidence: 99%
“…In this method for each user will generate pair of keys public key (pk) that can be published and distributed to the rest of the parties and the private key (sk) that remains secret and cannot published. When a message is sent from the party Bob to the party Alice, the message will be encrypted with Alice's public key and then sent as an encrypted message and when it arrives to Alice, he uses his private key that corresponding to the public key to decrypt it [19,23]. Algorithm 2 describe Paillier algorithm [23,24].…”
Section: Paillier Algorithmmentioning
confidence: 99%
“…When a message is sent from the party Bob to the party Alice, the message will be encrypted with Alice's public key and then sent as an encrypted message and when it arrives to Alice, he uses his private key that corresponding to the public key to decrypt it [19,23]. Algorithm 2 describe Paillier algorithm [23,24]. Chose two large prime numbers p and q randomly and independently of each other 2.…”
Section: Paillier Algorithmmentioning
confidence: 99%
“…The multiplication of two ciphertexts will give the addition of their corresponding plain texts when deciphered [2],…”
Section: Homomorphic Addition On Plaintextmentioning
confidence: 99%