Lightweight Revocable Hierarchical Attribute-Based Encryption for Internet of Things

Cloud data, the ownership of which is separated from their administration, usually contain users’ private information, especially in the fifth-generation mobile communication (5G) environment, because of collecting data from various smart mobile devices inevitably containing personal information. If it is not securely deleted in time or the result of data deletion cannot be verified after their expiration, this will lead to serious issues, such as unauthorized access and data privacy disclosure. Therefore, this affects the security of cloud data and hinders the development of cloud computing services seriously. In this paper, we propose a novel secure data deletion and verification (SDVC) scheme based on CP-ABE to achieve fine-grained secure data deletion and deletion verification for cloud data. Based on the idea of access policy in CP-ABE, we construct an attribute association tree to implement fast revoking attribute and reencrypting key to achieve fine-grained control of secure key deletion. Furthermore, we build a rule transposition algorithm to generate random data blocks and combine the overwriting technology with the Merkle hash tree to implement secure ciphertext deletion and generate a validator, which is then used to verify the result of data deletion. We prove the security of the SDVC scheme under the standard model and verify the correctness and effectiveness of the SDVC scheme through theoretical analysis and ample simulation experiment results.

show abstract

“…Given (g, g a , g b , g c ) and h ∈ G 2 , we need to decide if h � e(g, g) abc is true. [54]. No PPT attacker Att can distinguish quintuple…”

Section: Dbdh Definitionmentioning

confidence: 99%

CP-ABE-Based Secure and Verifiable Data Deletion in Cloud

Wang

Xiong

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…To solve the problem, the scheme [21] proposed a leakage-resilience CP-HABE scheme by introducing continuous leakage-resilience mechanism into the CP-ABE scheme. Later on, the work in [8] proposes a lightweight CP-HABE scheme to support flexibility and scalability and user revocation.…”

Section: Hierarchical Abe and Time-release Encryptionmentioning

confidence: 99%

“…First of all, we present the function comparison between our scheme and some existing related CP-ABE schemes, i.e., [8,12,37,[41][42][43], as shown in Table 2. We observe that our HTR-DAC scheme supports hierarchical authorities and users, time-sensitive data sharing, large universe, direct…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Nevertheless, all of these solutions suffer from different drawbacks, such as inflexibility, high computation complexity, and coarsegrained access control [5]. In recent years, prospective ciphertext-policy attribute-based encryption (CP-ABE) is proposed to control data access based on attributes to achieve flexibility and fine granularity [6][7][8][9]. In CP-ABE, data producers are required to designate a specific access policy to obtain the ciphertext of their data before outsourcing.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Hierarchical and Time-Sensitive Data Sharing with User Revocation in Mobile Crowdsensing

Zhang

Teng

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

Recently, cloud-based mobile crowdsensing (MCS) has developed into a promising paradigm which can provide convenient data sensing, collection, storage, and sharing services for resource-constrained terminates. Nevertheless, it also inflicts many security concerns such as illegal access toward user secret and privacy. To protect shared data against unauthorized accesses, many studies on Ciphertext-Policy Attribute-Based Encryption (CP-ABE) have been proposed to achieve data sharing granularity. However, providing a scalable and time-sensitive data-sharing scheme across hierarchical users with compound attribute sets and revocability remains a big issue. In this paper, we investigate this challenge and propose a hierarchical and time-sensitive CP-ABE scheme, named HTR-DAC, which is characteristics of time-sensitive data access control with scalability, revocability, and high efficiency. Particularly, we propose a time-sensitive CP-ABE for hierarchical structured users with recursive attribute sets. Moreover, we design a robust revocable mechanism to achieve direct user revocation in our scheme. We also integrate verifiable outsourced decryption to improve efficiency and guarantee correctness in decryption procedure. Extensive security and performance analysis is presented to demonstrate the security requirement satisfaction and high efficiency for our data-sharing scheme in MCS.

show abstract

“…Also, we see that LW-FGAC is the only scheme that simultaneously meets all the features given in the table. We refer the reader to [37][38][39][40][41][42][43][44], to see more references related to attribute-based systems and wireless sensor networks.…”

Section: Related Workmentioning

confidence: 99%

Lightweight Fine-Grained Access Control for Wireless Body Area Networks

Ali

Sadeghi

Liu

2020

Sensors

Self Cite

View full text Add to dashboard Cite

Wireless Body Area Network (WBAN) is a highly promising technology enabling health providers to remotely monitor vital parameters of patients via tiny wearable and implantable sensors. In a WBAN, medical data is collected by several tiny sensors and usually transmitted to a server-side (e.g., a cloud service provider) for long-term storage and online/offline processing. However, as the health data includes several sensitive information, providing confidentiality and fine-grained access control is necessary to preserve the privacy of patients. In this paper, we design an attribute-based encryption (ABE) scheme with lightweight encryption and decryption mechanisms. Our scheme enables tiny sensors to encrypt the collected data under an access control policy by performing very few computational operations. Also, the computational overhead on the users in the decryption phase is lightweight, and most of the operations are performed by the cloud server. In comparison with some excellent ABE schemes, our encryption mechanism is more than 100 times faster, and the communication overhead in our scheme decreases significantly. We provide the security definition for the new primitive and prove its security in the standard model and under the hardness assumption of the decisional bilinear Diffie-Hellman (DBDH) problem.

show abstract

Lightweight Revocable Hierarchical Attribute-Based Encryption for Internet of Things

Cited by 37 publications

References 58 publications

CP-ABE-Based Secure and Verifiable Data Deletion in Cloud

CP-ABE-Based Secure and Verifiable Data Deletion in Cloud

Efficient Hierarchical and Time-Sensitive Data Sharing with User Revocation in Mobile Crowdsensing

Lightweight Fine-Grained Access Control for Wireless Body Area Networks

Contact Info

Product

Resources

About