Assured Data Deletion With Fine-Grained Access Control for Fog-Based Industrial Applications

Yu, Yong; Xue, Liang; Li, Yannan; Du, Xiaojiang; Guizani, Mohsen; Yang, Bo

doi:10.1109/tii.2018.2841047

Cited by 82 publications

(18 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zhang proposed an instantaneous deterministic deletion method of cloud storage data based on feature iteration [13], which extracts and classifies the features of redundant data in cloud storage data, iterates until convergence, and achieves high-performance deletion of redundant data. In addition, some assured deletion or selfdestruction schemes for cloud data based on DHT [10,14], attribute-based encryption [15][16][17][18], and identity-based encryption [19,20] are proposed in recent years. Xiong et al [21] made an in-depth analysis and comments on the related research work in recent years from three aspects: trusted execution environment, key management, and access control strategy.…”

Section: Related Workmentioning

confidence: 99%

Assured Deletion: A Scheme Based on Strong Nonseparability

Xie

et al. 2022

Journal of Sensors

View full text Add to dashboard Cite

Cloud storage services bring great convenience to users, but also make data owners lose direct control of their data. How to ensure that deleted cloud data can never be recovered by cloud servers or attackers is a key issue in the field of cloud storage security, which is important to protect user privacy and data confidentiality in the cloud environment. Most existing schemes have the drawbacks of overreliance on key destruction and having the ability to decrypt part of the ciphertext after cracking the key. To solve these problems, a novel cloud data assured deletion scheme based on strong nonseparability is presented. By combining XOR operation with the block cipher, the cipher data become strongly nonseparable; thus, destroying any piece of cipher data will result in unrecoverable original data. Theoretical analysis and experimental results both show that the scheme achieves the expected goals of assured deletion, which has obvious performance advantages and stronger security compared with similar schemes.

show abstract

Section: Related Workmentioning

confidence: 99%

Assured Deletion: A Scheme Based on Strong Nonseparability

Xie

et al. 2022

Journal of Sensors

View full text Add to dashboard Cite

show abstract

“…e user encrypts data with the KP-ABE algorithm. When the expired data needs to be deleted, the users cannot decrypt and access the data by revoking the attribute corresponding to the expired data and reencrypting the data [42]. Before the cloud data storage, the data is encrypted, and a digital signature is generated for each data block in the ciphertext by a hash operation.…”

Section: Abe-based Deletion and Verificationmentioning

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

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

“…For static and dynamic decision trees, the time complexity of the deduplication scheme was reduced with the help of interactive protocols. Yu et al had worked [13,16] on data deduplication in cloud storage. To some extent, these schemes tighten the security of the duplicated data, but the complexity of both the system and the Convergent Key management increases rapidly.…”

Section: Related Workmentioning

confidence: 99%

Zero knowledge based data deduplication using in-line Block Matching protocol for secure cloud storage

Kanagamani¹,

Muneeswaran²

2021

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

In the area of cloud computing, data deduplication enables the cloud server to store a single copy of data by eliminating redundant files to improve storage and network efficiency. Proof-of-Ownership (PoW) is a cryptographic function that verifies the user who really owns the data. Most of the existing schemes have tried to solve the deduplication problem by providing the same encryption key for identical data. However, these schemes suffer from dynamic changes in ownership management. In this paper, we propose a In-line Block Matching (IBM) protocol based on zero-knowledge proof for deduplication with dynamic ownership management, which eliminates the unauthorized access of sensitive data.In this proposed work, for a new file, the uploader randomly chooses a file encryption key and encrypts the file. The user also computes a unique proof for the uploaded file by dividing the file into number of blocks and stores this proof to the cloud server. The cloud server computes the group key for the ciphertext and re-encrypts it using this group key.The cloud server also does the proof verification against the subsequent uploader for an existing file. The cloud server is honest-but-curious, so the proposed scheme confirms that the cloud server does not know any information about file encryption key even though it plays a proxy role. The result shows that our proposed scheme protects the data from both cloud server and adversaries. Also the computational cost is comparatively less than other existing schemes.

show abstract

Assured Data Deletion With Fine-Grained Access Control for Fog-Based Industrial Applications

Cited by 82 publications

References 35 publications

Assured Deletion: A Scheme Based on Strong Nonseparability

Assured Deletion: A Scheme Based on Strong Nonseparability

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

Zero knowledge based data deduplication using in-line Block Matching protocol for secure cloud storage

Contact Info

Product

Resources

About