Achieving simple, secure and efficient hierarchical access control in cloud computing

Tang, Shaohua, Li, Xiaoyu, Huang, Xinyi, Xiang, Yang and Xu, Lingling 2016, Achieving simple, secure and efficient hierarchical access control in cloud computing, IEEE transactions on computers, vol. 65, no. 7, pp. 2325-2331, doi: 10.1109/TC.2015.2479609.

Attached Files
Name Description MIMEType Size Downloads

Title Achieving simple, secure and efficient hierarchical access control in cloud computing
Author(s) Tang, Shaohua
Li, Xiaoyu
Huang, Xinyi
Xiang, YangORCID iD for Xiang, Yang orcid.org/0000-0001-5252-0831
Xu, Lingling
Journal name IEEE transactions on computers
Volume number 65
Issue number 7
Start page 2325
End page 2331
Total pages 7
Publisher IEEE
Place of publication Piscataway, N.J.
Publication date 2016-07-01
ISSN 0018-9340
1557-9956
Keyword(s) access control
hierarchical key assignment
linear geometry
pseudorandom function
strong key indistinguishability
Science & Technology
Technology
Computer Science, Hardware & Architecture
Engineering, Electrical & Electronic
Computer Science
Engineering
KEY-MANAGEMENT SCHEME
ELLIPTIC CURVE CRYPTOSYSTEM
USER HIERARCHY
ASSIGNMENT SCHEME
Summary Access control is an indispensable security component of cloud computing, and hierarchical access control is of particular interest since in practice one is entitled to different access privileges. This paper presents a hierarchical key assignment scheme based on linear-geometry as the solution of flexible and fine-grained hierarchical access control in cloud computing. In our scheme, the encryption key of each class in the hierarchy is associated with a private vector and a public vector, and the inner product of the private vector of an ancestor class and the public vector of its descendant class can be used to derive the encryption key of that descendant class. The proposed scheme belongs to direct access schemes on hierarchical access control, namely each class at a higher level in the hierarchy can directly derive the encryption key of its descendant class without the need of iterative computation. In addition to this basic hierarchical key derivation, we also give a dynamic key management mechanism to efficiently address potential changes in the hierarchy. Our scheme only needs light computations over finite field and provides strong key indistinguishability under the assumption of pseudorandom functions. Furthermore, the simulation shows that our scheme has an optimized trade-off between computation consumption and storage space.
Language eng
DOI 10.1109/TC.2015.2479609
Field of Research 080501 Distributed and Grid Systems
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2015, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30088966

Document type: Journal Article
Collections: School of Information Technology
2018 ERA Submission
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 12 times in TR Web of Science
Scopus Citation Count Cited 17 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 330 Abstract Views, 3 File Downloads  -  Detailed Statistics
Created: Wed, 16 Nov 2016, 11:08:56 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.