ISCAS OpenIR
KP-ABE based Verifiable Cloud Access Control Scheme
Si, Xiaolin; Wang, Pengpian; Zhang, Liwu
2013
Conference Name12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)
Pages34-41
Conference DateJUL 16-18, 2013
Conference PlaceMelbourne, AUSTRALIA
Indexed TypeCPCI
Publish PlaceIEEE
ISSN2324-898X
ISBN978-0-7695-5022-0
Department[Si, Xiaolin; Wang, Pengpian; Zhang, Liwu] Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
English AbstractWith the rapid development of mobile internet, mobile devices are requiring more complex authorization policy to ensure an secure access control on mobile data. However mobiles have limited resources (computing, storage, etc.) and are not suitable to execute complex operations. Cloud computing is an increasingly popular paradigm for accessing powerful computing resources. Intuitively we can solve that problem by moving the complex access control process to the cloud and implement a fine-grained access control relying on the powerful cloud. However the cloud computation may not be trusted, a crucial problem is how to verify the correctness of such computations. In this paper, we proposed a public verifiable cloud access control scheme based on Parno's public verifiable computation protocol. For the first time, we proposed the conception and concrete construction of verifiable cloud access control. Specifically, we firstly design a user private key revocable Key Policy Attribute Based Encryption (KP-ABE) scheme with non-monotonic access structure, which can be combined with the XACML policy perfectly. Secondly we convert the XACML policy into the access structure of KP-ABE. Finally we construct a security provable public verifiable cloud access control scheme based on the KP-ABE scheme we designed.; With the rapid development of mobile internet, mobile devices are requiring more complex authorization policy to ensure an secure access control on mobile data. However mobiles have limited resources (computing, storage, etc.) and are not suitable to execute complex operations. Cloud computing is an increasingly popular paradigm for accessing powerful computing resources. Intuitively we can solve that problem by moving the complex access control process to the cloud and implement a fine-grained access control relying on the powerful cloud. However the cloud computation may not be trusted, a crucial problem is how to verify the correctness of such computations. In this paper, we proposed a public verifiable cloud access control scheme based on Parno's public verifiable computation protocol. For the first time, we proposed the conception and concrete construction of verifiable cloud access control. Specifically, we firstly design a user private key revocable Key Policy Attribute Based Encryption (KP-ABE) scheme with non-monotonic access structure, which can be combined with the XACML policy perfectly. Secondly we convert the XACML policy into the access structure of KP-ABE. Finally we construct a security provable public verifiable cloud access control scheme based on the KP-ABE scheme we designed.
KeywordControl Cloud Computing Verifiable Computation Kp-abe Xacml
Language英语
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/16536
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Si, Xiaolin,Wang, Pengpian,Zhang, Liwu. KP-ABE based Verifiable Cloud Access Control Scheme[C]. IEEE,2013:34-41.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Si, Xiaolin]'s Articles
[Wang, Pengpian]'s Articles
[Zhang, Liwu]'s Articles
Baidu academic
Similar articles in Baidu academic
[Si, Xiaolin]'s Articles
[Wang, Pengpian]'s Articles
[Zhang, Liwu]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Si, Xiaolin]'s Articles
[Wang, Pengpian]'s Articles
[Zhang, Liwu]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.