PROJECT TITLE :
Hidden Ciphertext Policy Attribute-Based Encryption Under Standard Assumptions
We propose two new ciphertext policy attribute-based mostly encryption (CP-ABE) schemes where the access policy is outlined by AND-gate with wildcard. In the primary theme, we have a tendency to present a new technique that uses solely one cluster part to represent an attribute, whereas the present ABE schemes of the same kind need to use 3 completely different group components to represent an attribute for the three possible values (namely, positive, negative, and wildcard). Our new technique ends up in a new CP-ABE theme with constant ciphertext size, which, but, cannot hide the access policy used for encryption. The main contribution of this paper is to propose a replacement CP-ABE scheme with the property of hidden access policy by extending the technique we employed in the construction of our first scheme. In particular, we have a tendency to show a way to bridge ABE based mostly on AND-gate with wildcard with inner product encryption and then use the latter to attain the goal of hidden access policy. We tend to prove that our second scheme is secure below the quality decisional linear and decisional bilinear Diffie–Hellman assumptions.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here