A Key Aggregate Construction with Adaptable Offering of Information in Cloud

Main Article Content

H.Fareesa Firdose
R.Deepthi Crestose Rebekah

Abstract

Information sharing is an vital utility in cloud storage. In this paper, we show secure, proficient, and adaptable strategy to impart information to other individuals in cloud storage framework. We portray new open key cryptosystems which create fixed size (single key) ciphertexts such that proficient assignments of decryption rights for any set of ciphertexts are conceivable. The novelty is that one can aggregate any arrangement of secret keys and make them as reduced as a solitary (single) key, however including the force of every last one of keys being amassed. As such, the secret key holder can discharge a constant size aggregate key for adaptable decisions of ciphertext set in cloud storage; with our proposed scheme it describes novel adaptive public-key cryptosystems. This reduced total key can be advantageously sent to security channels (e.g email) with exceptionally constrained secure storage space. With our proposed scheme it depicts novel versatile open key cryptosystems. At our previous framework every client can transfer and offer single record with unique index class records with consistent size total key it will turn into a testing issue to lessen the check of cipher class indexes files for mass documents towards enhance the space for more figure class lists .So as to address the above issue we presented a novel versatile key aggregate crypto framework to decrease the no of cipher class indexes for more documents from a same client .This scheme produce constant size cipher text such that proficient assignment of decryption rights for any set of cipher text are possible. This advance scheme can aggregate any set of Secret keys and make them as a minimized single key. The control of all the keys being aggregated in a single key.

Article Details

How to Cite
[1]
H.Fareesa Firdose and R.Deepthi Crestose Rebekah, “A Key Aggregate Construction with Adaptable Offering of Information in Cloud”, Int. J. Comput. Eng. Res. Trends, vol. 2, no. 5, pp. 355–358, May 2015.
Section
Research Articles

References

C. Wang, S. S. M. Chow, Q. Wang, K. Ren, and W. Lou, PrivacyPreserving Public Auditing for Secure Cloud Storage, IEEE Trans. Computers, vol. 62, no. 2, pp. 362–375, 2013.

S.Kamara and K.Lauter,―Cryptographic Cloud Storage,Proc.Int’l Conf. Financial Cryptography and Data Security (FC), pp. 136-149, Jan. 2010

D. Boneh, C. Gentry, B. Lynn, and H. Shacham, Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, in Proceedings of Advances in Cryptology - EUROCRYPT ’03, ser. LNCS, vol. 2656. Springer, 2003, pp. 416–432.

V. Goyal, O. Pandey, A. Sahai, and B. Waters, Attribute-Based Encryption for Fine-Grained Access Control of Encrypted data, in Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS ’06). ACM, 2006, pp. 89–98.

S. Yu, C. Wang, K. Ren, and W. Lou, Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing, Proc. IEEE INFOCOM, pp. 534-542, 2010.

M. Chase and S. S. M. Chow, Improving Privacy and Security in Multi-Authority Attribute-Based Encryption, in ACM Conference on Computer and Communications Security, 2009, pp. 121–130

M. J. Atallah, M. Blanton, N. Fazio, and K. B. Frikken, “Dynamic and Efficient Key Management for Access Hierarchies,” ACM Transactions on Information and System Security (TISSEC), vol. 12, no. 3, 2009.

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.

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

V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-Based Encryption for Fine-Grained Access Control of Encrypted data,” in Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS ’06). ACM, 2006, pp.89–98.