Provably Secure Identity-Based Encryption Scheme with Wildcard in the Standard Model
Ming Yan · Dianzi xuebao · 2013
Based on the bilinear pairings and hierarchical identity-based encryption,an identity-based encryption with wildcard is proposed to overcome the loose security reduction and computation inefficiency of the known schemes.Our proposed scheme is provably secure in the standard model which captures tight secure reduction.In our scheme,no pairing computation is needed in the encrypt algorithm and the decrypt algorithm requires only two pairings computations.A security analysis shows that the proposed scheme has the indistinguishability against adaptive chosen ciphertext and identity with wildcard attack under the assumption of Decision Modify Bilinear Diffie-Hellman Exponent.