Name
Abstract | ||
|---|---|---|
Using cloud storage service, data owners can access their data anywhere at any time and enjoy the ondemand high quality applications and services, without the burden of local data storage and maintenance. Meanwhile, the risk of losing data stored with any untrustworthy service provider is the key barrier to widely adopt cloud storage service. To verify the integrity of data stored in cloud and relieve the security concerns of customers, a privacypreserving data possession checking (DPC) scheme is presented. This scheme uses Merkle Hash Tree to support fully dynamic data operations. To achieve robustness, forward error-correcting codes can be combined with the proposed DPC scheme, which can recover the data when a small amount of file has been corrupted. The scheme allows unlimited times verification without the need for the verifier to compare against the original data, which reduces the communication and computation complexity dramatically and preserves the privacy of the data. Extensive security analysis and simulation show that the proposed scheme is highly provably secure. © 2013 ACADEMY PUBLISHER. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.4304/jnw.8.12.2713-2720 | JNW |
Keywords | Field | DocType |
cloud computing,dynamic data possession checking,merkle hash tree,privacy-preserving | Computer science,Computer data storage,Computer network,Robustness (computer science),Service provider,Security analysis,Merkle tree,Dynamic data,Cloud storage,Cloud computing,Distributed computing | Journal |
Volume | Issue | Citations |
8 | 12 | 1 |
PageRank | References | Authors |
0.38 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenzhe Jiao | 1 | 1 | 0.38 |
| Guoqing Wang | 2 | 75 | 17.84 |
| Zhengjun Zhai | 3 | 25 | 12.39 |
| Xiaoxue Ye | 4 | 1 | 0.38 |