A Multi-keyword Ciphertext Sorting and Retrieval Method Based on α-Fork Index Tree

A keyword and indexing technology, which is applied in the field of cloud computing security, can solve the problems of reduced retrieval algorithm pruning effect, large index tree space overhead, and low retrieval efficiency, etc., to achieve low index space overhead, reduce index space overhead, and retrieval efficiency high effect

Active Publication Date: 2021-05-11
NANJING UNIV OF POSTS & TELECOMM
View PDF10 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

These schemes may be able to return sorted documents more accurately, but with the increase of the document cardinality, the space overhead of the index tree is large, and the pruning effect of the retrieval algorithm will also be reduced, resulting in a decrease in retrieval efficiency. Therefore, it is necessary to propose a Safe, efficient and effective multi-keyword ciphertext sorting retrieval method

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Multi-keyword Ciphertext Sorting and Retrieval Method Based on α-Fork Index Tree
  • A Multi-keyword Ciphertext Sorting and Retrieval Method Based on α-Fork Index Tree
  • A Multi-keyword Ciphertext Sorting and Retrieval Method Based on α-Fork Index Tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0043] The present invention will be described in further detail below in conjunction with the accompanying drawings.

[0044] For the convenience of description, the relevant symbols are defined as follows:

[0045] n represents the number of documents, and m represents the length of the keyword dictionary. Key K={key,S,M 1 , M 2}, where key is the document encryption key, S is an m-dimensional random vector, M 1 , M 2 is an m×m invertible matrix. Document collection DS = {d 1 , d 2 ,...,d n}, the encrypted ciphertext set The keywords contained in each document in DS form a keyword dictionary W={w 1 ,w 2 ,...,w m},DS(w i ) indicates that the keyword w is included i collection of documents; D i Indicates the document d i The corresponding document vector, Indicates the encrypted form of the document vector. The data structure of α-forked index tree node u can be expressed as u=, where α represents the maximum number of child nodes that intermediate node u ca...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a multi-keyword ciphertext sorting and retrieval method based on an α-fork index tree. The data owner first vectorizes plaintext documents through a vector space model; then constructs a binary clustering tree through a binary k-means clustering method , traversing its leaf nodes to obtain the clustering document sequence; then constructing the α-fork index tree from the bottom up based on the clustering document sequence; finally, outsource the encrypted document and index tree to the cloud server, and share the key with authorized users; authorized users pass The retrieval trapdoor sends a retrieval request to the cloud server, and the cloud server returns the retrieval result through a greedy depth-first retrieval algorithm, and the authorized user obtains the plaintext retrieval result after decryption. The protocol flow of the invention is simple, high in security, easy to implement, and beneficial to improving the retrieval efficiency of multi-keyword ciphertext sorting retrieval and realizing accurate retrieval.

Description

technical field [0001] The invention belongs to the field of cloud computing security, and in particular relates to a method for sorting and retrieving multi-keyword ciphertexts based on an α-fork index tree. Background technique [0002] In the environment of big data, how to quickly and effectively retrieve the information needed by users from massive data has become an urgent problem to be solved. With its high-quality computing, storage, and application capabilities, cloud computing technology has become a mainstream model in the IT industry. In the cloud environment, users outsource resource data services to the cloud server to minimize expenditure costs, and protecting user privacy, preventing data from being leaked, and ensuring the efficiency and effectiveness of data obtained from the cloud server have also become people's concerns. focus. [0003] The traditional solution to data leakage is to encrypt the original data, but this will make data utilization face se...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F16/31G06F16/33G06F21/60G06F21/62
Inventor 戴华李啸赵志翔保静静杨庚黄海平
Owner NANJING UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products