| dc.description.abstract | Proof of Storage (PoS) is a scheme that proves the data is stored honestly. PoS is the general term for a collection of related proofs. Such as proof of retrievability and proof of data possession. In recent years, various PoS variants have been proposed, each with advantages. However, there is no protocol for auditing between peers without involving third-party auditors. This thesis proposes a protocol which allows auditing between peers without third-part involved. The protocol is fully implemented with Go coding language and deployed on the Swarm test network. The designed protocol is mainly based on proof of retrievability, proof of data possession and proof of replication. The proposed protocol uses a challenge-response protocol to send messages between nodes in a decentralised file storage system. Experiments show that our idea is feasible.
After experimenting with different test nodes, the results show that the efficiency of our proposed protocol is related to the number of redundant data chunks owned by the challenger and prover in the same network.
If either challenger or prover holds a relatively small amount of data chunks, our proposed protocol will have better performance. | |
