A multi-keyword ciphertext sorting retrieval method based on an alpha cross index tree
A keyword and index technology, applied in the field of cloud computing security, can solve the problems of large index tree space overhead, reduced retrieval algorithm pruning effect, and reduced retrieval efficiency, and achieves reduced index space overhead, low index space overhead, and retrieval efficiency. high effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com