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: | Yanhua LU, Youliang TIAN, Chen LIU |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2020-02-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/thesisDetails#10.11959/j.issn.1000-0801.2020049 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Two-way and anonymous heterogeneous signcryption scheme between PKI and IBC
by: Cai-fen WANG, et al.
Published: (2017-10-01) -
Query recovery attacks against conjunctive keyword searchable encryption
by: DU Ruiying, et al.
Published: (2024-08-01) -
Efficient ID-based certificateless signature scheme
by: LIU Jing-wei, et al.
Published: (2008-01-01) -
ID-based transitive signature schemes without random oracle
by: MA Xiao-long1, et al.
Published: (2010-01-01) -
Efficient certificateless sequential multi-signature scheme
by: Yan-lin QIN, et al.
Published: (2013-07-01)