Method for keyword searchable encryption based on bilinear pairs in cloud storage
A bilinear pairing and encryption method technology, which is applied in the field of information security, can solve problems such as the inability to realize keyword retrieval, and achieve the effects of ensuring security and improving overall efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0059] Assuming that the file encryptor Ent wants to convert the document collection D=(D 1 ,...,D n ) is encrypted and stored in the storage server Serv, set the document D i The keyword list is W i =(w i,1 ,…,w i,m ), 1≤i≤n, where w i,j , 1≤j≤m is D i The keywords in the j-th keyword field of , the construction scheme hopes that after the document is encrypted, the keywords can be searched, and the goal of security and confidentiality is achieved, including seven polynomial time algorithms, which are described in detail as follows:
[0060] Step 1, system parameter initialization, namely step Setup(1 k )
[0061] Executed by the file encryptor Ent to initialize the system, input the security parameter k, can take k=160, and output two multiplicative cyclic groups G whose order is a prime number q 1 and G 2 , the binary length of prime number q is k=160, g is G 1 generator of . Choose a bilinear map Choose x ∈ uniformly at random R Z q As the master key of the fi...
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