A proof of security for a key-policy RS-ABE scheme
This addresses security concerns in cryptographic systems with user revocation, but it is incremental as it builds on existing RS-ABE concepts.
The paper tackled the problem of proving security for a key-policy revocable-storage attribute-based encryption (RS-ABE) scheme, and the result was a new scheme with a formal security proof under indistinguishability under chosen-plaintext attack (IND-CPA).
A revocable-storage attribute-based encryption (RS-ABE) scheme is an encryption scheme which extends attribute-based encryption by intro- ducing user revocation. A key-policy RS-ABE scheme links each key to an access structure. We propose a new key-policy RS-ABE scheme whose security we prove in term of indistinguishability under a chosen-plaintext attack (IND-CPA).