4.6 Article

Secure cloud file sharing scheme using blockchain and attribute-based encryption

Journal

COMPUTER STANDARDS & INTERFACES
Volume 87, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.csi.2023.103745

Keywords

Blockchain; Smart contract; Access control framework; Attribute -based encryption; Secure cloud storage

Ask authors/readers for more resources

This paper presents a novel collaboration scheme for secure cloud file sharing using blockchain and attribute-based encryption (ABE). The scheme utilizes a decentralized and fault-tolerant approach facilitated by smart contracts in blockchain, allowing data owners to control access to their files and preserving user anonymity. The scheme also supports fast revocation of user access without communication overhead. Through formal verification, the scheme is proven to be secure in terms of confidentiality and authentication. Evaluation results demonstrate the scalability and acceptable performance of the scheme for up to 20,000 users.
This paper presents a novel collaboration scheme for secure cloud file sharing using blockchain and attribute -based encryption(ABE). Blockchain enables us to implement access control as a smart contract between data owner and users. Each data owner creates its own smart contract where in a data user can request to access a specific file by registering a transaction. In response transaction, the data owner sends the required credential to the user thereby enabling her/him to decrypt the intended file on the cloud storage. This scheme is decentralized, fault tolerant and secured against DoS attacks. The cipher-key, which is used for file encryption, is embedded into a set of coefficients of a polynomial so-called access polynomial. It is attached to the encrypted file on the cloud storage as a metadata. The data user can restore the cipher-key by means of the credential receiving in response transaction and access polynomial. The data owner uses ABE scheme in response transaction to impose her/him access policy to the file as well as preserving user anonymity. This scheme supports fast revocation of the user access by means of updating the access polynomial coefficients and without any communication overhead to non-revoked users. Through formal verification, we show that the scheme is secure in terms of secrecy of credential information and authentication of participants. Finally, the evaluation results show that our scheme is scalable with acceptable performance up to 20,000 users.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available