A dynamic and verifiable multi-keyword ranked search scheme in the P2P networking environment
- PDF / 1,351,672 Bytes
- 14 Pages / 595.224 x 790.955 pts Page_size
- 63 Downloads / 177 Views
A dynamic and verifiable multi-keyword ranked search scheme in the P2P networking environment Haoyang Wang1 · Kai Fan1 · Hui Li1 · Yintang Yang2 Received: 11 October 2019 / Accepted: 26 March 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract 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. Keywords P2P network · Secure kNN algorithm · Tree-based index · Time-stamp chain · Merkle tree · Forward and backward security
1 Introduction In recent years, P2P network and application have developed rapidly, but the limited local storage space of users has become a bottleneck for their development, With the unique advantages of CSS, more and more users storing data in the cloud server. This reduces local
This article is part of the Topical Collection: Special Issue on Security and Privacy in Machine Learning Assisted P2P Networks Guest Editors: Hongwei Li, Rongxing Lu and Mohamed Mahmoud Kai Fan
[email protected] Haoyang Wang [email protected] 1
State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an, China
2
Key Lab. of the Minist. of Educ. for Wide Band-Gap Semicon. Materials and Devices, Xidian University, Xi’an, China
storage and computational overhead while also enabling rapid development of SE technology. The efficiency of the SE scheme is affected by various factors such as index, trapdoors and encryption methods. Since Song et al. [21] first proposed a symmetric searchable encryption(SSE), the SE technology has made tremendous progress in improving search efficiency. Simultaneously, the cloud servers in most current SE schemes are set to be honest but curious. But in reality, malicious servers will perform illegal operations on the ciphertexts on them. Researchers have proposed some verifiable searchable encryption(VSE) scheme on this basis. However, most VSE schemes currently only supports static databases or based
Data Loading...
