Efficient pairing-free CP-ABE based on ordered binary decision diagram

Sheng DING; Jin CAO; Hui LI

doi:10.11959/j.issn.1000-436x.2019234

您当前的位置：

首页 >

文章列表页 >

Efficient pairing-free CP-ABE based on ordered binary decision diagram

Papers | 更新时间：2024-06-05

- Efficient pairing-free CP-ABE based on ordered binary decision diagram
- Journal on Communications Vol. 40, Issue 12, Pages: 1-8(2019)
- 作者机构：
  
  西安电子科技大学网络与信息安全学院，陕西西安 710071
- 作者简介：
- 基金信息：
  
  The National Key Research and Development Program of China(2017YFB0802700);The National Natural Science Foundation of China(61772404;U1836203)
- DOI：10.11959/j.issn.1000-436x.2019234
  CLC： TP393
- Online First：2019-12，
  
  Published：25 December 2019
- 稿件说明：
移动端阅览
Sheng DING, Jin CAO, Hui LI. Efficient pairing-free CP-ABE based on ordered binary decision diagram[J]. Journal on Communications, 2019, 40(12): 1-8.
DOI：

Sheng DING, Jin CAO, Hui LI. Efficient pairing-free CP-ABE based on ordered binary decision diagram[J]. Journal on Communications, 2019, 40(12): 1-8. DOI： 10.11959/j.issn.1000-436x.2019234.

摘要

为了提高基于属性加密技术的计算效率，对属性基加密构造中重要的一环——访问策略进行了优化，基于有序二元决策图（OBDD）提出了一种新型的无配对CP-ABE方案。一方面，所提方案基于椭圆曲线密码技术，将传统CP-ABE方案构造中复杂的双线性配对运算替换为较为轻量级的标量乘法，降低了方案整体的计算开销。另一方面，所提方案采用基于OBDD的访问结构，该类型访问结构不仅能表示任何关于属性的布尔表达式，还能同时支持访问策略中属性的正负值，密钥的长度不随属性的个数而正比变化，密文长度也仅与访问策略中有效路径的个数有关。安全性和性能分析结果表明，所提方案在判定性Diffie-Hellman (DDH) 假设下满足选择性选择明文安全，且方案的计算效率能满足物联网的实际应用需求。

Abstract

To improve the computational efficiency of ABE

its access structure was optimized and a pairing-free CP-ABE scheme based on ordered binary decision diagram (OBDD) was proposed.Based on the elliptic curve cryptography

the complex bilinear pairing operation in traditional CP-ABE was replaced with the relatively lightweight scalar multiplication

thus the overall computation overhead was reduced.And OBDD was used as the access structure of CP-ABE

which can not only represent any Boolean expression about attributes

but also support both positive and negative attributes.The length of the key was independent of the number of attributes and the length of the ciphertext was only related to the number of valid paths in the access policy.The security and performance analysis show that the scheme can resist chosen plaintext attack under the decisional Diffie-Hellman (DDH) assumption

and the computation efficiency can meet the practical application requirements of Internet of things.

关键词

Keywords

references

DING S , LI C , LI H . A novel efficient pairing-free CP-ABE based on elliptic curve cryptography for IoT [J ] . IEEE Access , 2018 ( 6 ): 27336 - 27345 .

WATERS B , . Ciphertext-policy attribute-based encryption:an expressive,efficient,and provably secure realization [C ] // International Workshop on Public Key Cryptography . Springer , 2011 : 53 - 70 .

CHEUNG L , NEWPORT C . Provably secure ciphertext policy ABE [C ] // The 14th ACM conference on Computer and communications security . ACM , 2007 : 456 - 465 .

BETHENCOURT J , SAHAI A , WATERS B . Ciphertext-policy attribute-based encryption [C ] // 2007 IEEE Symposium on Security and Privacy . IEEE , 2007 : 321 - 334 .

JOUX A . A one round protocol for tripartite Diffie-Hellman [J ] . Journal of Cryptology , 2004 , 17 ( 4 ): 263 - 276 .

BONEH D , LYNN B , SHACHAM H . Short signatures from the Weil pairing [J ] . Journal of Cryptology , 2004 , 17 ( 4 ): 297 - 319 .

BONEH D , FRANKLIN M . Identity-based encryption from the Weil pairing [C ] // Annual International Cryptology Conference . Springer , 2001 : 213 - 229 .

