IEICE TRANSACTIONS on Information
Towards an Efficient Approximate Solution for the Weighted User Authorization Query Problem
Summary :
The user authorization query (UAQ) problem determines whether there exists an optimum set of roles to be activated to provide a set of permissions requested by a user. It has been deemed as a key issue for efficiently handling user's access requests in role-based access control (RBAC). Unfortunately, the weight is a value attached to a permission/role representing its importance, should be introduced to UAQ, has been ignored. In this paper, we propose a comprehensive definition of the weighted UAQ (WUAQ) problem with the role-weighted-cardinality and permission-weighted-cardinality constraints. Moreover, we study the computational complexity of different subcases of WUAQ, and show that many instances in each subcase are intractable. In particular, inspired by the idea of the genetic algorithm, we propose an algorithm to approximate solve an intractable subcase of the WUAQ problem. An important observation is that this algorithm can be efficiently modified to handle the other subcases of the WUAQ problem. The experimental results show the advantage of the proposed algorithm, which is especially fit for the case that the computational overhead is even more important than the accuracy in a large-scale RBAC system.
- Publication
- IEICE TRANSACTIONS on Information Vol.E100-D No.8 pp.1762-1769
- Publication Date
- 2017/08/01
- Publicized
- 2017/05/18
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2016ICP0002
- Type of Manuscript
- Special Section PAPER (Special Section on Information and Communication System Security)
- Category
- Access Control
Authors
Jianfeng LU
Zhejiang Normal University,Nanjing University
Zheng WANG
Zhejiang Normal University
Dewu XU
Zhejiang Normal University
Changbing TANG
Zhejiang Normal University
Jianmin HAN
Zhejiang Normal University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jianfeng LU, Zheng WANG, Dewu XU, Changbing TANG, Jianmin HAN, "Towards an Efficient Approximate Solution for the Weighted User Authorization Query Problem" in IEICE TRANSACTIONS on Information,
vol. E100-D, no. 8, pp. 1762-1769, August 2017, doi: 10.1587/transinf.2016ICP0002.
Abstract: The user authorization query (UAQ) problem determines whether there exists an optimum set of roles to be activated to provide a set of permissions requested by a user. It has been deemed as a key issue for efficiently handling user's access requests in role-based access control (RBAC). Unfortunately, the weight is a value attached to a permission/role representing its importance, should be introduced to UAQ, has been ignored. In this paper, we propose a comprehensive definition of the weighted UAQ (WUAQ) problem with the role-weighted-cardinality and permission-weighted-cardinality constraints. Moreover, we study the computational complexity of different subcases of WUAQ, and show that many instances in each subcase are intractable. In particular, inspired by the idea of the genetic algorithm, we propose an algorithm to approximate solve an intractable subcase of the WUAQ problem. An important observation is that this algorithm can be efficiently modified to handle the other subcases of the WUAQ problem. The experimental results show the advantage of the proposed algorithm, which is especially fit for the case that the computational overhead is even more important than the accuracy in a large-scale RBAC system.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2016ICP0002/_p
Copy
@ARTICLE{e100-d_8_1762,
author={Jianfeng LU, Zheng WANG, Dewu XU, Changbing TANG, Jianmin HAN, },
journal={IEICE TRANSACTIONS on Information},
title={Towards an Efficient Approximate Solution for the Weighted User Authorization Query Problem},
year={2017},
volume={E100-D},
number={8},
pages={1762-1769},
abstract={The user authorization query (UAQ) problem determines whether there exists an optimum set of roles to be activated to provide a set of permissions requested by a user. It has been deemed as a key issue for efficiently handling user's access requests in role-based access control (RBAC). Unfortunately, the weight is a value attached to a permission/role representing its importance, should be introduced to UAQ, has been ignored. In this paper, we propose a comprehensive definition of the weighted UAQ (WUAQ) problem with the role-weighted-cardinality and permission-weighted-cardinality constraints. Moreover, we study the computational complexity of different subcases of WUAQ, and show that many instances in each subcase are intractable. In particular, inspired by the idea of the genetic algorithm, we propose an algorithm to approximate solve an intractable subcase of the WUAQ problem. An important observation is that this algorithm can be efficiently modified to handle the other subcases of the WUAQ problem. The experimental results show the advantage of the proposed algorithm, which is especially fit for the case that the computational overhead is even more important than the accuracy in a large-scale RBAC system.},
keywords={},
doi={10.1587/transinf.2016ICP0002},
ISSN={1745-1361},
month={August},}
Copy
TY - JOUR
TI - Towards an Efficient Approximate Solution for the Weighted User Authorization Query Problem
T2 - IEICE TRANSACTIONS on Information
SP - 1762
EP - 1769
AU - Jianfeng LU
AU - Zheng WANG
AU - Dewu XU
AU - Changbing TANG
AU - Jianmin HAN
PY - 2017
DO - 10.1587/transinf.2016ICP0002
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E100-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2017
AB - The user authorization query (UAQ) problem determines whether there exists an optimum set of roles to be activated to provide a set of permissions requested by a user. It has been deemed as a key issue for efficiently handling user's access requests in role-based access control (RBAC). Unfortunately, the weight is a value attached to a permission/role representing its importance, should be introduced to UAQ, has been ignored. In this paper, we propose a comprehensive definition of the weighted UAQ (WUAQ) problem with the role-weighted-cardinality and permission-weighted-cardinality constraints. Moreover, we study the computational complexity of different subcases of WUAQ, and show that many instances in each subcase are intractable. In particular, inspired by the idea of the genetic algorithm, we propose an algorithm to approximate solve an intractable subcase of the WUAQ problem. An important observation is that this algorithm can be efficiently modified to handle the other subcases of the WUAQ problem. The experimental results show the advantage of the proposed algorithm, which is especially fit for the case that the computational overhead is even more important than the accuracy in a large-scale RBAC system.
ER -
English
