SURVEY ON ATTRIBUTE-BASED DATA SHARING SCHEME REVISITED IN CLOUD COMPUTING

Main Article Content

Mr. Swapnil R. Patil
Prof. N. D. Kale

Abstract

Cloud storage is the best and proficient approach to handle our information remotely. In any case, since information proprietors and clients are more often than not outside the trusted area of cloud specialist co-ops the information security and get to control is the critical component at the season of delicate information put away in the cloud. Additionally, now days there are distinctive systems are accessible for information sharing and saving security of information proprietor and client. Key Escrow is the one of the significant issue now a day. We can't keep full trust over the key power focus since they might be abuse their benefits. This is unsatisfactory for data sharing circumstances. In this paper we concentrated the current procedure for sharing the information from information proprietor to information client. The methodology propose an enhanced two-party key issuing convention that can ensure that neither key power nor cloud specialist co-op can bargain the entire mystery key of a client exclusively. The method also present the idea of quality with weight, being given to upgrade the statement of characteristic, which cannot just extend the expression from paired to discretionary state, additionally help the intricacy of get to approach. In this manner, both capacity cost and encryption many-sided quality for a ciphertext are eased. Attribute based encryption is an open key based encryption that empowers get to control over encoded information utilizing access strategies and credited qualities.

Article Details

How to Cite
R. Patil, M. S., & Kale , P. N. D. (2017). SURVEY ON ATTRIBUTE-BASED DATA SHARING SCHEME REVISITED IN CLOUD COMPUTING . Multidisciplinary Journal of Research in Engineering and Technology, 4(1), 1122–1126. Retrieved from https://journals.mriindia.com/index.php/mjret/article/view/1080
Section
Articles

Similar Articles

<< < 18 19 20 21 22 23 24 > >> 

You may also start an advanced similarity search for this article.