ZHOU Z , HUANG D , WANG Z . Efficient privacy-preserving ciphertext-policy attribute based-encryption and broadcast encryption [J ] . IEEE Transactions on Computers , 2013 , 64 ( 1 ): 126 - 138 .

WANG S , LIANG K , LIU J K , et al . Attribute-based data sharing scheme revisited in cloud computing [J ] . IEEE Transactions on Information Forensics and Security , 2016 , 11 ( 8 ): 1661 - 1673 .

GUO F , MU Y , SUSILO W , et al . CP-ABE with constant-size keys for lightweight devices [J ] . IEEE Transactions on Information Forensics and Security , 2014 , 9 ( 5 ): 763 - 771 .

LI L , GU T , CHANG L , et al . A ciphertext-policy attribute-based encryption based on an ordered binary decision diagram [J ] . IEEE Access , 2017 ( 5 ): 1137 - 1145 .

BEUCHAT J L , GONZÁLEZ-DÍAZ J E , MITSUNARI S , et al . High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves [C ] // International Conference on Pairing-Based Cryptography . Springer , 2010 : 21 - 39 .

BARRETO P S L M , GALBRAITH S D , Ó’HÉIGEARTAIGH C , et al . Efficient pairing computation on supersingular abelian varieties [J ] . Designs,Codes and Cryptography , 2007 , 42 ( 3 ): 239 - 271 .

CANARD S , DEVIGNE J , SANDERS O . Delegating a pairing can be both secure and efficient [C ] // International Conference on Applied Cryptography and Network Security . Springer , 2014 : 549 - 565 .

GUILLEVIC A , VERGNAUD D . Algorithms for outsourcing pairing computation [C ] // International Conference on Smart Card Research and Advanced Applications . Springer , 2014 : 193 - 211 .

CANARD S , DESMOULINS N , DEVIGNE J , et al . On the implementation of a pairing-based cryptographic protocol in a constrained device [C ] // International Conference on Pairing-Based Cryptography . Springer , 2012 : 210 - 217 .

FREEMAN D , SCOTT M , TESKE E . A taxonomy of pairing-friendly elliptic curves [J ] . Journal of Cryptology , 2010 , 23 ( 2 ): 224 - 280 .

SCOTT M , . On the efficient implementation of pairing-based protocols [C ] // IMA International Conference on Cryptography and Coding . Springer , 2011 : 296 - 308 .

RIVAIN M . Fast and regular algorithms for scalar multiplication over elliptic curves [J ] . IACR Cryptology ePrint Archive , 2011 ( 1 ):338.

CHEVALLIER-MAMES B , CORON J S , MCCULLAGH N , et al . Secure delegation of elliptic-curve pairing [C ] // International Conference on Smart Card Research and Advanced Applications . Springer , 2010 : 24 - 35 .

CHEN X , SUSILO W , LI J , et al . Efficient algorithms for secure outsourcing of bilinear pairings [J ] . Theoretical Computer Science , 2015 , 562 : 112 - 121 .

GREEN M , HOHENBERGER S , WATERS B . Outsourcing the decryption of abe ciphertexts [C ] // The 20th USENIX Conference on Security . USENIX Association , 2011 .

LI J , CHEN X , LI J , et al . Fine-grained access control system based on outsourced attribute-based encryption [C ] // European Symposium on Research in Computer Security . Springer , 2013 : 592 - 609 .

ODELU V , DAS A K . Design of a new CP-ABE with constant-size secret keys for lightweight devices using elliptic curve cryptography [J ] . Security and Communication Networks , 2016 , 9 ( 17 ): 4048 - 4059 .

ODELU V , DAS A K , KHAN M K , et al . Expressive CP-ABE scheme for mobile devices in IoT satisfying constant-size keys and ciphertexts [J ] . IEEE Access , 2017 ( 5 ): 3273 - 3283 .

Views

2384

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Leakage-resilient certificateless signcryption scheme

Research and design of parallel architecture processor for elliptic curve cryptography

Related Author

Yan-lin QIN

Xiao-ping WU

Wei HU

YANG Xiao-hui

DAI Zi-bin

LI Miao

ZHANG Yong-fu

Related Institution

Department of Information Security, Naval University of Engineering

Institute of Electronic Technology,PLA Information Engineering University

AI问答

⁰