Dynamic searchable encryption method supporting multi-keyword and result sorting

Abstract

The invention belongs to the technical field of wireless communication network security. The invention discloses a dynamic searchable encryption method supporting multi-keyword and result sorting. A data owner generates a corresponding keyword set according to local data, generates a file vector for each file, generates an encryption index tree, encrypts the data set through a secret key K2, and uploads the data set to a cloud service provider CSP; the data owner generates a corresponding incremental hash value for each file, and obtains an incremental hash value at the same time; the data owner generates an authenticator by using the root node hash value and the current timestamp; the user obtains a returned encrypted file set by sending the query keyword set to the CSP; and the user decrypts the ciphertext by using the key K2 and decrypts the obtained verifier by using the key K3 and the private key ssk so as to verify whether the obtained search result is correct or not. The methodis efficient and safe, can be dynamically updated, can be used for quickly searching to obtain a result, and realizes a searchable encryption function in a cloud computing environment.

Description

technical field [0001] The invention belongs to the technical field of wireless communication network security, in particular to a dynamic searchable encryption method supporting multiple keywords and result sorting. Background technique [0002] At present, the closest existing technology: With the rapid development of the Internet, network users have more and more data in their daily lives, but due to the limited local storage space of users, many users choose to store data on cloud servers. However, as a third-party cloud service provider (CSP), it cannot guarantee the security of user data, which promotes the development of cloud computing security. Users encrypt their local data and upload it to the CSP. When they want some data, they need to download all the ciphertexts before they can search. Although this saves the user's local storage space, the communication overhead of each search is Huge, in order to solve this problem, the present invention needs an encryption ...

AI Technical Summary

Problems solved by technology

Although there are some solutions for forward and backward security, but their overhead is relatively large, how to achieve forward and backward security with a small overhead is a difficult problem

[0009] (3) In actual situations, CSP may be malicious, and CSP may return tampered data or return incomplete data after user query. How to verify the freshness and integrity of the results in time after obtaining the search data? a more difficult question

[0010] The difficulty of solving the above technical problems: (1) The implementation of forward and backward security needs to be implemented on each piece of data and query, which is also an important reason why the current relatively small overhead is relatively difficult

(2) The result verification needs to take both freshness and integrity into consideration, and it cannot generate large overhead, which is also an important reason why the current result verification is not perfect

Images