Key-Access Security Scheme in Cloud Computing
Apeejay School, Pitampura, New Delhi, IndiaDownload PDF
In this work, we utilize key access control the board plot that quickly changes any association-like security strategy to best-class cloud-level security. Offering an entirely adaptable, secure, and various levelled key access component for foundations that arrange with strategic information. The plan likewise limits worries about moving basic information to the general population cloud and guarantees just the clients with adequate authorization from equivalent, or higher exceptional individuals can get to the key by utilizing the topological requesting of a coordinated chart that incorporates self-circle. The central overheads like public and private storage needs are restricted to an excellent level, and the assurance of the key is computationally speedy and capable. According to a security point of view, the proposed plan would oppose joint effort attacks and give essential lack of definition security. Since the key isn't put away anyplace along these lines, the issue of an information break is eliminated
- L. Zhou, V. Varadharajan, and M. Hitchens, ‘‘Achieving secure role-based access control on encrypted data in cloud storage,’’ IEEE Trans. Inf. Forensics Security, vol. 8, no. 12, pp. 1947–1960, Dec. 2013
- L. Zhou, V. Varadharajan, and M. Hitchens, ‘‘Trust enhanced cryptographic role-based access control for secure cloud data storage,’’ IEEE Trans. Inf. Forensics Security, vol. 10, no. 11, pp. 2381– 2395, Nov. 2015
- W.-G. Tzeng, ‘‘A time-bound cryptographic key assignment scheme for access control in a hierarchy,’’ IEEE Trans. Knowl. Data Eng., vol. 14, no. 1, pp. 182– 188, Aug. 2002.
- H. M. Sun, K. H. Wang, and C. M. Chen, ‘‘On the security of an efficient time-bound hierarchical key management scheme,’’ IEEE Trans. Dependable Secure Comput., vol. 6, no. 2, pp. 159– 160, Apr. 2009
- S. Tang, X. Li, X. Huang, Y. Xiang, and L. Xu, ‘‘Achieving simple, secure and efficient hierarchical access control in cloud computing,’’ IEEE Trans.
- A. K. Das, N. R. Paul, and L. Tripathy, ‘‘Cryptanalysis and improvement of an access control in user hierarchy based on elliptic curve cryptosystem,’’ Inf. Sci., vol. 209, pp. 80–92, Nov. 2012.
- Y.-L. Lin and C.-L. Hsu, ‘‘Secure key management scheme for dynamic hierarchical access control based on ECC,’’ J. Syst. Softw., vol. 84, no. 4, pp. 679–685, 2011.
- A. De Santis, A. L. Ferrara, and B. Masucci, ‘‘Efficient provably-secure hierarchical key assignment schemes,’’ Theor. Comp
- H. Min-Shiang, ‘‘A cryptographic key assignment scheme in a hierarchy for access control,’’ Math. Comput. Model., vol. 26, no. 2, pp. 27–31, Jul. 1997.
- P. D’Arco, A. De Santis, A. L. Ferrara, and B. Masucci, ‘‘Variations on a theme by Akl and Taylor: Security and tradeoffs,’’ Theor. Comput. Sci., vol. 411, no. 1, pp. 213–227, 2010.
- M. J. Atallah, M. Blanton, N. Fazio, and K. B. Frikken, ‘‘Dynamic and efficient key management for access hierarchies,’’ ACM Trans.
- V. R. L. Shen and T.-S. Chen, ‘‘A novel key management scheme based on discrete logarithms and polynomial interpolations,’’
- E. S. V. Freire, K. G. Paterson, and B. Poettering, ‘‘Simple, efficient and strongly KIsecure hierarchical key assignment schemes,’’ in Topics in Cryptology— CT-RSA (Lecture Notes in Computer Science), vol. 7779, E. Dawson, Ed. Berlin, Germany: Springer, 2013.