Improvement of a remote data possession checking protocol from algebraic signatures

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Yu, Y., Ni, J., Ren, J., Wu, W., Chen, L., & Xia, Q. (2014). Improvement of a remote data possession checking protocol from algebraic signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8434 LNCS, pp. 359–372). Springer Verlag. https://doi.org/10.1007/978-3-319-06320-1_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free