Research Article
A Non-repudiable Dynamic Provable Data Possession
@INPROCEEDINGS{10.1007/978-3-030-21373-2_61, author={Jun-Feng Tian and Rui-Fang Guo and Xuan Jing}, title={A Non-repudiable Dynamic Provable Data Possession}, proceedings={Security and Privacy in New Computing Environments. Second EAI International Conference, SPNCE 2019, Tianjin, China, April 13--14, 2019, Proceedings}, proceedings_a={SPNCE}, year={2019}, month={6}, keywords={Cloud storage Provable data possession Stern-brocot Dynamic operation}, doi={10.1007/978-3-030-21373-2_61} }- Jun-Feng Tian
Rui-Fang Guo
Xuan Jing
Year: 2019
A Non-repudiable Dynamic Provable Data Possession
SPNCE
Springer
DOI: 10.1007/978-3-030-21373-2_61
Abstract
With the widespread popularity of cloud storage, cloud storage security issues have also received much attention. A provable data possession (PDP) scheme can effectively help users to verify the integrity of data stored remotely in the cloud. For this reason, the client’s PDP scheme is constantly improving and developing. In view of the problem that the existing PDP scheme pays less attention to the clients deceiving the cloud server, a non-repudiable dynamic PDP scheme based on the Stern-Brocot tree (SB-NR-DPDP) is proposed. We put forward a dynamic storage structure and dynamic operation algorithm based on the Stern-Brocot tree, so that it can satisfy the client’s dynamic data operations and realize the non-repudiation feature of the scheme. This scheme can resist hash value attacks, delete-insert attacks and tamper with cloud return value attacks. The theoretical analysis shows that the proposed scheme has less computing and storage overhead than other schemes.