scispace - formally typeset
Proceedings ArticleDOI

Cloud-user security based on RSA and MD5 algorithm for resource attestation and sharing in java environment

TLDR
A new cloud computing environment where a trusted cloud environment which is controlled by both the client and the cloud environment admin is proposed, which provides a two way security protocol which helps both the cloud and the normal user.
Abstract
The increased degree of connectivity and the increasing amount of data has led many providers and in particular data centers to employ larger infrastructures with dynamic load and access balancing. This lead to the demand of cloud computing. But there are some security concerns when we handle and share data in the cloud computing environment. In this paper we propose a new cloud computing environment where we approach a trusted cloud environment which is controlled by both the client and the cloud environment admin. Our approach is mainly divided into two parts. First part is controlled by the normal user which gets permission by the cloud environment for performing operation and for loading data. Second part shows a secure trusted computing for the cloud, if the admin of the cloud want to read and update the data then it take permission from the client environment. This provides a way to hide the data and normal user and can protect their data from the cloud provider. This provides a two way security protocol which helps both the cloud and the normal user. For the above concept we apply RSA and MD 5 algorithm. When the cloud user upload the data in the cloud environment, the data is uploaded in encrypted form using RSA algorithm and the cloud admin can decrypt using their own private key. For updating the data in the cloud environment admin request the user for a secure key. Cloud user sends a secure key with a message digest tag for updating data. If any outsiders perform a change in the key, the tag bit is also changed indicating the key is not secure and correct.

read more

Citations
More filters
Posted Content

PORs: Proofs of Retrievability for Large Files

TL;DR: This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.
Book ChapterDOI

Efficient Data Security Using Hybrid Cryptography on Cloud Computing

TL;DR: The performance of the hybrid system is compared with the existing hybrid method and shows that the proposed method provides high security and confidentiality of patient data.
Proceedings ArticleDOI

Modified RSA cryptosystem based on offline storage and prime number

TL;DR: A new algorithm concept is suggested to presents the modified form of RSA algorithm in order to speed up the implementation of RSAgorithm during data exchange across the network through the use of third prime number.
Proceedings ArticleDOI

Data security in cloud using RSA

TL;DR: A method for providing data storage and security in cloud using public key cryptosystem RSA is proposed and the security services includes key generation, encryption and decryption in virtual environment.
Posted Content

Data Security in Cloud Architecture Based on Diffie Hellman and Elliptical Curve Cryptography.

TL;DR: A design for cloud architecture which ensures secured movement of data at client and server end and uses the non breakability of Elliptic curve cryptography for data encryption and Diffie Hellman Key Exchange mechanism for connection establishment.
References
More filters
Proceedings ArticleDOI

Provable data possession at untrusted stores

TL;DR: The provable data possession (PDP) model as discussed by the authors allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it.
Posted Content

Provable Data Possession at Untrusted Stores.

TL;DR: Ateniese et al. as discussed by the authors introduced the provable data possession (PDP) model, which allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it.
Posted Content

PORs: Proofs of Retrievability for Large Files

TL;DR: This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.
Proceedings ArticleDOI

Pors: proofs of retrievability for large files

TL;DR: In this article, the authors define and explore proofs of retrievability (PORs), which are a kind of cryptographic proof of knowledge (POK) that enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.
Book ChapterDOI

Compact Proofs of Retrievability

TL;DR: The first proof-of-retrievability schemes with full proofs of security against arbitrary adversaries in the strongest model, that of Juels and Kaliski, are given.