增量式多关键字可搜索加密算法  

Incremental multi-keyword searchable encryption scheme

作　　者：彭凝多 罗光春[1] 秦科[1] 李春虎[1] 马致远[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,四川成都611731

出　　处：《计算机工程与设计》2015年第6期1472-1475,共4页Computer Engineering and Design

基　　金：四川省科技支撑计划基金项目(2012FZ0064;2013GZ0141)

摘　　要：为满足加密文件的多关键字检索需求并解决云存储模式下文件频繁更新导致用户重构安全索引的问题,提出增量式多关键字可搜索加密算法。基于新型的多元素随机布隆过滤器,使用户提交的多个查询关键字被随机哈希并混合,在随机布隆过滤器中得到快速判定。该算法保障数据与查询机密性的同时,保护用户访问模式的隐私性,支持文件的独立更新,有效避免可搜索结构的整体重构,其效率与检索准确率与同类算法相比有较大提高。实验验证了该方案的实用性。To satisfy the requirement for multi‐keyword searching over encrypted data ,and solve the problem of costly recon‐struction of index while updating new files ,an incremental multi‐keyword searchable encryption scheme was proposed .The pro‐posed scheme w as based on a novel structure called random Bloom filter ,w hich enabled the user’s queries to be randomly hashed and mixed ,and further to be efficiently tested in the random Bloom filter .The proposed scheme guarantees the confidentialities of the data as well as the query ,and it protects the user’s access privacy .It also supports independent updating for single file , and the reconstruction of the whole index is avoided .Furthermore ,in comparison with the prior works ,the efficiency and accu‐racy are greatly improved .Finally ,the practicability was demonstrated by experiments .

关 键 词：云存储 可搜索加密 多检索 抗统计分析 布隆过滤器 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]