Hidden Ciphertext Policy Attribute-Based encoding below customary Assumptions

We advise new ciphertext policy attribute-based encryption (cp-abe) schemes in which the get entry to coverage is defined by using and-gate with wildcard. inside the first scheme, we present a brand new technique that uses only one organization element to represent an characteristic, while the prevailing abe schemes of the equal type want to use three one of a kind organization factors to represent an attribute for the three viable values (specifically, nice, negative, and wildcard). our new approach ends in a brand new cp-abe scheme with steady ciphertext size, which, however, cannot cover the get admission to policy used for encryption. the principle contribution of this paper is to endorse a brand new cp-abe scheme with the property of hidden get right of entry to policy by extending the approach we used inside the creation of our first scheme. specially, we display a way to bridge abe based totally on and-gate with wildcard with inner product encryption and then use the latter to obtain the purpose of hidden get admission to coverage. we show that our 2nd scheme is secure underneath the standard decisional linear and decisional bilinear diffie–hellman assumptions.