西安电子科技大学学报 ›› 2022, Vol. 49 ›› Issue (1): 55-66.doi: 10.19665/j.issn1001-2400.2022.01.006

• 隐私计算与数据安全专题 • 上一篇    下一篇

支持灵活访问控制的多关键字搜索加密方案

闫玺玺(),赵强(),汤永利(),李莹莹(),李静然()   

  1. 河南理工大学 计算机科学与技术学院,河南 焦作 454003
  • 收稿日期:2021-03-26 出版日期:2022-02-20 发布日期:2022-04-27
  • 通讯作者: 李莹莹
  • 作者简介:闫玺玺(1985—),女,副教授,博士,E-mail: yanxx@hpu.edu.cn;|赵 强(1996—),男,河南理工大学硕士研究生,E-mail: zhaoqiang_1213@163.com;|汤永利(1972—),男,教授,博士,E-mail: yltang@hpu.edu.cn;|李静然(1995—),女,河南理工大学硕士研究生,E-mail: JRan_7@163.com
  • 基金资助:
    国家自然科学基金(61802117);河南省高校科技创新团队项目(20IRTSTHN013);河南省青年人才托举工程项目(2021HYTP008);河南省高校基本科研业务费专项资金(NSFRF210312)

Multi-keyword search encryption scheme supporting flexible access control

YAN Xixi(),ZHAO Qiang(),TANG Yongli(),LI Yingying(),LI Jingran()   

  1. School of Computer Science and Technology,Henan Polytechnic University,Jiaozuo 454003,China
  • Received:2021-03-26 Online:2022-02-20 Published:2022-04-27
  • Contact: Yingying LI

摘要:

大多数的可搜索加密方案中,云服务器在执行搜索操作时将陷门与数据库中所有的索引进行对比,造成开销过大的问题。针对此问题,提出一种具有访问控制功能的高效可搜索加密方案。在敏感数据加密上传至云服务器之前,使用k均值聚类算法对数据进行聚类,将数据分配到各个簇中,并通过潜在狄雷克利分布为每个簇生成相应的索引。云服务器在搜索阶段,首先根据陷门中的关键字集合与每个簇索引的杰卡德距离,寻找关联度最高的簇,并在相匹配的簇中进行检索,减少陷门与索引的对比次数;其次使用基于B +树的数据结构来获取文件列表,大大地提高了搜索效率。此外,该方案结合广播加密机制实现加密文件共享,允许用户在被授权访问的文件子集内搜索关键字,通过聚类将数据分为若干个簇,将每个簇的关键字集合作为用户访问权限。经过性能对比和实验分析表明,该方案提供了恒定大小的用户私钥,通信代价和存储代价与被授权访问文件的用户数量无关,性能得到优化,且搜索精确率达到90%左右。

关键词: 可搜索加密, k均值聚类算法, 广播加密, 访问权限

Abstract:

In most searchable encryption schemes,the cloud server would compare the trapdoor with all secure indexes in the database during the search operation,which will cause excessive overhead.To address this problem,an efficient multi-keyword search encryption scheme supporting flexible access control is proposed.Before the sensitive data is encrypted and uploaded to the cloud server,it is clustered using the k-means to get several segmentation clusters,each of which would be given a different index through the Latent Dirichlet Allocation.In the search phase,the cloud server finds the cluster with the highest correlation through the Jaccard distance between the key set in the trapdoor and each cluster index,and searches the matched clusters in order to reduce the comparisons between the trapdoor and the index.And then the cloud server obtains the file list using the B+ tree-based data structure to improve the search efficiency.In addition,the scheme achieves encrypted file sharing by combining the broadcast encryption mechanism,which allows users to search for keywords in the authorized file subset,and takes the keyword set of each cluster as the user access rights.The performance comparison and experimental analysis show that a constant size of the user private key would be provided,and the communication cost and storage cost are independent of the number of authorized users,with the precision of search reaching about 90%.

Key words: searchable encryption, k-means clustering algorithm, broadcast encryption, access control

中图分类号: 

  • TP309.7
Baidu
map