IMPLEMENTATION OF RESPONSIBLE DATA STORAGE IN CONSISTENT CLOUD ENVIRONMENT

Transcription

1 IJRRECS/November 2014/Volume-2/Issue-11/ ISSN INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE IMPLEMENTATION OF RESPONSIBLE DATA STORAGE IN CONSISTENT CLOUD ENVIRONMENT Mantesh Patil 1, S.Gayathri Devi 2 1 M.Tech Student, Dept of CSE, RRS College of Engineering & Technology, Muthangi (V), Patancheru (M), Hyderabad, T.S, India 2 Assistant 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 re-encryption keys by himself. Proxy reencryption 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 P a g e

2 1. INTRODUCTION: protected Cloud Storage System projected threshold proxy re-encryption method and Cloud computing is a notion which erasure codes above exponents. The considers resources on Internet as a threshold proxy reencryption system combined entity, a cloud. To make available sustains encoding, forwarding, as well as well-built secrecy for messages within partial decryption operations in a dispersed storage servers, a user encrypts messages by means. By means of threshold proxy reencryption system, protected cloud storage means of cryptographic means earlier than applying an erasure code process to system was put forward that provide programme and stock up messages. As protected data storage as well as protected storing cryptographic keys in a particular data forwarding functionality in a device is unsafe, a user allocate decentralized construction. Each storage cryptographic key towards key servers that server autonomously carries out encoding as shall carry out cryptographic utility in aid of well as re-encryption and each key server user. The fixed incorporation of encoding, separately carries out partial decryption. encryption, as well as forwarding build storage system resourcefully meets up needs 2. METHODOLOGY: of data strength, data privacy, as well as data Data robustness is considered as most forwarding. Accomplishing incorporation important obligation for storage systems and with consideration of a dispersed there are numerous schemes of storing data construction is demanding. In our work we above storage servers. One means to make tackle difficulty of forwarding data to an available data toughness is to imitate a additional user by means of storage servers message such that every storage server unswervingly under command of data accumulates a copy of message. owner. System representation that consists Decentralized erasure code is erasure code of dispersed storage servers as well as key that separately works out every codeword servers was considered. In our work a cloud symbol for a message. Encoding procedure storage system was considered which for a message can be dividing into consists of storage servers as well as key analogous tasks of making codeword servers[1]. We put together a lately symbols. A decentralized erasure code is computation cost of each algorithm in 3700 P a g e

3 appropriate for employment in dispersed storage system. Subsequent to the message front-end layer for instance established file system interface. symbols are sending towards storage servers, every storage server autonomously works out a codeword symbol for received 3. AN OVERVIEW OF PROXY RE- ENCRYPTION SYSTEM: message symbols and accumulates it. A decentralized structural design for storage Towards fitting distributed arrangement of systems put forward superior scalability, systems, we necessitate that servers since a storage server can connect or leave separately carry out all operations[2][3]. We devoid of managing of a central ability. To put forward a novel threshold proxy reencryption system and put together it by make available toughness against server failures, an easy means is to build replicas of means of a secure decentralized code to every message and accumulates them in outline a protected dispersed storage system. dissimilar servers. An additional significant The encryption system supports encoding functionality in relation to cloud storage is process above encrypted messages as well as function of reliability checking. Subsequent forwarding operations above encrypted as to a user accumulates data into storage well as encoded messages. An overview of system, he no longer acquire data at hand. storage model was shown in fig1. Our The conception of verifiable data possession storage scheme as well as several recently as well as conception of proof of storage is projected content addressable file schemes is projected. In proxy re-encryption scheme, a extremely attuned. Storage servers executes server transmits a cipher text in unrestricted as nodes within content addressable scheme key towards a new one under an additional for accumulating content addressable public key by means of re-encryption key. blocks. By threshold proxy re-encryption Type-based proxy re-encryption systems system, protected cloud storage system was projected make available a superior put forward that provide protected data granularity on approved right of areencryption key. Even though for the most storage as well as protected data forwarding functionality in a decentralized part of proxy re-encryption systems employ construction[4]. Our key servers take action pairing procedures, there exist proxy reencryption systems devoid of pairing. A as access nodes in support of offering a 3701 P a g e

4 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 reencryption 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 reencryption 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 P a g e

5 We put forward a novel threshold proxy reencryption 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 reencryption 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. [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 , [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, [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 , [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 , REFERENCES [1] G. Ateniese, K. Benson, and S. Hohenberger, Key-Private Proxy Re-Encryption, Proc. Topics in Cryptology (CT-RSA), pp , [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 , P a g e