Vempuluri Venkateswarlu, N Venkatadri


We describe new public-key cryptosystems that leave constant-size cipher texts to make sure that efficient delegation of understanding legal rights for virtually any quantity of cipher texts are possible. Data discussing is an important functionality in cloud storage. During this paper, we show the easiest method to safely, efficiently, and flexibly share information with other people in cloud storage. The novelty is that you could aggregate a variety of secret keys causing them to be as compact as being a single key, but encompassing the pressure of all of the keys being aggregated. Cloud storage is attaining recognition lately. In enterprise configurations, we percieve the increase in fascination with data outsourcing that will help within the proper charge of corporate data. It's also utilized just like a core technology behind many online services website hosting programs. Essentially, the key factor holder can to produce constant-size aggregate key for flexible different levels of cipher text occur cloud storage, nonetheless another encoded files outdoors the set remain private. We describe other usage of our schemes. Particularly, our schemes give you the first public-key patient-controlled file encryption for flexible hierarchy, that was unfamiliar. This compact aggregate key may be easily delivered to others or even be stored in the wise card with limited secure storage. We offer formal security analysis inside our schemes within the standard model. A canonical usage of KAC is data discussing. The important thing factor aggregation rentals are particularly helpful after we expect the delegation to obtain efficient and versatile. The schemes enable a content provider to discuss her data within the private and selective way, obtaining a set and small cipher text expansion, by disbursing to every approved user just one and small aggregate key.


Data Sharing; Key-Aggregate Encryption; Patient-Controlled Encryption


F. Guo, Y. Mu, Z. Chen, and L. Xu, “Multi-Identity Single-Key Decryption without Random Oracles,” Proc. Information Security and Cryptology (Inscrypt ’07), vol. 4990, pp. 384-398, 2007.

J. Benaloh, “Key Compression and Its Application to Digital Fingerprinting,” technical report, Microsoft Research, 2009.

D. Naor, M. Naor, and J. Lotspiech, “Revocation and Tracing Schemes for Stateless Receivers,” Proc. Advances in Cryptology Conf. (CRYPTO ’01), pp. 41-62, 2001.

B. Alomair and R. Poovendran, “Information Theoretically Secure Encryption with Almost Free Authentication,” J. Universal Computer Science, vol. 15, no. 15, pp. 2937-2956, 2009.

M. Chase and S.S.M. Chow, “Improving Privacy and Security in Multi-Authority Attribute-Based Encryption,” Proc. ACM Conf. Computer and Comm. Security, pp. 121-130. 2009.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2023, All rights reserved.|

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