Abstract: Abstract: In response to the issue that the semi-trusted nature of cloud servers in searchable encryption may result in incorrect or incomplete search results, a fine-grained result verifiable searchable encryption scheme with designated tester was proposed. This scheme allows data users to query keywords on encrypted datasets to retrieve files, and combines verification mechanisms to ensure data privacy protection and reliability of search results in the cloud. By incorporating Merkle hash tree with Rank value and counting Bloom filter, the scheme can not only verify the correctness of the data set, but also fine-grained filter out the accurate results and give the number of qualified files that are not returned, ensuring the integrity of the data set. At the same time, dynamic updating of the scheme data set was implemented, and the semantic security against selected keyword attacks was proved under the random oracle model. Experimental simulation demonstrates that compared to traditional certificateless verifiable search encryption schemes, the proposed scheme exhibits lower computational overhead and higher execution efficiency in practical applications.

Key words: cloud storage, searchable encryption, designated tester, fine-grained validation, dynamic updating

摘要： 摘 要: 针对可搜索加密中，云服务器半可信特性可能导致返回错误或不完整搜索结果的问题，文章提出了一种指定测试者的细粒度结果可验证搜索加密方案。该方案允许数据使用者在加密数据集上查询关键字来获取文件，并结合验证机制来确保云中数据隐私保护和搜索结果的可靠性。通过引入带Rank值的Merkle哈希树和计数型布隆过滤器，不仅验证了数据集的正确性，还可以细粒度筛选出正确结果并给出未返回的合格文件数，确保了数据集的完整性。同时，方案实现了数据集的动态更新，并在随机谕言机模型下证明了选择关键字的语义安全性。实验模拟表明，相比于传统的无证书可验证搜索加密方案，所提方案具有更小的计算开销，在实际应用中具有较高的执行效率。

关键词: 云存储, 可搜索加密, 指定测试者, 细粒度验证, 动态更新