This paper addresses the issue of attribute revocation in Ciphertext-Policy Attribute-Based Encryption (CP-ABE) schemes, focusing on practical scenarios where semi-trustable online proxy servers are available. The authors propose a solution that integrates proxy re-encryption with CP-ABE, enabling the authority to delegate most of the laborious tasks of user revocation to proxy servers. This approach minimizes the load on the authority and allows for efficient attribute revocation. The proposed scheme is formally analyzed and proven secure against chosen ciphertext attacks under the Decisional Bilinear Diffie-Hellman (DBDH) assumption. Additionally, the technique is shown to be applicable to Key-Policy Attribute-Based Encryption (KP-ABE) schemes. The paper includes detailed algorithm definitions, security proofs, and discussions on the applicability of the proposed method to KP-ABE and large universe constructions.This paper addresses the issue of attribute revocation in Ciphertext-Policy Attribute-Based Encryption (CP-ABE) schemes, focusing on practical scenarios where semi-trustable online proxy servers are available. The authors propose a solution that integrates proxy re-encryption with CP-ABE, enabling the authority to delegate most of the laborious tasks of user revocation to proxy servers. This approach minimizes the load on the authority and allows for efficient attribute revocation. The proposed scheme is formally analyzed and proven secure against chosen ciphertext attacks under the Decisional Bilinear Diffie-Hellman (DBDH) assumption. Additionally, the technique is shown to be applicable to Key-Policy Attribute-Based Encryption (KP-ABE) schemes. The paper includes detailed algorithm definitions, security proofs, and discussions on the applicability of the proposed method to KP-ABE and large universe constructions.