A PROOF OF SECURITY FOR A KEY-POLICY RS-ABE SCHEME
A revocable-storage attribute-based encryption (RS-ABE) scheme is an encryption scheme which extends attribute-based encryption by introducing user revocation. A key-policy RS-ABE scheme links each key to an access structure. We propose a new key-policy RS-ABE scheme in composite order bilinear groups under variants of subgroup decision and composite Diffie-Hellman assumptions and we prove its security in terms of indistinguishability under a chosen-plaintext attack (IND-CPA).
key-policy, attribute-based encryption, indistinguishability under a chosen-plaintext attack, composite order bilinear group, subgroup decision problem, composite Diffie-Hellman problem.