首页 | 本学科首页   官方微博 | 高级检索  
     

支持关键词任意连接搜索的属性加密方案
引用本文:宋 衍,韩 臻,陈 栋,赵进华.支持关键词任意连接搜索的属性加密方案[J].通信学报,2016,37(8):77-85.
作者姓名:宋 衍  韩 臻  陈 栋  赵进华
作者单位:1.北京交通大学计算机与信息技术学院,北京 100044;2.信息保障技术重点实验室,北京 100072
基金项目:国家自然科学基金资助项目(No.60973112);北京市教育委员会学科建设与研究生培养基金资助项目(No.BMKY2011B06)
摘    要:构建一种基于素数阶双线性群的可搜索加密方案。基于属性加密,实现每个关键词密文能够被多个用户私钥搜索,显著降低细粒度访问控制带来的网络带宽和发送节点的处理开销。基于多项式方程,支持对关键词的任意连接搜索,显著提高连接搜索的灵活性。对方案的性能进行了分析,并与现有的连接关键词搜索方案进行了比较。

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

Attribute-based encryption supporting arbitrary conjunctive key word search
Yan SONG,Zhen HAN,Dong CHEN,Jin-hua ZHAO.Attribute-based encryption supporting arbitrary conjunctive key word search[J].Journal on Communications,2016,37(8):77-85.
Authors:Yan SONG  Zhen HAN  Dong CHEN  Jin-hua ZHAO
Affiliation:1. School of Computer and Information Technology,Beijing Jiaotong University,Beijing 100044,China;2. Technology on Information Assurance Key Laboratory,Beijing 100072,China
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.
Keywords:searchable encryption  attribute-based encryption  conjunctive keyword  polynomial equation
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号