Proof of Storage Algorithm for a Decentralized Cloud System

This paper proposes a new proof-of-storage algorithm for decentralized cloud systems. The algorithm allows an untrusted host to prove data storage and integrity, while the auditing host receives reliable proof of data storage and integrity. The algorithm is based on time-distributed random sampling of data segments from the checked file, their conversion and comparison with the original. The algorithm is implemented in an integrated development environment, analyzed the accuracy of the algorithm, performance and tamper resistance. The efficiency of the algorithm is compared with the Merkle cryptographic protocol and the "seed planting" method currently used in decentralized storage systems. The proposed algorithm, in contrast to the considered algorithms, provides evidence of data storage without resource-intensive operations, such as dividing files into parts, calculating checksums of these parts, and transferring parts to the checking host. Hacking resistance is evaluated by calculating the probability of a successful "brute-force" attack. The algorithm showed high-performance and high hacking resistance.