Parallel searchable encryption method for resisting internal keyword guessing attack

Abstract

The invention discloses a parallel searchable encryption method for resisting an internal keyword guessing attack. A current parallel search method only supports single keyword search. The method comprises the following steps: a data sender encrypts keywords and files, adds own private keys when encrypting the keywords, establishes an inverted index table, maps the keywords into vectors, and uploads the keywords and the files to a cloud server; the cloud server preprocesses the keyword ciphertext and keeps the preprocessed keyword ciphertext; the data receiver encrypts a group of query keywords to generate a trap door, maps the keywords into a vector, sets a matching mode, and uploads the keywords and the vector to a cloud server; and the cloud server performs vector inner product operation, matches the keyword ciphertext with the trap door, and searches for the corresponding keyword ciphertext. According to the method, internal keyword guessing attacks and selected plaintext attacks can be resisted, semantic security is achieved, parallel search efficiency is high, ciphertext storage space is reduced, multi-keyword search and fuzzy matching search can be achieved, and matching mode conversion is supported.

Description

technical field [0001] The invention belongs to the technical field of cryptography, in particular to the field of searchable encryption in cryptography, and specifically relates to a parallel search-based encryption technology that resists internal keyword guessing attacks and supports multi-keyword search and fuzzy search. Background technique [0002] In order to facilitate data sharing, users upload data to the server for others to find the data they want. However, for the sake of security, the data needs to be encrypted before uploading, and the encrypted data is difficult to search, so the searchable encryption technology was born. The searchable encryption system mainly includes three entities: data sender, data receiver and cloud server. The data sender extracts keywords from a series of data files, encrypts the data files and keywords to generate data ciphertext and keyword ciphertext, establishes a corresponding relationship, and uploads them to the cloud server; ...

AI Technical Summary

Problems solved by technology

If the number of search lines is less than the matching keyword ciphertext, then the search efficiency is not optimal; if the number of search lines is greater than the matching keyword ciphertext, then the search efficiency is optimal, but there will be additional waste of computing resources; only When the number of search lines is exactly equal to the matching keyword ciphertext, then the search efficiency is optimal and there is no waste of additional computing resources

[0006] (2) The problem of internal keyword guessing attacks is not considered;

[0012] (5) It is only applicable to the search of a single keyword;

[0013] The current parallel search encryption method only considers the matching of a single keyword, it is not applicable to the matching of multiple keywords and fuzzy matching, and the application range is relatively limited

Images