Open AccessRSA CP-ABE with Access Tree Structure for Secure Revocable Scheme for Building Trust Model
Author(s) -
Rajashekar M. B,
S. Meenakshi Sundaram
Publication year - 2022
Publication title -
saudi journal of engineering and technology
Language(s) - English
Resource type - Journals
eISSN - 2415-6272
pISSN - 2415-6264
DOI - 10.36348/sjet.2022.v07i04.001
Subject(s) - computer science , encryption , computer security , cloud computing , public key cryptography , key (lock) , attribute based encryption , tree (set theory) , computer network , proxy re encryption , scheme (mathematics) , mathematics , operating system , mathematical analysis
Attribute-Based Encryption (ABE) can provide a technique of fine-grained control. The suggested Enhanced CP-ABE technique includes the use of a proxy to securely communicate the key to users. The Rivest Shamir Adleman (RSA) Algorithm secures outsourced big data in the cloud by allowing public key encryption to safeguard data transported across an unsecured network like the internet. During decryption, the proposed RSA CP-ABE with Access tree structure for Secure Revocable scheme for Building Trust model successfully identifies the users who decrypt the cipher messages. For Third Party auditing, the Dynamic Attribute Tree approach is proposed to encrypt data based on its attribute. The attributes, together with data and keys, are stored in a tree structure, which aids in improving the dynamic update of data in the cloud. Bilinear mapping is used by the Dynamic Attribute Tree approach to validate the integrity of the data without having to retrieve it from the cloud. The experimental results reveal that for a 256-bit key length, the proposed Scheme achieves encryption and decryption times of 1638 ms and 1102 ms, respectively.