A Noval Approach Key Aggregate Cryptosystem for Resizable Data Sharing in Cloud Storage

gigantic research has been done on Cloud computing security and a large number of papers have been published on this topic during the last few decades. Very few worked on Secured data sharing in cloud storage using Key Aggregate Approach. In the new technology of cloud computing platform introduces the distributed cloud resources. This Paper explains how to securely, distribute the data with others in cloud in [1]. This Paper gives a public key cryptosystem, which produces constant size Cipher texts [1]. In this paper implemented the new methods how efficiently shares the data with others in Cloud storage [2][6]. The proposed Approach gives the new techniques for Aggregate Key Cryptosystem for Resizable data on cloud storage [1]. Keywords— Public Key Encryption, Proposed Key Aggregate System. Introduction Cloud computing (CC) has grew a lot of attention in current years as cloud computing is characterized as a style of computing abilities delivered and utilizing the internet technology [1]. Cloud computing basically stores all cloud computing app and databases which are put at Remote areas. Because of this development of software, data and services are not trustworthy. Hence, this leads to challenges like virtualization vulnerabilities, availability vulnerabilities. Cloud computing is Internet positioned cultivation and use of computer technology. It is an approach of computing in which dynamically [1] scalable and often resources are provided as a service over the Internet. The actual term "cloud" borrows from telephony in that telecommunications companies, Cloud service provider offering “(VPN)” services at a lower cost. Cloud computing is a better way to run your business. They run on a shared data center instead of running your apps yourself. Any user are able to access information from anywhere [3][6] and at any time instead of having to use dedicated machine [3] [4]. METHODS Cryptanalysis Key for Hierarchical Approach We take the tree structure Alice can first classify the cipher text classes like Figure 3. Each node in the tree represents a secret key [1], while the leaf nodes represents the keys for individual cipher[1] text classes [1][2]. Black circles represent the keys for the classes to be delegated [2] and circles circumvented by dotted lines [1] represent the keys to be granted. Fig 2.1 Cryptographic Keys for Predefined Hierarchy In Figure 3(a), if Alice wants to share files in the “personal” category [1][2], she needs to grant the key for the node personal category [2], which automatically grants the delegate [4] the keys of all the descendant nodes(photo and music)[1]. This is the ideal case, where most classes to be shared [6] belong to the parent key of them is sufficient. However, As shown in Figure 3(b), if Alice shares her demo music at work (work→casual→demo and work→confidential→demo) in [1] [3] who also has the rights to see some of her personal data, which leads to an increase in the total key size [3]. This approach is not flexible when the classifications [5] are more complex and she share different sets of files to different people [6]. On average, the number of keys increases with the number of branches. Symmetric Key Cryptography Benaloh proposed an encryption scheme, where a huge number of keys can be sent rapidly. The Procedure is as follows. Initially pick two prime [6] numbers p and q for a module. Master secret key will be chosen and prime International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 02 Issue: 07 | Oct-2015 www.irjet. net p-ISSN: 2395-0072 © 2015, IRJET ISO 9001:2008 Certified Journal Page 509 numbers will be allied with the class. The outcome of this is a constant size key. So here the sender should encrypt files with secret keys [2] which will not be feasible.