通信学报 ›› 2015, Vol. 36 ›› Issue (9): 119-126.doi: 10.11959/j.issn.1000-436x.2015135

• 学术论文 • 上一篇    下一篇

基于访问树的策略隐藏属性加密方案

宋衍1,2,韩臻1,刘凤梅2,刘磊2   

  1. 1 北京交通大学 计算机与信息技术学院,北京100044
    2 信息保障技术重点实验室,北京100072
  • 出版日期:2015-09-25 发布日期:2017-09-15
  • 基金资助:
    国家自然科学基金资助项目;北京市教育委员会学科建设与研究生培养基金资助项目;信息保障技术重点实验室开放基金资助项目

Attribute-based encryption with hidden policies in the access tree

Yan SONG1,2,Zhen HAN1,Feng-mei LIU2,Lei LIU2   

  1. 1 School of Computer and Information Technology,Beijing Jiaotong University,Beijing 100044,China
    2 Science and Technology on Information Assurance Laboratory,Beijing 100072,China
  • Online:2015-09-25 Published:2017-09-15
  • Supported by:
    The National Natural Science Foundation of China;Discipline Construction and Graduate Education Foundation of Beijing Municipal Commission of Education;Open Foundation of Science and Technology on In-formation Assurance Laboratory

摘要:

已有的策略隐藏属性加密(ABE,attribute-based encryption)方案只支持受限的访问结构,策略表达能力弱,基于此提出一种新的访问树结构,使属性隐藏和秘密共享能够应用到“与”门、“或”门和“门限”门中。并且,利用合数阶双线性群构造了一种基于访问树的策略隐藏方案,并通过双系统加密的概念证明了方案的安全性。分析和实验验证表明,方案在实现复杂访问结构的策略隐藏的同时,并没有过多地增加计算开销,在实际应用过程中更加灵活和有效。

关键词: 属性加密, 密文策略, 策略隐藏, 访问结构, 合数阶双线性群

Abstract:

The existing policies-hidden attribute-based encryption (ABE) schemes could only support a limited access structure,which resulted in weak expressiveness.A new structure of access tree was thus proposed to integrate attribute hiding and secret sharing into “and” gate,“or” gate and “threshold” gate.Then,a tree-based policies-hidden scheme was constructed by using composite order bilinear groups.Under dual system encryption,the scheme was proved to be secure.Furthermore,the analysis and experiment demonstrate that the scheme realize policies-hidden in the complex ac-cess structure without increasing the overhead of computation.As a result,it is more feasible and flexible for applica-tions.

Key words: attribute-based encryption, ciphertext policy, policies hidden, access structure, composite order bilinear groups

No Suggested Reading articles found!