Decentralized Multi-Authority Attribute-based Searchable Encryption Scheme

Attribute-based searchable encryption (ABSE) scheme is an efficient mechanism to implement access control and secure keywords search based on attributes over encrypted data. However, most existing ABSE schemes rely on single trusted authority to manage the attribute private keys. In real life, it is impractical that one authority completes all verifications and certifications to all attributes. In addition, the existence of the vulnerable item makes them be vulnerable to secret-key-recovery attack in some existing multi-authority attribute-based encryption (ABE) schemes based on access tree. To solve above problems, we design a decentralized multi-authority ABSE scheme based on access tree, which can resist the keyword guessing (KG) attack and the secret-keys-recovery attack. We also give performance analysis of the proposed scheme and prove it to be selectively secure under the decisional bilinear Diffie-Hellman (DBDH) assumption, the hash Diffie-Hellman (HDH) assumption and the bilinear Diffie-Hellman (BDH) assumption.