Efficient Ciphertext-Policy ABE with constant ciphertext length

Following the development of promising result of Ciphertext-Policy Attribute-based encryption (CP-ABE), in which every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on attributes. Decryption is enabled if and only if the user´s attribute set satisfies the ciphertext access structure. Apart from the proposed properties of CP-ABE, we propose a new construction of CP-ABE that significantly reduces the ciphertext to a very short constant size for any number of AND gate access policy on any number of attributes. Our scheme is proven CPA and CCA-secure under the Decisional Diffie Hellman assumption. Moreover we present the construction our CCA scheme with public key encryption non-interactive opening(PKENO) scheme and using CHK technique to achieve CCA secure.