A Novel Efficient Pairing-Free CP-ABE Based on Elliptic Curve Cryptography for IoT

被引:84
作者
Ding, Sheng [1 ]
Li, Chen [2 ]
Li, Hui [1 ]
机构
[1] Xidian Univ, Sch Cyber Engn, Xian 710071, Shaanxi, Peoples R China
[2] Xidian Univ, Sch Telecommun Engn, Xian 710071, Shaanxi, Peoples R China
来源
IEEE ACCESS | 2018年 / 6卷
基金
中国国家自然科学基金;
关键词
Access control; internet of things; CP-ABE; elliptic curve; pairing-free; ATTRIBUTE-BASED ENCRYPTION; CONSTANT-SIZE KEYS; DEVICES;
D O I
10.1109/ACCESS.2018.2836350
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Ciphertext-policy attribute-based encryption (CP-ABE) is a promising cryptographic technique that integrates data encryption with access control for ensuring data security in IoT systems. However, the efficiency problem of CP-ABE is still a bottleneck limiting its development and application. A widespread consensus is that the computation overhead of bilinear pairing is excessive in the practical application of ABE, especially for the devices or the processors with limited computational resources and power supply. In this paper, we proposed a novel pairing-free data access control scheme based on CP-ABE using elliptic curve cryptography, abbreviated PF-CP-ABE. We replace complicated bilinear pairing with simple scalar multiplication on elliptic curves, thereby reducing the overall computation overhead. And we designed a new way of key distribution that it can directly revoke a user or an attribute without updating other users' keys during the attribute revocation phase. Besides, our scheme use linear secret sharing scheme access structure to enhance the expressiveness of the access policy. The security and performance analysis show that our scheme significantly improved the overall efficiency as well as ensured the security.
引用
收藏
页码:27336 / 27345
页数:10
相关论文
共 30 条
  • [1] Efficient pairing computation on supersingular Abelian varieties
    Barreto, Paulo S. L. M.
    Galbraith, Steven D.
    O'hEigeartaigh, Colm
    Scott, Michael
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (03) : 239 - 271
  • [2] Beimel A., 1996, FAC COMPUT SCI
  • [3] Ciphertext-policy attribute-based encryption
    Bethencourt, John
    Sahai, Amit
    Waters, Brent
    [J]. 2007 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2007, : 321 - +
  • [4] Beuchat JL, 2010, LECT NOTES COMPUT SC, V6487, P21, DOI 10.1007/978-3-642-17455-1_2
  • [5] Short signatures from the Weil pairing
    Boneh, D
    Lynn, B
    Shacham, H
    [J]. JOURNAL OF CRYPTOLOGY, 2004, 17 (04) : 297 - 319
  • [6] Boneh D., 2001, Advances in Cryptology - CRTPTO 2001. 21st Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science Vol.2139), P213
  • [7] Canard Sebastien, 2012, Pairing-Based Cryptography - Pairing 2012. 5th International Conference. Revised Selected Papers, P210, DOI 10.1007/978-3-642-36334-4_14
  • [8] Canard S, 2014, LECT NOTES COMPUT SC, V8479, P549, DOI 10.1007/978-3-319-07536-5_32
  • [9] Efficient algorithms for secure outsourcing of bilinear pairings
    Chen, Xiaofeng
    Susilo, Willy
    Li, Jin
    Wong, Duncan S.
    Ma, Jianfeng
    Tang, Shaohua
    Tang, Qiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 562 : 112 - 121
  • [10] Cheung L, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P456