Multi-server conjunctive keyword searchable encryption scheme based on BDH problem
Searchable encryption is a cryptographic primitive that supports users to search for keywords on ciphertext.In view of the low efficiency of traditional single-server searchable encryption schemes,it was based on the advantages of identity management in certificate management.In the multi-serve envi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2020-02-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2020049/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Searchable encryption is a cryptographic primitive that supports users to search for keywords on ciphertext.In view of the low efficiency of traditional single-server searchable encryption schemes,it was based on the advantages of identity management in certificate management.In the multi-serve environment,a bilinear mapping was used to construct an identity-based encryption scheme that supports conjunctive keyword search.In this scheme,the storage and query of the encrypted data were allocated to different servers,and the retrieval efficiency of the user storage and keyword was improved by cooperation.Re-use the encryption and search ability of the connection keywords by using the identity of multi-server and user.At the same time,combine with the searchable encryption method of conjunctive keyword,a new security model was constructed based on bilinear pairing.And under the bilinear Diffie-Hellman problem,the scheme satisfies the ciphertext indistinguishability under selected message attack. |
|---|---|
| ISSN: | 1000-0801 |