Privacy-preserving attribute-based encryption scheme on ideal lattices
Papers|更新时间:2024-06-05
|
Privacy-preserving attribute-based encryption scheme on ideal lattices
Journal on CommunicationsVol. 39, Issue 3, Pages: 128-135(2018)
作者机构:
1. 河南理工大学计算机科学与技术学院,河南 焦作454003
2. 北京印刷学院信息工程学院,北京 102600
作者简介:
基金信息:
The National Natural Science Foundation of China(61300216);Foundation of Henan Educational Committee(16A520013);Doctoral Fund of Henan Polytechnic University(B2014-044)
ring learning with error)问题,构造一种可以保护用户属性隐私的属性基加密方案,支持灵活的访问策略,提供用户隐私保护,并且提高方案效率,缩短密钥尺寸。该方案通过采用半策略隐藏方式,保护用户的隐私,从而避免用户的敏感属性值泄露给其他任何第三方。另外,将扩展的Shamir门限秘密共享技术应用于构造方案的访问结构,从而实现用户属性的“与”“或”“门限”这3 种操作,具有更高的灵活性。经安全性分析证明,该方案在标准模型下满足自适应选择明文攻击安全。通过与其他方案的对比,该方案系统公钥、系统私钥、用户私钥长度以及密文长度都有所优化,在实际应用中更加有效。
Abstract
Based on the small key size and high encryption efficiency on ideal lattices
a privacy-preserving attribute-based encryption scheme on ideal lattices was proposed
which could support flexible access policies and privacy protection for the users.In the scheme
a semi-hidden policy was introduced to protect the users’ privacy.Thus
the sensitive values of user’s attributes are hidden to prevent from revealing to any third parties.In addition
the extended Shamir secret-sharing schemes was used to construct the access tree structure which can support “and” “or” and “threshold” operations of attributes with a high flexibility.Besides
the scheme was proved to be secure against chosen plaintext attack under the standard mode.Compared to the existing related schemes
the scheme can yield significant performance benefits
especially the size of system public/secret keys
users’ secret key and ciphertext.It is more effective in the large scale distributed environment.
关键词
Keywords
references
SAHAI A , WATERS B . Fuzzy identity-based encryption [C ] // Advances in Cryptology-EUROCRYPT . 2005 : 457 - 473 .
AJTAI M , DWORK C . A public-key cryptosystem with worstcase/average-case equivalence [C ] // ACM Symposium on Theory of Computing(STOC) . 1997 : 284 - 293 .
REGEV O , . On lattices,learning with errors,random linear codes,and cryptography [C ] // The Symposium on Theory of Computing . 2005 : 84 - 93 .
AGRAWAL S , BOYEN X , VAIKUNTANATHAN V , et al . Functional encryption for threshold functions (or fuzzy IBE) from lattices [C ] // International Conference on Practice and Theory in Public Key Cryptography . 2012 : 280 - 297 .
BOYEN X , . Attribute-based functional encryption on lattices [C ] // The 10th Theory of Cryptography Conference,Lecture Notes in Computer Science . 2013 : 122 - 142 .
LIU X M , MA J F , XIONG J B , et al . Threshold attribute-based encryption with attribute hierarchy for lattices in the standard model [J ] . IET Information Security , 2014 , 8 ( 4 ): 217 - 223 .
ZHAO J , GAO H Y , ZHANG J Q . Attribute-based encryption for circuits on lattices [J ] . Tsinghua Science and Technology , 2014 , 45 ( 5 ): 463 - 469 .
WANG Y T . Lattice ciphertext policy attribute-based encryption in the standard model [J ] . International Journal of Network Security , 2014 , 16 ( 6 ): 444 - 451 .
LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over rings [C ] // Advances in CryptologyEUROCRYPT 2010,International Conference on the Theory and Applications of Cryptographic Techniques . 2010 : 1 - 23 .
ZHU W L , YU J P , ZHANG P , et al . Efficient attribute-based encryption from R-LWE [J ] . Chinese Journal of Electronics , 2014 , 23 ( 4 ): 778 - 782 .
TAN S F , SAMSUDIN A . Lattice ciphertext-policy attribute-based encryption from ring-LWE [C ] // International Symposium on Technology Management and Emerging Technologies . 2015 : 258 - 262 .
YANG H B . A new hierarchical identity-based encryption scheme based on lattices [J ] . Journal of Wuhan University (Nature Science Edition) , 2016 , 62 ( 2 ): 155 - 160 .
YAN X X , LIU Y , LI Z C , et al . A privacy-preserving multi-authority attribute encryption scheme on ideal lattices in the cloud environment [J ] . Netinfo Security , 2017 ( 8 ): 19 - 25 .