CN109213731A - Multi-key word cipher text retrieval method in cloud environment based on iterative cryptographic - Google Patents
Multi-key word cipher text retrieval method in cloud environment based on iterative cryptographic Download PDFInfo
- Publication number
- CN109213731A CN109213731A CN201810860176.2A CN201810860176A CN109213731A CN 109213731 A CN109213731 A CN 109213731A CN 201810860176 A CN201810860176 A CN 201810860176A CN 109213731 A CN109213731 A CN 109213731A
- Authority
- CN
- China
- Prior art keywords
- file
- server
- array
- keyword
- ciphertext
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0863—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving passwords or one-time passwords
Abstract
The present invention discloses the multi-key word cipher text retrieval method based on iterative cryptographic in a kind of cloud environment, including system initialization, establish index, encrypted indexes and file, data uploads, inquiry request generations, server search, data return, user's transmission update request of data.The present invention is based on iterative cryptographic modes to realize quick lookup, independent of inverted index structure, it equally can achieve identical effect, in search process, after server receives request, according to file label iteration ciphertext, decryption is iterated using symmetric encipherment algorithm, corresponding file label can be obtained, Bloom filter is then searched according to file label, to return to the file for the condition that meets to user.Because having used the skill of iterative cryptographic, simultaneously, the requirement of forward secrecy is reached not revealing relationship between keyword and file label.
Description
Technical field
The invention belongs to cloud environment encryption technologies, and in particular to the multi-key word based on iterative cryptographic is close in a kind of cloud environment
Literary search method.
Background technique
Can search for encryption is a kind of important search technique, can protect secure user data and privacy in cloud storage.
With the rapid development of cloud computing, user starts Data Migration to cloud server avoiding cumbersome local data pipe with this
It manages and obtains more convenient and fast service.In order to guarantee data security and privacy of user, data be usually with ciphertext storage beyond the clouds
In server, but user will encounter the problem how to be searched in ciphertext.It can search for encryption to develop in recent years
A kind of cryptographic primitive for supporting user to carry out keyword lookup in ciphertext, it can save a large amount of network and meter for user
The computing resource calculated expense, and make full use of cloud server huge carries out the keyword in ciphertext and searches.
Forward secrecy refers to be leaked out for the long term keys for generating session key, use when communicating before not will cause
Session key leakage, would not also reveal pervious Content of communciation.In general, meeting under the public key environment of forward secrecy
Scheme, public key is fixed, and key is then as the time is updated.This renewal process is unidirectional, therefore is also just protected
It has demonstrate,proved and has taken current key, be that can not recover pervious key, to ensure that forward secrecy.
The research that can search for encryption to forward secrecy is supported is begun to focus on now with many scholars.Early in 2005,
Chang and Mitzenmacher et al., which is put forward for the first time, supports the dynamic of forward secrecy to can search for encipherment scheme, and side before
The problem of case is compared to concern is different, is more of practical significance, but searches plain low efficiency.Several years up to date, the problem was by a large amount of
The concern of scholar, proposes many schemes, there is very big promotion in performance.2014, the scheme that Stefanov et al. is proposed existed
It is promoted in efficiency, promotes search time to pressure linear time complexity from linear.During their interactive refreshing,
Client obtains a large amount of data from server, runs on the sort algorithm of forgetting.In addition, the data in database are deleted
It is legal, but only modifies in search process, when the data of deletion are more than half, the authors suggested that re-encrypted
Database.2015, Yavuz and Guajardo et al. proposed a new structure, the data structure based on matrix, square
The cross and row of battle array respectively represent keyword and file identification, there are two Hash table, one be used as inverted index one be used as it is preceding to
Index, inverted index are used to search for forward index for more new data, however the cross and row of their scheme matrixes are determining in advance
, therefore, the program, which can be regarded as the symmetrical of static state, can search for encrypting.2016, Sophos is proposed to be replaced based on thresholding
Scheme, their scheme has a good performance in calculating and communication, but their displacement be based on public key encryption algorithm,
Very high computing cost is needed, there are also their schemes not to support parallel computation, because thresholding displacement needs successive iteration.Also
The program only supports increase and search operation, does not support to delete.Therefore, the dynamic characteristic of Sophos is by running two examples
Come what is provided, one is used to add, another is for deleting.Query processing process, server meter are being scanned for keyword w
It calculates and returns to the difference in two examples between document identifier corresponding with w.These factors reduce server storage and search
The practicability of rope operation.2017, Kee and Minkyu et al. proposed the data structure of Shuangzi allusion quotation, and a dictionary is to arrange
Indexing a dictionary is forward index, except that be relevant between the two dictionaries not being independent.The structure is fine
Realize data dynamic update.Above scheme all only focuses on single keyword search, does not support multiple key to search for.2018
Year, Minxin Du and Qian Wang et al. proposes a kind of new index structure, probability inverted index coding structure, branch
The search for holding multiple key conceals the information of keyword well in search and renewal process, has reached and do not leaked key
Relationship between word and file, but low efficiency will traverse entire database.
In conclusion existing inverted index is keyword and file label set pair, such as a keyword correspondence is more
A file (wi,(id1,id2…idt)) or keyword-file to (wi,id1),(wi,id2)…(wi,idt), it is required to
Server is sent to after the two index encryptions, when access next time, server is according to keyword wiCiphertext find it is corresponding
Array decrypts the array and obtains corresponding file label, then finds corresponding Bloom filter according to file label to sentence
Whether disconnected is the file to be looked for.
Summary of the invention
Goal of the invention: it is an object of the invention to solve the deficiencies in the prior art, base in a kind of cloud environment is provided
In the multi-key word cipher text retrieval method of iterative cryptographic, search efficiency of the invention is high, is needed based on can get using iterative cryptographic
The file identification to be searched for does not need to establish inverted index, saves the cost for establishing inverted index.
Technical solution: the multi-key word cipher text retrieval method in a kind of cloud environment of the invention based on iterative cryptographic, including
Following steps:
(1) data owner's processing locality
(1.1) system initialization: selection security parameter λ, matrix M1、With vector S ∈ { 0,1 }m；Using
SKE.Gen(1λ) it is that key method of formation generates key, sk1、sk2←SKE.Gen(1λ)；
(1.2) index is established:
(1.2.1) extracts keyword from file set dSelect r hash function；
hj∈[1,r]={ hj|j∈[1,r],hj:{0,1}*→{0,1}l}；
(1.2.2) initialize array Cnt, T, D and Bloom filter BF；(Cnt array recording key is in different files
The number of middle appearance, that is, have recorded the number of its iteration in an iterative process, and the corresponding file label of array T recording key changes
For encrypted ciphertext, array D has recorded file status, if has deleted)；
(1.2.3) is to each keyword wi∈ W is iterated encryption respectively；I ∈ [1, n], n indicate that keyword is always a
Number；
(1.2.4) array T records the ciphertext T [w after each keyword and its corresponding iterative cryptographici,ei]；
(1.3) encrypted indexes and file；To each Bloom filter, if S [i]=0, I ' [i]=I " [i]=BF
[i]；If S [i]=1,It calculatesI″}；To every
One file encryption ci=E (idi,k)；
Wherein, S [i] is split vector for dividing Bloom filter BF [i]；I ' [i] and I " [i] is Bloom filter BF
[i] transformed vector is used for encrypting；
(1.4) data upload, and array D, Bloom filter BF and ciphertext set c are uploaded to server by user；
(2) user searches for data:
(2.1) inquiry request generates；
(2.2) server search；
(2.3) data return；
(3) user, which sends, updates request of data.
Further, to each keyword in the step (1)It is iterated the process of encryption are as follows:
(A) from d (wi) in extract a file label id every times；
(B) array Cnt [w is searchedi], if Cnt [wi]=0, e0={ 0,1 }λ；
(C)Cnt[wi]=Cnt [wi]+1；
(D)es=Enc (es-1||ids,sk1)；Herein, e represents the ciphertext of iteration, the value range of s be [1, | d (wi)
|], | d (wi) | it indicates to include keyword wiThe total number of files of file set；
(E)D[ids]=F (ids||1,sk2), when flag=1 indicates that file exists, when flag=0 indicates that file has been deleted
It removes；
(F)BF[ids] [t]=1, t ∈ { h1(wi),h2(wi),…,hr(wi)}。
Further, the detailed process that inquiry request generates in the step (2.1) are as follows:
Key word of the inquiry isA keyword is selected firstUser searches array Cnt and T, obtains m=Cnt
[wi] andEstablish key word of the inquiryBloom filter bfq；It sendsTo service
Device.
Further, in the step (2.2) server search detailed process:
Server receivesAfterwards, according to the number of iterations m andDecryption is iterated to calculate；ei-1||
ids=Enc (ei,sk1), a primary acquisition one file label id and ciphertext e is decrypted, file label is used to and bfqIn calculating
Product, ciphertext e are used to be decrypted next time；It computes repeatedly m times, obtains m file label altogether.
Further, in the step (2.3) data return process are as follows: server calculation document label B F [id] with
bfqInner product, record qualified file label id；The corresponding ciphertext c of file label id is returned to user.
Further, the process of the step (3) are as follows:
Increase file dg, to each keyword wi∈D(dg), calculate corresponding iteration label ei, calculate Bloom filter
BF[dg], update local array Cnt and T, D [dg]=F (idg||1,sk2), send token={ BF [dg],cg,D[dg],add}
To server, server update Bloom filter BF and array D, c are added in ciphertext C；Delete file dg, calculate D [dg]=F
(idg||0,sk2) send token={ g, D [dg], del } give server, server update array D and the corresponding grand mistake of cloth of deletion
Filter BF [dg], delete ciphertext cg。
The utility model has the advantages that
Present invention iterative cryptographic technology, wiCorresponding All Files label (id1,id2…idt) successively iteration is carried out,
Finally obtain a ciphertext e.When search, user is wiCorresponding ciphertext e is sent to server, as long as server is successively decrypted
It can be obtained by all file labels t times, search corresponding qualified file further according to tag access Bloom filter.This
Technology of the invention based on iterative cryptographic can achieve same effect in the case where not having to building inverted index, tie index
Structure is more succinct, under the premise of protecting privacy, has reached efficient search effect.
Detailed description of the invention
Fig. 1 can search for Encryption Architecture schematic diagram to be in the prior art；
Fig. 2 is overall flow figure of the invention；
Fig. 3 is the specific flow chart of data owner's processing locality in the present invention；
Fig. 4 is the specific flow chart that user searches for data in the present invention；
Fig. 5 is that user sends the specific flow chart for updating request of data in the present invention；
Fig. 6 is experimental comparison figure in the present embodiment.
Specific embodiment
Technical solution of the present invention is described in detail below, but protection scope of the present invention is not limited to the implementation
Example.
As shown in Figure 1, the prior art can search in Encryption Architecture, user extracts corresponding close according to file set first
Key word set, then according to keyword establish search index, in local cipher file and index, later the ciphertext of file and plus
Index after close is uploaded to cloud server.When user wants to search some file, search voucher is established according to search key,
It is then sent to Cloud Server, after server receives inquiry request, search index returns to corresponding ciphertext.Such prior art
The problems of be: file injection attacks, when file is updated or is repeatedly inquired the same keyword, meeting
It is contacted between leakage keyword and file.
As shown in Fig. 2, the multi-key word cipher text retrieval method in a kind of cloud environment of the invention based on iterative cryptographic, successively
The following steps are included:
(1) data owner local initialization process: system initialization establishes index, encrypted indexes and file and data
It uploads；
(2) user searches for data: inquiry request generates, server search and data return；
(3) user, which sends, updates request of data.
Fig. 3 is the specific flow chart of step (1) in the present invention；
(1) system initialization process the following steps are included:
1) security parameter a λ, SKE, Gen (1 is selectedλ) it is key schedule, choose matrix M1、With
Vector S ∈ { 0,1 }m；
2) key, sk are generated1、sk2←SKE.Gen(1λ)。
(2) index establishment process the following steps are included:
1) keyword is extracted from file set dSelect r hash function；hj∈[1,r]=
{hj|j∈[1,r],hj:{0,1}*→{0,1}l}；
2) initialize array Cnt, T and D, Bloom filter BF；(Cnt array recording key goes out in different files
Existing number, that is, have recorded the number of its iteration in an iterative process, and the corresponding file label iteration of array T recording key adds
Ciphertext after close, array D have recorded file status, if having deleted.)
To each keyword
(A) from d (wi) in extract a file label id every times；
(B) array Cnt [w is searchedi], if Cnt [wi]=0, e0={ 0,1 }λ；
(C)Cnt[wi]=Cnt [wi]+1；
(D)es=Enc (es-1||ids,sk1)；Herein, e represents the ciphertext of iteration, the value range of s be [1, | d (wi)
|], | d (wi) | it indicates to include keyword wiThe total number of files of file set；
(E)D[ids]=F (ids||1,sk2), when flag=1 indicates that file exists, when flag=0 indicates that file has been deleted
It removes；
(F)BF[ids] [t]=1, t ∈ { h1(wi),h2(wi),…,hr(wi)}。
(3) encrypted indexes and file processes the following steps are included:
To each Bloom filter, if S [i]=0, I ' [i]=I " [i]=BF [i]；If S [i]=1,It calculatesTo each file encryption ci=E
(idi,k)。
(4) data upload process the following steps are included:
1) array D, Bloom filter BF and ciphertext set c are uploaded to server by user.
Fig. 4 is the specific flow chart of step (2) in the present invention；
(1) inquiry request generating process the following steps are included:
Key word of the inquiry isA keyword is selected firstUser searches array Cnt and T, obtains m=Cnt
[wi] andEstablish key word of the inquiryBloom filter bfq；It sendsTo server.
(2) server search process the following steps are included:
Server receivesAfterwards, according to the number of iterations m andDecryption is iterated to calculate；ei-1||
ids=Enc (ei,sk1), a primary acquisition one file label id and ciphertext e is decrypted, file label is used to and bfqIn calculating
Product, ciphertext e are used to be decrypted next time；It computes repeatedly m times, obtains m file label altogether.
(3) data return course the following steps are included:
1) server calculation document label B F [id] and bfqInner product, record qualified file label id；
2) the corresponding ciphertext c of file label id is returned to user.
Fig. 5 is the specific flow chart of step (3) in the present invention；
Data procedures are updated the following steps are included: increasing file dg, to each keyword wi∈D(dg), it calculates corresponding
Iteration label ei, calculate Bloom filter BF [dg], update local array Cnt and T, D [dg]=F (idg||1,sk2), it sends
Token={ BF [dg],cg,D[dg], add } give server, server update Bloom filter BF and array D, cgIt is added to close
In literary C；Delete file dg, calculate D [dg]=F (idg||0,sk2) send token={ g, D [dg], del } give server, service
Device updates array D and deletes corresponding Bloom filter BF [dg], delete ciphertext cg。
Embodiment:
The present embodiment is with Request For Comments (RFC document), as test file collection.It is had chosen in experiment
5000 files screen 5000 keywords and are tested.Programming language is java, and machine is configured to Windows7 system,
Intel Core i5 (3.2GHZ, 8GB RAM).Pseudo-random function and symmetric encipherment algorithm all use aes algorithm in scheme.
As shown in fig. 6, option b EIS- I, BEIS- II are linearly related with file set size, because Cloud Server executes
Primary search needs to be traversed for all file index vectors, so the complexity of its search is θ (#d).IEDSE of the present invention is used
Identical effect also may be implemented in the case where not needing inverted index in the searching skill of iterative cryptographic, and search is answered
Miscellaneous degree is θ (#d (w)), and search efficiency has promotion.Furthermore the present invention is realized very well between hiding keyword and file label
Relationship, weigh between privacy and efficiency.
The present invention is apparently higher than BEIS scheme on search efficiency, because BEIS scheme needs to be traversed for entire text in search
Part index vector.
Secret protection explanation of the invention:
In view of the content that Cloud Server is got, the file set respectively encrypted, the index and multiple queries of encryption
Trapdoor.Safety analysis is carried out respectively to these three aspects below.
(1) privacy of file set.In the present invention, the file set being stored in Cloud Server passes through AES encryption algorithm for encryption,
The privacy of file set can be protected.In addition, symmetric key is that data owner by safe channel is shared with data consumer,
And it is both believable, it ensure that the safety of key.(symmetric encipherment algorithm is used when the plaintext of encryption file, index
Encryption uses iterative cryptographic).
(2) privacy is indexed.The present invention before the index of Cloud Server is only used to Bloom filter, in addition to letting out for file label
Except dew, server not can know that any information of keyword, can be avoided server and attacks to the statistics of keyword and file pair
It hits, has effectively resisted file injection attacks.
(3) trapdoor is inquired.Search index vector uses the kNN method encryption of safety, can guarantee the machine for inquiring thresholding
Close property.
Claims (6)
1. the multi-key word cipher text retrieval method in a kind of cloud environment based on iterative cryptographic, it is characterised in that: the following steps are included:
(1) data owner's processing locality
(1.1) system initialization: selection security parameter λ, matrix M1、With vector S ∈ { 0,1 }m；SKE.Gen(1λ)
For key method of formation, key sk is generated1、sk2←SKE.Gen(1λ)；
(1.2) index is established:
(1.2.1) extracts keyword from file set dSelect r hash function；hJ ∈ [1, r]=
{hj| j ∈ [1, r], hj: { 0,1 }*→ { 0,1 }l}；
(1.2.2) initialize array Cnt, T, D and Bloom filter BF；Wherein, Cnt array recording key is in different files
The number of middle appearance, the ciphertext after the corresponding file label iterative cryptographic of array T recording key, array D record file status；
(1.2.3) is to each keywordIt is iterated encryption respectively；I ∈ [1, n], n indicate keyword total number；
(1.2.4) array T records the ciphertext T [w after each keyword and its corresponding iterative cryptographici, ei]；
(1.3) encrypted indexes and file；To each Bloom filter, if S [i]=0, I ' [i]=I " [i]=BF [i]；Such as
FruitIt calculates To each file
Encrypt ci=E (idi, k)；
Wherein, S [i] is split vector for dividing Bloom filter BF [i]；I ' [i] and I " [i] is Bloom filter BF [i]
Transformed vector is used for encrypting；
(1.4) data upload, and array D, Bloom filter BF and ciphertext set c are uploaded to server by user；
(2) user searches for data:
(2.1) inquiry request generates；
(2.2) server search；
(2.3) data return；
(3) user, which sends, updates request of data.
2. the multi-key word cipher text retrieval method in cloud environment according to claim 1 based on iterative cryptographic, feature exist
In: to each keyword in the step (1)It is iterated the process of encryption are as follows:
(A) from d (wi) in extract a file label id every times；
(B) array Cnt [w is searchedi], if Cnt [wi]=0, e0={ 0,1 }λ；
(C)Cnt[wi]=Cnt [wi]+1；
(D)es=Enc (es-1||ids, sk1)；Herein, e represents the ciphertext of iteration, the value range of s be [1, | d (wi) |], | d
(wi) | it indicates to include keyword wiThe total number of files of file set；
(E)D[ids]=F (ids| | 1, sk2), when flag=1 indicates that file exists, when flag=0 indicates that file has been deleted；
(F)BF[ids] [t]=1, t ∈ { h1(wi), h2(wi) ..., hr(wi)}。
3. the multi-key word cipher text retrieval method in cloud environment according to claim 1 based on iterative cryptographic, feature exist
In: the detailed process that inquiry request generates in the step (2.1) are as follows:
Key word of the inquiry isA keyword is selected firstUser searches array Cnt and T, obtains m=Cnt [wi]
WithEstablish key word of the inquiryBloom filter bfq；It sendsTo server.
4. the multi-key word cipher text retrieval method in cloud environment according to claim 1 based on iterative cryptographic, feature exist
In: the detailed process of server search in the step (2.2):
Server receivesAfterwards, according to the number of iterations m andDecryption is iterated to calculate；ei-1||ids=
Enc(ei, sk1), a primary acquisition one file label id and ciphertext e is decrypted, file label is used to and bfqInner product is calculated, it is close
Literary e is used to be decrypted next time；It computes repeatedly m times, obtains m file label altogether.
5. the multi-key word cipher text retrieval method in cloud environment according to claim 1 based on iterative cryptographic, feature exist
In: the process that data return in the step (2.3) are as follows: server calculation document label B F [id] and bfqInner product, record symbol
The file label id of conjunction condition；The corresponding ciphertext c of file label id is returned to user.
6. the multi-key word cipher text retrieval method in cloud environment according to claim 1 based on iterative cryptographic, feature exist
In: user sends the process of update request of data in the step (3) are as follows:
Increase file dg, to each keyword wi∈D(dg), calculate corresponding iteration labelCalculate Bloom filter BF
[dg], update local array Cnt and T, D [dg]=F (idg| | 1, sk2), send token={ BF [dg], cg, D [dg], add } it gives
Server, server update Bloom filter BF and array D, cgIt is added in ciphertext C；Delete file dg, calculate D [dg]=F
(idg| | 0, sk2) send token={ g, D [dg], del } give server, server update array D and the corresponding grand mistake of cloth of deletion
Filter BF [dg], delete ciphertext cg。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810860176.2A CN109213731B (en) | 2018-08-01 | 2018-08-01 | Multi-keyword ciphertext retrieval method based on iterative encryption in cloud environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810860176.2A CN109213731B (en) | 2018-08-01 | 2018-08-01 | Multi-keyword ciphertext retrieval method based on iterative encryption in cloud environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109213731A true CN109213731A (en) | 2019-01-15 |
| CN109213731B CN109213731B (en) | 2021-05-14 |
Family
ID=64990417
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810860176.2A Active CN109213731B (en) | 2018-08-01 | 2018-08-01 | Multi-keyword ciphertext retrieval method based on iterative encryption in cloud environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109213731B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109933618A (en) * | 2019-03-08 | 2019-06-25 | 西安电子科技大学 | A kind of novel encryption data digging system |
| CN111767364A (en) * | 2019-03-26 | 2020-10-13 | 钉钉控股（开曼）有限公司 | Data processing method, device and equipment |
| CN111797425A (en) * | 2019-04-02 | 2020-10-20 | Sap欧洲公司 | Secure database with dictionary coding |
| CN113132085A (en) * | 2021-04-14 | 2021-07-16 | 上海同态信息科技有限责任公司 | Ciphertext query method based on searchable encryption |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9141658B1 (en) * | 2007-09-28 | 2015-09-22 | Emc Corporation | Data classification and management for risk mitigation |
| CN106599719A (en) * | 2016-12-12 | 2017-04-26 | 西安电子科技大学 | Ciphertext retrieval method supporting efficient key management |
| CN107220343A (en) * | 2017-05-26 | 2017-09-29 | 福州大学 | Chinese multi-key word Fuzzy Sorting cipher text searching method based on local sensitivity Hash |
| WO2018059142A1 (en) * | 2016-09-27 | 2018-04-05 | 腾讯科技（深圳）有限公司 | Information sending method and apparatus, and storage medium |
| CN107948146A (en) * | 2017-11-20 | 2018-04-20 | 武汉科技大学 | A kind of connection keyword retrieval method based on encryption attribute in mixed cloud |
-
2018
- 2018-08-01 CN CN201810860176.2A patent/CN109213731B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9141658B1 (en) * | 2007-09-28 | 2015-09-22 | Emc Corporation | Data classification and management for risk mitigation |
| WO2018059142A1 (en) * | 2016-09-27 | 2018-04-05 | 腾讯科技（深圳）有限公司 | Information sending method and apparatus, and storage medium |
| CN106599719A (en) * | 2016-12-12 | 2017-04-26 | 西安电子科技大学 | Ciphertext retrieval method supporting efficient key management |
| CN107220343A (en) * | 2017-05-26 | 2017-09-29 | 福州大学 | Chinese multi-key word Fuzzy Sorting cipher text searching method based on local sensitivity Hash |
| CN107948146A (en) * | 2017-11-20 | 2018-04-20 | 武汉科技大学 | A kind of connection keyword retrieval method based on encryption attribute in mixed cloud |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109933618A (en) * | 2019-03-08 | 2019-06-25 | 西安电子科技大学 | A kind of novel encryption data digging system |
| CN111767364A (en) * | 2019-03-26 | 2020-10-13 | 钉钉控股（开曼）有限公司 | Data processing method, device and equipment |
| CN111767364B (en) * | 2019-03-26 | 2023-12-29 | 钉钉控股（开曼）有限公司 | Data processing method, device and equipment |
| CN111797425A (en) * | 2019-04-02 | 2020-10-20 | Sap欧洲公司 | Secure database with dictionary coding |
| CN111797425B (en) * | 2019-04-02 | 2024-04-19 | Sap欧洲公司 | Secure database using dictionary coding |
| CN113132085A (en) * | 2021-04-14 | 2021-07-16 | 上海同态信息科技有限责任公司 | Ciphertext query method based on searchable encryption |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109213731B (en) | 2021-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112800088B (en) | Database ciphertext retrieval system and method based on bidirectional security index | |
| CN104765848B (en) | What support result efficiently sorted in mixing cloud storage symmetrically can search for encryption method | |
| US9275250B2 (en) | Searchable encryption processing system | |
| CN106612320B (en) | A kind of De-weight method of encryption data in cloud storage | |
| CN109213731A (en) | Multi-key word cipher text retrieval method in cloud environment based on iterative cryptographic | |
| CN106326360A (en) | Fuzzy multi-keyword retrieval method of encrypted data in cloud environment | |
| CN108256031B (en) | Multi-source encrypted image retrieval method supporting privacy protection | |
| EP3058678A1 (en) | System and method for dynamic, non-interactive, and parallelizable searchable symmetric encryption | |
| CN102024054A (en) | Ciphertext cloud-storage oriented document retrieval method and system | |
| CN109471964A (en) | A kind of fuzzy multi-key word based on synset can search for encryption method | |
| CN106599719A (en) | Ciphertext retrieval method supporting efficient key management | |
| CN108400970A (en) | Set of metadata of similar data message locking encryption De-weight method, cloud storage system in cloud environment | |
| Rizomiliotis et al. | ORAM based forward privacy preserving dynamic searchable symmetric encryption schemes | |
| CN111026788A (en) | Homomorphic encryption-based multi-keyword ciphertext sorting and retrieving method in hybrid cloud | |
| CN103970889A (en) | Security cloud disc for Chinese and English keyword fuzzy search | |
| CN108416037A (en) | Centric keyword cipher text searching method based on two-stage index in cloud environment | |
| CN106874379B (en) | Ciphertext cloud storage-oriented multi-dimensional interval retrieval method and system | |
| CN108549701A (en) | Cloud environment encrypts outsourcing data semantic extended search method and system | |
| CN110737912A (en) | thesis duplicate checking method based on homomorphic encryption | |
| CN110928980A (en) | Ciphertext data storage and retrieval method for mobile cloud computing | |
| CN106789007B (en) | Network information examination method and system based on ciphertext retrieval | |
| Sun et al. | Research of data security model in cloud computing platform for SMEs | |
| Handa et al. | An efficient approach for secure information retrieval on cloud | |
| CN109165226B (en) | Searchable encryption method for ciphertext large data set | |
| Nepolean et al. | Privacy preserving ranked keyword search over encrypted cloud data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230719 Address after: 606, Building 8, Nan'an Ruizhi, No. 99, Shengtai Road, Jiangning District, Nanjing, Jiangsu Province, 210000 Patentee after: Jiangsu Qingxin Technology Co.,Ltd. Address before: 230000 No. 111 Kowloon Road, Hefei Economic Development Zone, Anhui Patentee before: ANHUI University |