Blockchain-Based Secure and Reliable Distributed Deduplication Scheme
Due to the explosive growth of data volume on the Internet, deduplication techniques have been wildly used in cloud storage to save both disk space and network bandwidth. However, conventional deduplication schemes lead to problems with data reliability that can be attributed to the algorithm implem...
Saved in:
| Published in | Algorithms and Architectures for Parallel Processing Vol. 11334; pp. 393 - 405 |
|---|---|
| Main Authors | , , , |
| Format | Book Chapter |
| Language | English |
| Published |
Switzerland
Springer International Publishing AG
2018
Springer International Publishing |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 3030050505 9783030050504 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/978-3-030-05051-1_27 |
Cover
| Summary: | Due to the explosive growth of data volume on the Internet, deduplication techniques have been wildly used in cloud storage to save both disk space and network bandwidth. However, conventional deduplication schemes lead to problems with data reliability that can be attributed to the algorithm implementation where there is only one copy for each file stored in the cloud. Furthermore, the participation of trusted third party in most of the previous work has brought about the security challenge as single point of failure. In this paper, we propose a blockchain based deduplication scheme with high reliability and confidentiality in which the files are distributed to multiple servers and the information of files is recorded on the time-stamped blockchain whose central authorities are replaced to automatically decentralized smart contracts. Based on the proposed scheme, we present relevant protocols to achieve secure cloud storage derived from the consensus and incentive mechanism. Security analysis demonstrates that our deduplication scheme can achieve the proposed security goals while it has limited overhead proved by simulation experiments. |
|---|---|
| ISBN: | 3030050505 9783030050504 |
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/978-3-030-05051-1_27 |