An Efficient Provable Multi-copy Data Possession Scheme with Data Dynamics

摘要

A user can use a provable multi-copy data possession schemes (PMDP) to ascertain whether its copies in cloud storage are kept securely. Unfortunately, all existing PMDP are not secure and efficient. To address this problem, we propose an efficient provable multi-copy data possession scheme with data dynamics (EPMDP). We design a kind of authenticated 2-3 tree with arrays in ordered leaves (A2-3AOL) and use the A2-3AOL and a kind of RSA tag to construct EPMDP. The analysis results of the security and performance show that EPMDP has strong security and good performance.