A Data Security Scheme for Accessing Key In Cloud
Keywords:
RSA, DSaaS, CompaaSAbstract
In this work, we construct a key access management scheme that seamlessly transitions any hierarchical-like access policy to the digital medium. The proposed scheme allows any public cloud system to be used as a private cloud. We consider the data owner an entity consisting of several organization units. We provide a secure method for each user of this entity to access the public cloud from both inside and outside the company’s network. The idea of our key access control scheme, which is based on Shamir’s secret sharing algorithm and polynomial interpolation method, is suitable especially for hierarchical organizational structures. It offers a secure, flexible, and hierarchical key access mechanism for organizations utilizing mission-critical data. It also minimizes concerns about moving mission-critical data to the public cloud and ensures that only users with sufficient approvals from the same or higher privileged users can access the key by making use of the topological ordering of a directed graph, including self-loop. Main overheads such as public and private storage needs are reduced to a tolerable level, and the key derivation is computationally efficient. From a security perspective, our scheme is both resistant to collaboration attacks and provides key in distinguishability security. Since the key does not need to be held anywhere, the problem of a data breach based on key disclosure risk is also eliminated.
References
- S. G. Akl and P. D. Taylor, ‘‘Cryptographic solution to a problem of access control in a hierarchy,’’ ACM Trans. Comput. Syst., vol. 1, no. 3, pp. 239–248, 1983.
- S. J. Mackinnon, P. D. Taylor, H. Meijer, and S. G. Akl, ‘‘An optimal algorithm for assigning cryptographic keys to control access in a hierarchy,’’ IEEE Trans. Comput., vol. C-34, no. 9, pp. 797–802, Sep. 1985.
- R. S. Sandhu, ‘‘Cryptographic implementation of a tree hierarchy for access control,’’ Inf. Process. Lett., vol. 27, no. 2, pp. 95–98, 1988.
- L. Harn and H.-Y. Lin, ‘‘A cryptographic key generation scheme for multilevel data security,’’ Comput. Secur., vol. 9, no. 6, pp. 539–546, Oct. 1990.
- C.-C. Chang, R.-J. Hwang, and T.-C. Wu, ‘‘Cryptographic key assignment scheme for access control in a hierarchy,’’ Inf. Syst., vol. 17, no. 3, pp. 243–247, May 1992.
- H. T. Liaw, S. J. Wang, and C. L. Lei, ‘‘A dynamic cryptographic key assignment scheme in a tree structure,’’ Comput. Math. Appl., vol. 25, no. 6, pp. 109–114, Mar. 1993.
- M. S. Hwang, C. C. Chang, and W. P. Yang, ‘‘Modified Chang-Hwang-Wu access control scheme,’’ Electron. Lett., vol. 29, no. 24, pp. 2095–2096, 1993.
- H.-T. Liaw and C.-L. Lei, ‘‘An optimal algorithm to assign cryptographic keys in a tree structure for access control,’’ BIT, vol. 33, no. 1, pp. 46–56, Mar. 1993.
- 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,’’ Theron. Comput. Sci., vol. 411, no. 1, pp. 213–227, 2010.
- 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.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT

This work is licensed under a Creative Commons Attribution 4.0 International License.