ICIC Express Letters   2016 年 10 卷 8 期

2016.08.01

In a predicate encryption scheme, a secret key associated with a predicate f can decrypt a ciphertext corresponding to an attribute I when f(I) = 1. The predicate encryption scheme which supports inner product enables more complex evaluation on CNF/DNF formulae. Recently, a fully secure predicate encryption scheme supporting inner product was presented by Okamoto et al. When converting this scheme into a searchable encryption scheme, it should be found that the space and time complexity in this scheme can be improved. According to this issue, we propose a new fully secure predicate encryption scheme supporting inner product. Based on our scheme, a more efficient searchable encryption scheme can be created with better space and time complexity.