Abstract

A new fully secure ciphertext-policy attributed based encryption (CP-ABE) scheme with high expressibity access policy is presented. Our CP-ABE scheme uses tree-based access structure which includes AND, OR, threshold and NOT gates which granted high degree of expressibility for encryptor to make an access policy. Moreover, our scheme achieves full security CP-ABE definition where any access structure can be chosen as the challenge ciphertext. The proposed CP-ABE uses composite bilinear groups and dual encryption paradigm to achieve full security CP-ABE definition. We argue that our CPABE scheme is secure and feasible.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.