通信学报 ›› 2016, Vol. 37 ›› Issue (8): 77-85.doi: 10.11959/j.issn.1000-436x.2016158

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

支持关键词任意连接搜索的属性加密方案

宋衍1,2,韩臻1,陈栋1,2,赵进华2   

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

Attribute-based encryption supporting arbitrary conjunctive key word search

Yan SONG1,2,Zhen HAN1,Dong CHEN1,2,Jin-hua ZHAO2   

  1. 1 School of Computer and Information Technology,Beijing Jiaotong University,Beijing 100044,China
    2 Technology on Information Assurance Key Laboratory,Beijing 100072,China
  • Online:2016-08-25 Published:2016-09-01
  • Supported by:
    The National Natural Science Foundation of China;Discipline Construction and Graduate Edu-cation Foundation of Beijing Municipal Commission of Education

摘要:

构建一种基于素数阶双线性群的可搜索加密方案。基于属性加密,实现每个关键词密文能够被多个用户私钥搜索,显著降低细粒度访问控制带来的网络带宽和发送节点的处理开销。基于多项式方程,支持对关键词的任意连接搜索,显著提高连接搜索的灵活性。对方案的性能进行了分析,并与现有的连接关键词搜索方案进行了比较。

关键词: 可搜索加密, 属性加密, 连接关键词, 多项式方程

Abstract:

A new searchable encryption scheme was proposed in prime order bilinear groups based on the attribute-based encryption and polynomial equation.The scheme,in which each conjunctive-keyword ciphertext can be searched by a number of users,may significantly reduce the overhead of network and sending nodes' computation in the application of fine-grained access control.Meanwhile,the scheme facilitates the flexibility of conjunctive search by supporting arbitrary conjunctive search of the keywords.At last,the performance was analyzed and compared with some recent conjunctive search schemes.

Key words: searchable encryption, attribute-based encryption, conjunctive keyword, polynomial equation

No Suggested Reading articles found!