With the rapid development of the Internet, Peer to Peer(P2P) network has been applied in various fields. Users in P2P network also have a large amount of data, but users cannot provide enough storage space locally. More and more users choose to upload their own data to cloud server in order to save overhead and facilitate sharing their own data with other users. In order to ensure data security, researchers have proposed searchable encryption(SE) technology, and searchable encryption has been widely used. In this paper, a dynamic verifiable multi-keyword ranked search scheme is proposed under the background of P2P network and cloud storage service(CSS). On the basis of using secure kNN algorithm to encrypt index and traditional inner product algorithm to obtain ranked results, the scheme in this paper realizes forward and backward security by changing the structure of file vector and using modular residual computation. Meanwhile, the integrity and freshness of search results are verified by combining timestamp chain and Merkle tree. Finally, the security of this scheme under two threat models is analyzed, and the performance evaluation experiment is carried out on the document set.

随着Internet的飞速发展，点对点（P2P）网络已被应用于各个领域。P2P网络中的用户也有大量数据，但是用户无法在本地提供足够的存储空间。越来越多的用户选择将自己的数据上传到云服务器，以节省开销并促进与其他用户共享自己的数据。为了确保数据安全，研究人员提出了可搜索加密（SE）技术，可搜索加密已被广泛使用。在P2P网络和云存储服务（CSS）的背景下，提出了一种动态可验证的多关键字排名搜索方案。在使用安全的kNN算法对索引进行加密和传统内积算法获得排名结果的基础上，该方案通过改变文件向量的结构并采用模块化残差计算来实现前后安全性。同时，通过结合时间戳链和Merkle树来验证搜索结果的完整性和新鲜度。最后，分析了该方案在两种威胁模型下的安全性，并对文档集进行了性能评估实验。