AN EFFICIENT SECURITY MANAGEMENT SCHEME FOR DISTRIBUTED NETWORK USING HIERARCHICAL KEY APPROACH WITH ELLIPTICCURVE CRYPTOGRAPHY.
- Svits, Indore and 452001,india.
- Abstract
- Keywords
- Cite This Article as
- Corresponding Author
Information access control has turning into a testing issue in distributed storage frameworks. A few procedures have been proposed to accomplish the safe information access control in a trusted distributed storage framework. Elliptic Curve Cryptography is viewed as a standout amongst the most suitable advances for security in distributed storage. In every single existing plan, it is accepted that there is one and only power in the framework in charge of issuing to the clients. On the other hand, in numerous applications, there are various powers co inside in a framework and every power cans freely [1]. Secure and solid gathering correspondence is a dynamic range of exploration. Its notoriety is fuelled by the developing significance of gathering focused and collective properties. The focal exploration test is secure and effective gathering key administration. In this paper, we propose a productive gathering key administration convention in appropriated bunch correspondence. This convention depends on Elliptic Curve Cryptography and diminishes the key length while giving securities at the same level as that of different cryptosystems gives. To the best of our insight, this venture is the first attempt to address the single point bottleneck on both security and execution in cryptography access control plans out in the open cloud storage [2].
[SanvariyaBhadaniya and Vijay Prakash. (2016); AN EFFICIENT SECURITY MANAGEMENT SCHEME FOR DISTRIBUTED NETWORK USING HIERARCHICAL KEY APPROACH WITH ELLIPTICCURVE CRYPTOGRAPHY. Int. J. of Adv. Res. 4 (May). 1058-1063] (ISSN 2320-5407). www.journalijar.com