SDASS: secure data auditing for sharing matrix based secret share cloud storage supporting data dynamics
Abstract While large data owners outsource their data to cloud for storage, this results in the security issues of data of all users. To provide users the means to verify whether the data is correctly and accurately stored in the cloud server or not, people have suggested many feasible scheme for da...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2025-05-01
|
| Series: | Journal of King Saud University: Computer and Information Sciences |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s44443-025-00008-3 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract While large data owners outsource their data to cloud for storage, this results in the security issues of data of all users. To provide users the means to verify whether the data is correctly and accurately stored in the cloud server or not, people have suggested many feasible scheme for data auditing. However, to cope with the problem of cloud server is still an urgently needs to be solved, therefore, we proposed a novel data auditing scheme of cloud storage for secret shares generated by sharing matrix, which is seldom discussed in present literatures. In the proposed scheme, the data owner first generates some secret shares through $$\left( k,n\right) $$ k , n sharing matrix, and then outsources these secret shares to different or the same cloud servers, then the skillfully designed protocols are provided to verify the data integrity of the cloud servers of different position, and the proposed protocols also support data dynamics updating. Moreover, mathematical analysis shows that the integrity verification of secret shares in cloud server can be obtained by the collaboration fulfillment of data verification in other cloud servers. Security analyses are given to assure that the proposed scheme can guarantee the privacy and security of data. The discussions and comparisons with some available methods are presented to show that lower computation cost and better performance are obtained for the proposed protocols. |
|---|---|
| ISSN: | 1319-1578 2213-1248 |