Journal on Communications ›› 2016, Vol. 37 ›› Issue (8): 77-85.doi: 10.11959/j.issn.1000-436x.2016158

• Papers • Previous Articles     Next Articles

Attribute-based encryption supporting arbitrary conjunctive key word search

Yan SONG1,2,Zhen HAN1,Dong CHEN1,2,Jin-hua ZHAO2   

  1. 1 School of Computer and Information Technology,Beijing Jiaotong University,Beijing 100044,China
    2 Technology on Information Assurance Key Laboratory,Beijing 100072,China
  • Online:2016-08-25 Published:2016-09-01
  • Supported by:
    The National Natural Science Foundation of China;Discipline Construction and Graduate Edu-cation Foundation of Beijing Municipal Commission of Education

Abstract:

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.

Key words: searchable encryption, attribute-based encryption, conjunctive keyword, polynomial equation

No Suggested Reading articles found!