A RESTRICTED ACCEPTING-COMPLICITY DATA DISTRIBUTION METHOD FOR MULTIPLE SET IN THE CLOUD

Mohd Abrar Uddin Shoeb, Mohd Arshad Hussain

Abstract


In shower computing products and services, obscure provider declares acumen of unfettered space for storing in behalf of clients to pick up the check statistics. It assists clients to cut back their fiscal pellucidity of knowledge directorates using migrating inhabitant superintendence arrangement toward obscure dependent. It is gasser to put forward an immune and recommencement testimony companionate artifice, especially for keen factions in the distract. For obstinate styles, assurance of key transportation executes the idea of sheltered verbal exchange pipe, nevertheless, to feel such a thing convey is hard likelihood and is difficult for observe. The revoked buyers can't be qualified to achieve original ASCII file once they are revoked even supposing they connive alongside dishonest swarm. Our organization can in attaining immured shopper voiding using polynomial serve as. It supports ready troops expertly, while far cry end user joins among in gather either purchaser is revoked deriving out of organization, deepest keys of different enjoyers don't require eventual up to date. Our structure can in attaining exquisite get entry to keep an eye on, by faction customer index, any shopper florin gang could make use of your origination including in distort and revoked shoppers can't get right of entry to perplex all over again thereafter revoking.


Keywords


Cloud Providers; Data Sharing; Fine-Grained Access Control; Polynomial Function; Storage Space; Key Distribution;

References


E. Goh, H. Shacham, N. Modadugu, and D. Boneh, “Sirius: Securing remote untrusted storage,” in Proc. Netw. Distrib. Syst. Security Symp., 2003, pp. 131–145.

G. Ateniese, K. Fu, M. Green, and S. Hohenberger, “Improved proxy re-encryption schemes with applications to secure distributed storage,” in Proc. Netw. Distrib. Syst. Security Symp., 2005, pp. 29–43.

D. Boneh, X. Boyen, and E. Goh, “Hierarchical identity based encryption with constant size ciphertext,” in Proc. Annu. Int. Conf. Theory Appl. Cryptographic Techn., 2005, pp. 440–456.

C. Delerablee, P. Paillier, and D. Pointcheval, “Fully collusion secure dynamic broadcast encryption with constant-size Ci-phertexts or decryption keys,” in Proc. 1st Int. Conf. Pairing-Based Cryptography, 2007, pp. 39–59.

X. Zou, Y.-S. Dai, and E. Bertino, “A practical and flexible key management mechanism for trusted collaborative computing,” in Proc. IEEE Conf. Comput. Commun., 2008, pp. 1211–1219.

M. Nabeel, N. Shang, and E. Bertino, “Privacy preserving policy based content sharing in public clouds,” IEEE Trans. Know. Data Eng., vol. 25, no. 11, pp. 2602–2614, Nov. 2013


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

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 http://creativecommons.org/licenses/by/3.0/deed.en_GB.