An Efficient Scalable Data Sharing In Cloud Storage Using Key

k koteswara chari, M krishna


In Cloud Computing data sharing and security is important functionality. We describe public key encryption .efficient delegation of decryption which of stable size of cipher text is to possible. The new thing is that one can any aggregate set of secrete keys and make them compact as a

single key. That can encompass the power of all keys aggregated. The new produced Aggregated Key can be send via email or mobile OTP or small memory storage device to the client. Ensuring the security of cloud computing is second major factor and dealing with because of service availability failure the “single cloud” providers demonstrated less famous failure and possibility malicious insiders in the single cloud. A movement towards “Multi-Clouds”, In other words "Inter-Clouds" or "Cloud-Of-Clouds" as emerged recently. This works aim to reduce security risk and better flexibility and efficiency to the user. New public–key encryption which is called as Keyaggregate cryptosystem (KAC) is presented. Key-total cryptosystem produce consistent size ciphertexts such that productive assignment of unscrambling rights for any arrangement of ciphertext are conceivable. Any arrangement of mystery keys can be amassed and make them as single key, which envelops force of the considerable number of keys being accumulated. This total key can be sent to the others for decoding of ciphertext set and staying scrambled documents outside the set are stays classified.


Cloud storage, data sharing, key-aggregate encryption, Public Key Encryption.


Cheng-Kang Chu ,Chow, S.S.M, Wen-GueyTzeng, Jianying Zhou, and Robert H. Deng , ― Key-Aggregate Cryptosystem forScalable Data Sharing in Cloud Storage‖ , IEEE Transactions on Parallel and Distributed Systems. Volume: 2 5, Issue: 2. Year :2014.

J. Benaloh, M. Chase, E. Horvitz, and K. Lauter, ―Patient Controlled Encryption: Ensuring Privacy of Electronic Medical Records,‖ in Proceedings of ACM Workshop on Cloud Computing Security (CCSW ’09). ACM, 2009, pp. 103–114

J. Benaloh, ―Key Compression and Its Application to Digital Fingerprinting,‖ Microsoft Research, Tech. Rep., 2009.

B. Alomair and R. Poovendran, ―Information Theoretically Secure Encryption with Almost Free Authentication,‖ J. UCS, vol. 15, no. 15, pp. 2937–2956, 2009.

D. Boneh and M. K. Franklin, ―Identity-Based Encryption from the Weil Pairing,‖ in Proceedings of Advances in Cryptology –CRYPTO ’01, ser. LNCS, vol. 2139. Springer, 2001, pp. 213–229.

A. Sahai and B. Waters, ―Fuzzy Identity-Based Encryption,‖ in Proceedings of Advances in Cryptology - EUROCRYPT ’05, ser. LNCS, vol. 3494. Springer, 2005, pp. 457–473.

S. S. M. Chow, Y. Dodis, Y. Rouselakis, and B. Waters, ―Practical Leakage-Resilient Identity-Based Encryption from Simple Assumptions,‖ in ACM Conference on Computer and Communications Security, 2010, pp. 152–161.

Full Text: PDF [FULL TEXT]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.|

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at