Abstract | ||
---|---|---|
Cloud storage allows cloud users to enjoy the on-demand and high quality data storage services without the burden of local data storage and maintenance. However, the cloud servers are not necessarily fully trusted. As a consequence, whether the data stored on the cloud are intact becomes a major concern. To solve this challenging problem, recently, Chen proposed a remote data possession checking (RDPC) protocol using algebraic signatures. It achieves many desirable features such as high efficiency, small challenges and responses, non-block verification. In this paper, we find that the protocol is vulnerable to replay attack and deletion attack launched by a dishonest server. Specifically, the server can either fool the user to believe that the data is well maintained but actually only a proof of the challenge is stored, or can generate a valid response in the integrity checking process after deleting the entire file of the user. We then propose an improved scheme to fix the security flaws of the original protocol without losing the desirable features of the original protocol. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1007/978-3-319-06320-1_27 | ISPEC |
Field | DocType | Citations |
Algebraic number,Computer data storage,Computer security,Computer science,Server,Cloud server,Possession (law),Replay attack,Cloud storage,Cloud computing | Conference | 2 |
PageRank | References | Authors |
0.38 | 24 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yong Yu | 1 | 35 | 3.69 |
Jianbing Ni | 2 | 333 | 30.26 |
Jian Ren | 3 | 215 | 31.07 |
Wei Wu | 4 | 4 | 0.75 |
Lanxiang Chen | 5 | 50 | 5.34 |
Qi Xia | 6 | 132 | 21.76 |