Loading…
Secure and efficient online data storage and sharing over cloud environment using probabilistic with homomorphic encryption
Cloud computing is one of the great tasks in the business world nowadays, which provides shared processing resources. In cloud area network, security is the main challenge faced by cloud providers and their customers. The advantage of cloud computing includes reduced cost, re-provisioning of resourc...
Saved in:
Published in: | Cluster computing 2017-06, Vol.20 (2), p.1561-1573 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Cloud computing is one of the great tasks in the business world nowadays, which provides shared processing resources. In cloud area network, security is the main challenge faced by cloud providers and their customers. The advantage of cloud computing includes reduced cost, re-provisioning of resources etc. The cloud network makes use of standard encryption method to secure documents while storing in online. In this paper, we have depicted two efficient encryption algorithms that meet security demand in cloud. Probabilistic encryption, one of these algorithms may be used to produce randomness of text encryption. With this algorithm, if the same message is encrypted twice it should yield different secret coded texts on both calculations. Another crucial algorithm is homomorphic encryption, is a cryptographic method to define the sample system and to provide a software implementation. In order to maintain quality of service (QoS) and improve customer satisfaction, we are going to propose an efficient algorithm which combines the characteristics of both probabilistic and homomorphic encryption techniques, to provide high level of security. Our proposed scheme will yield better encryption techniques reduce security attacks, increased throughput and improve the QoS. |
---|---|
ISSN: | 1386-7857 1573-7543 |
DOI: | 10.1007/s10586-017-0809-4 |