Abstract
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.
Highlights
In cloud storage application mode, users enjoy the benefits of flexible space, real-time sharing, disaster tolerance, and other benefits
When users want to delete data stored in the cloud, how to ensure that the deleted data will not be recovered by the cloud server or attackers, that is, assured deletion of cloud data, is a key issue to be solved in the field of cloud storage security
Under the common working mode of block ciphers (e. g., ECB and CBC), if an attacker has the key, the intercepted cipher fragments can be decrypted. To deal with these threats, this paper presents a cloud data assured deletion scheme based on strong nonseparability
Summary
In cloud storage application mode, users enjoy the benefits of flexible space, real-time sharing, disaster tolerance, and other benefits. G., ECB and CBC), if an attacker has the key, the intercepted cipher fragments can be decrypted To deal with these threats, this paper presents a cloud data assured deletion scheme based on strong nonseparability. The strong nonseparability ensures that recovering any part of the original data without the complete cipher data is computationally infeasible, significantly enhancing the nonrecoverability of the data after the deletion operation. This scheme achieves the strong nonseparability by confusing data blocks directly participating in cryptographic operations through XOR operation, which reduces the number of cryptography computations. It has obvious performance advantages and stronger security over existing similar assured deletion schemes
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
