Abstract
We propose an efficient dual-policy Attribute Based Encryption (ABE), a logical combination of key-policy ABE and ciphertext-policy ABE, with short ciphertext for monotone access structures. We also present key-policy ABE schemes with constant-size ciphertexts for monotone as well as non-monotone access structures. While the secret key in all our schemes has quadratic size in the number of attributes, the number of bilinear pairing evaluations is reduced to constant. Compared with the available dual-policy and key-policy ABE schemes, our constructions provide better efficiency in terms of computation cost. All our schemes are provably secure under chosen plaintext attacks in selective-security model under the decisional n-Bilinear Diffie-Hellman Exponent assumption over prime order bilinear groups.
Sign-in/Register to access full text options 
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
