Fine-grained access control of files stored in cloud storage with traceable and revocable multi-authority CP-ABE scheme

被引:3
作者
Mishra, Bharati [1 ]
Jena, Debasish [1 ]
Patnaik, Srikanta [2 ]
机构
[1] IIIT Bhubaneswar, Dept Comp Sci & Engn, Bhubaneswar, Odisha, India
[2] SOA Univ, Dept Comp Sci & Engn, Bhubaneswar, Odisha, India
关键词
cloud storage; access control; CP-ABE; attribute revocation; blockchain; multi-authority; ATTRIBUTE-BASED ENCRYPTION; EFFICIENT; SECURITY; PRIVACY;
D O I
10.1504/IJGUC.2023.132615
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud computing is gaining increasing popularity among enterprises, universities, government departments, and end-users. Geographically distributed users can collaborate by sharing files through the cloud. Ciphertext-Policy attribute-based (CP-ABE) access control provides an efficient technique to enforce fine-grained access control by the data owner. Single authority CP-ABE schemes create a bottleneck for enterprise applications. Multi authority CP-ABE systems deal with multiple attribute authorities performing the attribute registration or key distribution. Type I pairing is used in designing the existing multi-authority systems. They are vulnerable to some reported known attacks on them. This paper proposes a multi-authority CP-ABE scheme that supports attribute and policy revocation. Type III pairing is used in designing the scheme, which has higher security, faster group operations, and requires less memory to store the elements. The proposed scheme has been implemented using the Charm framework, which uses the PBC library. The OpenStack cloud platform is used for computing and storage services. It has been proved that the proposed scheme is collusion resistant, traceable, and revocable. AVISPA tool has been used to verify that the proposed scheme is secure against a replay attack and man-in-the-middle attack.
引用
收藏
页码:320 / 338
页数:20
相关论文
共 44 条
[1]   FAME: Fast Attribute-based Message Encryption [J].
Agrawal, Shashank ;
Chase, Melissa .
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, :665-682
[2]   Charm: a framework for rapidly prototyping cryptosystems [J].
Akinyele, Joseph A. ;
Garman, Christina ;
Miers, Ian ;
Pagano, Matthew W. ;
Rushanan, Michael ;
Green, Matthew ;
Rubin, Aviel D. .
JOURNAL OF CRYPTOGRAPHIC ENGINEERING, 2013, 3 (02) :111-128
[3]   Authentication in mobile cloud computing: A survey [J].
Alizadeh, Mojtaba ;
Abolfazli, Saeid ;
Zamani, Mazdak ;
Baharun, Sabariah ;
Sakurai, Kouichi .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2016, 61 :59-80
[4]   Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains [J].
Androulaki, Elli ;
Barger, Artem ;
Bortnikov, Vita ;
Cachin, Christian ;
Christidis, Konstantinos ;
De Caro, Angelo ;
Enyeart, David ;
Ferris, Christopher ;
Laventman, Gennady ;
Manevich, Yacov ;
Muralidharan, Srinivasan ;
Murthy, Chet ;
Binh Nguyen ;
Sethi, Manish ;
Singh, Gari ;
Smith, Keith ;
Sorniotti, Alessandro ;
Stathakopoulou, Chrysoula ;
Vukolic, Marko ;
Cocco, Sharon Weed ;
Yellick, Jason .
EUROSYS '18: PROCEEDINGS OF THE THIRTEENTH EUROSYS CONFERENCE, 2018,
[5]  
[Anonymous], 2014, OpenStack Operations Guide
[6]  
[Anonymous], 2003, NDSS
[7]  
Armando A, 2005, LECT NOTES COMPUT SC, V3576, P281
[8]  
Ateniese G., 2006, ACM Transactions on Information and Systems Security, V9, P1, DOI 10.1145/1127345.1127346
[9]   Ciphertext-policy attribute-based encryption [J].
Bethencourt, John ;
Sahai, Amit ;
Waters, Brent .
2007 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2007, :321-+
[10]   An efficient cryptographic protocol verifier based on prolog rules [J].
Blanchet, B .
14TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP, PROCEEDINGS, 2001, :82-96