INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE
www.ijrrecs.com 3699 | P a g e
IMPLEMENTATION OF RESPONSIBLE DATA STORAGE IN
CONSISTENT CLOUD ENVIRONMENT
Mantesh Patil
1,
S.Gayathri Devi
21M.Tech Student, Dept of CSE, RRS College of Engineering & Technology, Muthangi (V), Patancheru (M), Hyderabad, T.S, India
2Assistant Professor, Dept of CSE, RRS College of Engineering & Technology, Muthangi (V), Patancheru (M), Hyderabad, T.S, India
ABSTRACT:
Data robustness is considered as most important obligation for storage systems and there are numerous schemes of storing data above storage servers. In our work a cloud storage system was considered which consists of storage servers as well as key servers. Decentralized erasure code is erasure code that separately works out every codeword symbol for a message. An additional significant functionality in relation to cloud storage is function of reliability checking. A decentralized structural design for storage systems put forward superior scalability, since a storage server can connect or leave devoid of managing of a central ability. By means of threshold proxy re-encryption system, protected cloud storage system was put forward that provide protected data storage as well as protected data forwarding functionality in a decentralized construction. Even though for the most part of proxy re-encryption systems employ pairing procedures, there exist proxy re-encryption systems devoid of pairing. A protected cloud storage scheme involves that an unlawful user or else server cannot obtain substance of stored messages, and a storage server cannot produce encryption keys by himself. Proxy re-encryption systems considerably diminish overhead of data forwarding function in protected storage system. We employ a threshold proxy re-encryption system through multiplicative homomorphic assets.
Keywords: Data robustness, Erasure code, Proxy re-encryption, Cloud storage, Data storage, Homomorphic.
www.ijrrecs.com 3700 | P a g e
1. INTRODUCTION:
Cloud computing is a notion which considers resources on Internet as a combined entity, a cloud. To make available well-built secrecy for messages within storage servers, a user encrypts messages by means of cryptographic means earlier than applying an erasure code process to programme and stock up messages. As storing cryptographic keys in a particular device is unsafe, a user allocate cryptographic key towards key servers that shall carry out cryptographic utility in aid of user. The fixed incorporation of encoding, encryption, as well as forwarding build storage system resourcefully meets up needs of data strength, data privacy, as well as data forwarding. Accomplishing incorporation with consideration of a dispersed construction is demanding. In our work we tackle difficulty of forwarding data to an additional user by means of storage servers unswervingly under command of data owner. System representation that consists of dispersed storage servers as well as key servers was considered. In our work a cloud storage system was considered which consists of storage servers as well as key servers[1]. We put together a lately computation cost of each algorithm in
protected Cloud Storage System projected threshold proxy re-encryption method and erasure codes above exponents. The threshold proxy reencryption system sustains encoding, forwarding, as well as partial decryption operations in a dispersed means. By means of threshold proxy re-encryption system, protected cloud storage system was put forward that provide protected data storage as well as protected data forwarding functionality in a decentralized construction. Each storage server autonomously carries out encoding as well as re-encryption and each key server separately carries out partial decryption.
2. METHODOLOGY:
Data robustness is considered as most important obligation for storage systems and there are numerous schemes of storing data above storage servers. One means to make available data toughness is to imitate a message such that every storage server accumulates a copy of message. Decentralized erasure code is erasure code that separately works out every codeword symbol for a message. Encoding procedure for a message can be dividing into analogous tasks of making codeword symbols. A decentralized erasure code is
www.ijrrecs.com 3701 | P a g e appropriate for employment in dispersed
storage system. Subsequent to the message symbols are sending towards storage servers, every storage server autonomously works out a codeword symbol for received message symbols and accumulates it. Towards fitting distributed arrangement of systems, we necessitate that servers separately carry out all operations[2][3]. We put forward a novel threshold proxy re-encryption system and put together it by means of a secure decentralized code to outline a protected dispersed storage system. The encryption system supports encoding process above encrypted messages as well as forwarding operations above encrypted as well as encoded messages. An overview of storage model was shown in fig1. Our storage scheme as well as several recently projected content addressable file schemes is extremely attuned. Storage servers executes as nodes within content addressable scheme for accumulating content addressable blocks. By threshold proxy re-encryption system, protected cloud storage system was put forward that provide protected data storage as well as protected data forwarding functionality in a decentralized construction[4]. Our key servers take action as access nodes in support of offering a
front-end layer for instance established file system interface.
3. AN OVERVIEW OF PROXY RE-ENCRYPTION SYSTEM:
A decentralized structural design for storage systems put forward superior scalability, since a storage server can connect or leave devoid of managing of a central ability. To make available toughness against server failures, an easy means is to build replicas of every message and accumulates them in dissimilar servers. An additional significant functionality in relation to cloud storage is function of reliability checking. Subsequent to a user accumulates data into storage system, he no longer acquire data at hand. The conception of verifiable data possession as well as conception of proof of storage is projected. In proxy re-encryption scheme, a server transmits a cipher text in unrestricted key towards a new one under an additional public key by means of re-encryption key. Type-based proxy re-encryption systems projected make available a superior granularity on approved right of are-encryption key. Even though for the most part of proxy re-encryption systems employ pairing procedures, there exist proxy re-encryption systems devoid of pairing. A
www.ijrrecs.com 3702 | P a g e protected cloud storage scheme involves that
an unlawful user or else server cannot obtain substance of stored messages, and a storage server cannot produce re-encryption keys by himself. Proxy re-encryption systems can considerably reduce communication as well as computation cost of possessor. In a proxy re-encryption scheme, possessor conveys a re-encryption key towards storage servers with the intention that servers achieve encryption process for him. The communication expenditure of owner is autonomous of extent of forwarded message and computation expenditure of re-encryption is taken concern by storage servers. Proxy re-encryption systems considerably diminish overhead of data forwarding function in protected storage system. We employ a threshold proxy re-encryption system through multiplicative homomorphic assets[5]. An encryption system is multiplicative homomorphic if it maintains a group procedure ʘ on encrypted plaintexts devoid of decryption hence a multiplicative homomorphic encryption system hold up encoding operation above encrypted messages. We subsequently transfer a proxy re-encryption system by means of multiplicative homomorphic property into a threshold version. The data
privacy of cloud storage system is assured even if the entire storage servers, nontarget users are compromised by means of attacker[6].
Fig1: An overview of storage model.
4. CONCLUSION:
The fixed incorporation of encoding, encryption, as well as forwarding build storage system resourcefully meets up needs of data strength, data privacy, as well as data forwarding. In our work we tackle difficulty of forwarding data to an additional user by means of storage servers unswervingly under command of data owner. Decentralized erasure code is erasure code that separately works out every codeword symbol for a message. A decentralized structural design for storage systems put forward superior scalability, since a storage server can connect or leave devoid of managing of a central ability. The threshold proxy reencryption system sustains encoding, forwarding, as well as partial decryption operations in a dispersed means.
www.ijrrecs.com 3703 | P a g e We put forward a novel threshold proxy
re-encryption system and put together it by means of a secure decentralized code to outline a protected dispersed storage system. Our storage scheme as well as several recently projected content addressable file schemes is extremely attuned. System representation that consists of dispersed storage servers as well as key servers was considered. In proxy re-encryption scheme, a server transmits a cipher text in unrestricted key towards a new one under an additional public key by means of re-encryption key. A protected cloud storage scheme involves that an unlawful user or else server cannot obtain substance of stored messages, and a storage server cannot produce re-encryption keys by himself. The data privacy of cloud storage system is assured even if the entire storage servers, non-target users are compromised by means of attacker.
REFERENCES
[1] G. Ateniese, K. Benson, and S. Hohenberger, “Key-Private Proxy Re-Encryption,” Proc. Topics in Cryptology (CT-RSA), pp. 279-294, 2009.
[2] J. Shao and Z. Cao, “CCA-Secure Proxy Re-Encryption without Pairings,” Proc. 12th Int’l Conf. Practice and Theory in Public Key Cryptography (PKC), pp. 357-376, 2009.
[3] G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable Data Possession at Untrusted Stores,” Proc. 14th ACM Conf. Computer and Comm. Security (CCS), pp. 598-609, 2007.
[4] G. Ateniese, R.D. Pietro, L.V. Mancini, and G. Tsudik, “Scalable and Efficient Provable Data Possession,” Proc. Fourth Int’l Conf. Security and Privacy in Comm. Netowrks (SecureComm), pp. 1-10, 2008.
[5] H. Shacham and B. Waters, “Compact Proofs of Retrievability,” Proc. 14th Int’l Conf. Theory and Application of Cryptology and Information Security (ASIACRYPT), pp. 90-107, 2008.
[6] G. Ateniese, S. Kamara, and J. Katz, “Proofs of Storage from Homomorphic Identification Protocols,” Proc. 15th Int’l Conf. Theory and Application of Cryptology and Information Security (ASIACRYPT), pp. 319-333, 2009.
