可验证的基于词典的可搜索加密方案

摘要

A verifiable dictionary-based searchable encryption scheme is proposed for verifying the completeness of search results. The security of the proposed scheme is analyzed under the security model of adaptive indistinguishability. Compared with the existing schemes, the proposed scheme has advantages in the following aspects: the size of trapdoor is constant, the updating doesn't require recalculation, and especially the search result is verifiable.%针对云存储中数据检索和安全问题,提出了一个可验证的基于词典的可搜索加密方案.该方案能够验证搜索结果的完备性.在适应性不可区分安全模型下证明了该方案的安全性.与现有方案相比,该方案具有陷门大小固定、适应性安全、更新无需重新计算、可验证等优势.