Attribute-based encryption supporting arbitrary conjunctive key word search
A new searchable encryption scheme was proposed in prime order bilinear groups based on the attribute-based encryption and polynomial equation.The scheme,in which each conjunctive-keyword ciphertext can be searched by a number of users,may significantly reduce the overhead of network and sending nod...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2016-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016158/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A new searchable encryption scheme was proposed in prime order bilinear groups based on the attribute-based encryption and polynomial equation.The scheme,in which each conjunctive-keyword ciphertext can be searched by a number of users,may significantly reduce the overhead of network and sending nodes' computation in the application of fine-grained access control.Meanwhile,the scheme facilitates the flexibility of conjunctive search by supporting arbitrary conjunctive search of the keywords.At last,the performance was analyzed and compared with some recent conjunctive search schemes. |
|---|---|
| ISSN: | 1000-436X |