RACC: An efficient and revocable fine grained access control model for cloud storage

Dhal, Kasturi; Pattnaik, Prasant Kumar; Champati, Satyananda

doi:10.3233/kes-190396

Cited by 5 publications

(7 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For attribute revocation, the related AAs need to communicate with nonrevoked users, who hold the key with the revoked attribute and also the CSP for update the ciphertext. The communication cost of the scheme [37] is less than our scheme and the scheme [12]. Our scheme and the scheme [12] have almost the same communication overhead when the key is updated, but when updating the ciphertext, our scheme is encouraging over the scheme [12] .…”

Section: ) Communication Overheadmentioning

confidence: 84%

“…The users need to periodically contact the server to update their key and the server must be honest. Some schemes used the updated version number to generate the updated key by the attribute authority to revoke attributes [35][36][37]. In the scheme [38][39][40], the cloud is used to perform the revocation process.…”

Section: ) Attribute Revocationmentioning

confidence: 99%

“…The scheme in [19] has stronger outsourcing capabilities than the one in [22,37] and our scheme is based on the scheme [12], so we compare our scheme with the scheme [12] and [19]. Experiments are implemented on a Windows 10 system with an AMD A8-7410 CPU at 2.20GHz and 12.00 GB RAM by using Java.…”

Section: B Experiments Analysismentioning

confidence: 99%

“…The number of attributes corresponding to the access structure set to 50 and the number of revoked attributes is ranging from 5 to 25. For the key update, our scheme only picks [12] nattrp (4 n uid +1)p [19] p (n uid +3)p [22] (2nattr + n AA ) p p [37] 2nattrp (n uid +1)p Our scheme p (2n uid +2)p [12] (2+2n CT )te (3n uid +1) tp+dte [19] 4te tp [22] (6n CT +n AA,CT +1)te te [37] 2n CT tp+3n CT te te Our scheme 3te tp more random elements than the scheme [12], so the curves almost coincide. For the ciphertext update, the scheme [12] needs to update all the components of the ciphertext, while our scheme only needs to update the ciphertext components related to the revoked attribute.…”

Section: B Experiments Analysismentioning

confidence: 99%

“…To sum up, the experimental results show that our scheme incurs less computation cost on the encryption of data owner, the decryption of data user, and the process of ciphertext update. [12] 4n uid p ((4+2n node )n CT +4)p [19] -- [22] -- [37] p p our scheme-user revocation p our scheme-attribute revocation 4n uid p (n node +1) nrp…”

Section: B Experiments Analysismentioning

confidence: 99%

See 4 more Smart Citations

Efficient Attribute-Based Encryption Outsourcing Scheme With User and Attribute Revocation for Fog-Enabled IoT

Zheng

Li³

2020

IEEE Access

View full text Add to dashboard Cite

With the rapid growth of Internet of Things (IoT) applications, fog computing enables the IoT to provide efficient services by extending the cloud computing paradigm to the edge of the network. However, the existing attribute-based encryption schemes rarely focus on user and attribute revocation in fog computing and most of them still impose high computational and storage overhead on resource-limited IoT devices. In this paper, we propose an efficient attribute-based encryption outsourcing scheme with user and attribute revocation for fog-enabled IoT. The proposed scheme improves the existing encryption scheme that uses the concept of attribute groups to achieve attribute revocation, making it suitable for fog computing and improving the efficiency of ciphertext update. In addition, it implements a novel method of user revocation in fog computing based on the characteristics of fog computing. In order to reduce the computing and storage burden of IoT devices, the heavy computation operations of encryption and decryption are outsourced to fog nodes and part of secret keys are stored in fog nodes. The security analysis shows that the proposed scheme is secure under the Decisional Bilinear Diffie-Hellman (DBDH) assumption. The performance analysis shows that the proposed scheme has high revocation efficiency and is efficient enough to be deployed in practical fog computing. INDEX TERMS Fog computing, attribute-based encryption, revocation, outsourcing, access control.

show abstract

Section: ) Communication Overheadmentioning

confidence: 84%

Section: ) Attribute Revocationmentioning

confidence: 99%

Section: B Experiments Analysismentioning

confidence: 99%

Section: B Experiments Analysismentioning

confidence: 99%

Section: B Experiments Analysismentioning

confidence: 99%

See 3 more Smart Citations

Efficient Attribute-Based Encryption Outsourcing Scheme With User and Attribute Revocation for Fog-Enabled IoT

Zheng

Li³

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

Supporting dynamic update scheme for assured deletion based-multi-copy association tree

2023

View full text Add to dashboard Cite

As one of the most important cloud computing services, cloud storage provides storage resources for resource-constrained users, which reduces their local overhead and computing cost. As an extension of cloud computing, fog computing introduces a fog layer between the cloud and users to deploy computing, storage, and other types of equipment, allowing users to operate outsourced data conveniently. Although cloud storage brings many conveniences to users, assured data deletion is still one of the crucial security challenges. In addition, since cloud servers usually store data in a decentralized manner, it is difficult for users to centrally and securely operate data blocks. This paper proposes an efficient and secure cloud data deletion scheme (SDUS-AD) that supports dynamic data updates in multi-copy scenarios. In this scheme, a new dynamic structure is designed, which improves the traditional Merkle hash tree, thereby realizing the dynamic update of outsourced data efficiently and safely. A cloud-fog-user layer structure is used to meet the needs of resourceconstrained users (such as mobile users) to update data, and a secure and trusted fog cluster is constructed using the trusted cloud platform management model based on TPM alliance to ensure the confidentiality of data privacy. Security analysis shows that SDUS-AD meets real-world security requirements. Detailed performance analysis and simulation experiments show that SDUS-AD is efficient, safe, and feasible.

show abstract

Role and Object Domain-Based Access Control Model for Graduate Education Information System

Jin

Wang

Yang

et al. 2020

Procedia Computer Science

View full text Add to dashboard Cite

RACC: An efficient and revocable fine grained access control model for cloud storage

Cited by 5 publications

References 19 publications

Efficient Attribute-Based Encryption Outsourcing Scheme With User and Attribute Revocation for Fog-Enabled IoT

Efficient Attribute-Based Encryption Outsourcing Scheme With User and Attribute Revocation for Fog-Enabled IoT

Supporting dynamic update scheme for assured deletion based-multi-copy association tree

Role and Object Domain-Based Access Control Model for Graduate Education Information System

Contact Info

Product

Resources

About