کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
455701 | 695530 | 2013 | 12 صفحه PDF | دانلود رایگان |

• An RDPC scheme based on homomorphic hashing is proposed.
• To enable data dynamics, the Merkle hash tree is introduced to record the location for each data operation in the scheme.
• The scheme provides provable data possession and integrity protection.
• The security and performance analysis shows that the scheme is practical for real-world use.
In cloud storage, storage servers may not be fully trustworthy. Therefore, it is of great importance for users to check whether the data is kept intact. This is the goal of remote data possession checking (RDPC) schemes. In this paper, an RDPC scheme based on homomorphic hashing is proposed. To enable data dynamics, the Merkle hash tree is introduced to record the location for each data operation in the scheme. Data dynamics, including the most general forms of data operations such as block modification, insertion and deletion, are supported. Our scheme provides provable data possession and integrity protection. The security and performance analysis shows that the scheme is practical for real-world use.
Figure optionsDownload as PowerPoint slide
Journal: Computers & Electrical Engineering - Volume 39, Issue 7, October 2013, Pages 2413–2424