一种可抵抗统计攻击的安全索引

发布时间：2018-11-09 10:20

【摘要】：现有的大部分可检索加密方案建立的安全索引面临着统计攻击的威胁.为了抵抗统计攻击,部分方案设计出关键词?文档一一对应的陷门,以检索时多次的陷门计算为代价保证安全性,但是这样又导致检索速度过于慢而无法接受.为此,研究了针对密文的安全检索方案,在克服已有方案缺点的同时保证对于统计攻击的安全性.该方案使用Bloom过滤器为文档的关键词构造索引.为了确保检索效率,对于相同的关键词构造唯一对应的陷门.通过增加伪造的文档索引,并且在索引中进行插值来确保每个关键词在文档集合中出现的次数相似,从而达到语义安全并且能够抵抗统计攻击.在实现中,对索引进行倒排进一步提高检索效率.证明了本方案的安全性,且采用实验验证了其有效性和高效性.
[Abstract]:Most of the existing searchable encryption schemes are facing the threat of statistical attacks. In order to resist statistical attacks, some schemes design keywords? The trapping door corresponding to the document ensures security at the cost of multiple trapdoor computations during retrieval, but this results in the retrieval speed being too slow to accept. For this reason, a secure retrieval scheme for ciphertext is studied to overcome the shortcomings of existing schemes and to ensure the security of statistical attacks at the same time. The scheme uses an Bloom filter to index the keywords of a document. In order to ensure retrieval efficiency, only corresponding trapping doors are constructed for the same keywords. By adding forged document indexes and interpolation in the index to ensure that each keyword appears in the document set the number of times is similar to achieve semantic security and be able to resist statistical attacks. In the implementation, the index is inverted to further improve the retrieval efficiency. The security of the scheme is proved, and the effectiveness and efficiency of the scheme are verified by experiments.
【作者单位】：中国科学院软件研究所可信计算与信息保证实验室;中国科学院大学;计算机科学国家重点实验室(中国科学院软件研究所);
【基金】：国家自然科学基金重点项目(61230005);国家自然科学基金项目(61402456)~~
【分类号】：TP309

【相似文献】