Affiliations M.Tech (CSE), Priyadrshini Institute of Technology & ManagementAssociateProfessor (Dept.of CSE), Priyadrshini Institute of Technology & Management
Day to day Cloud Computing is expanding massively because of its favorable position of giving adaptable storage
prerequisite. The clients are begun to share their touchy data through the cloud because of its tendency of giving
accommodation to clients. The security of the data must be guaranteed to the clients while putting away their subtle elements
into the cloud server. In the current work an expressive, proficient and revocable data access control plan for multi-power
distributed storage frameworks are proposed to bolster the power access control get from the numerous property powers. The
clients the individuals who are having coordinating properties as in the access approach defined in the figure content can
recover the whole data content. It intends to permit the clients with qualified credits to unscramble the whole data put away in
the cloud server. On the other hand, it can't constrain the clients from accessing the data's which are not accessible to them.
That is it can't restrict the data access control to the approved clients. In this work a novel calculation to be specific Security
improved Data Access Control Plan is proposed to defeat the issue exist in the current work. In the current work data, access
control is constrained to the client from the unapproved clients though in the proposed calculation plan to restrict the data access
control to the approved client.
NADAKUDITI MALLIKHARJUNA SWAMY,K.KIRAN KUMAR."Augmenting Privacy for Cloud users through Advanced Access Control Scheme for MultiAuthority Cloud Storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.862-866, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1131.pdf,
1. J. Bethencourt, A. Sahai, and B. Waters, â€œCiphertextPolicy AttributeBased Encryption,â€ Proc. IEEE Symp. Security and Privacy (SP â€™07), pp. 321-334, 2007.
2. P. Mell and T. Grance, â€žâ€žThe NIST Definition of Cloud Computing,â€Ÿ â€Ÿ National Institute of Standards and Technology, Gaithersburg, MD, USA, Tech. Rep., 2009.
3. A.B. Lewko, T. Okamoto, A. Sahai, K. Takashima, and B.Waters, â€žFully Secure Functional Encryption: AttributeBased Encryption and (Hierarchical) Inner Product Encryption,â€Ÿ â€Ÿ in Proc. Advances in cryptologyEUROCRYPTâ€™10, 2010, pp. 62-91.
4. M. Li, S. Yu, Y. Zheng, K. Ren, andW. Lou, â€žâ€žScalable and Secure Sharing of Personal Health Records in Cloud Computing Using Attribute-Based Encryption,â€Ÿ â€Ÿ IEEE Trans. Parallel Distributed Systems, vol. 24, no. 1, pp. 131-143, Jan. 2013.
5. S. Yu, C. Wang, K. Ren, and W. Lou, â€œAttribute Based Data Sharing with Attribute Revocation,â€ Proc. Fifth ACM Symp. Information, Computer and Comm. Security (ASIACCS â€™10), 2010.
6. J. Hur and D. Noh, â€œAttribute-based access control with efficient revocation in data outsourcing systems,â€ IEEE Transactions on Parallel and Distributed Systems, 2010.
7. S. Ruj, A. Nayak, and I. Stojmenovic, â€žâ€žDACC: Distributed Access Control in Clouds,â€Ÿ â€Ÿ in Proc. 10th IEEE Intâ€™l Conf. TrustCom, 2011, pp. 91-98
8. G. Wang, Q. Liu, and J. Wu, â€œHierarchical attributebased encryption for fine-grained access control in cloud storage services,â€ in ACM Conference on Computer and Communications Security, E. Al-Shaer, A. D. Keromytis, and V. Shmatikov, Eds. ACM, 2010, pp. 735â€“737.
9. C. Dong, G. Russello, and N. Dulay, â€œShared and Searchable Encrypted Data for Untrusted Servers,â€ J. Computer Security, vol. 19, pp. 367- 397, 2010.
10. D. Boneh and M.K. Franklin, â€žâ€žIdentity-Based Encryption from the Weil Pairing,â€Ÿ â€Ÿ in Proc. 21st Ann. Intâ€™l Cryptology Conf.: Advances in Cryptology - CRYPTOâ€™01, 2001, pp. 213-229.
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.