Research And Implementation Of Trusted Storage System Based On Block Chain Technology

The rapid development of sensor network and Internet of Things technology has caused us to generate a large amount of data unknowingly.According to the 2020 industry report,the global data volume in 2020 is expected to exceed 40 ZB.Faced with the explosive growth of data,traditional centralized storage systems continue to erupt in accidents in terms of information security: data is easily tampered with,cannot be traced to the source,and is easily lost.In addition,the traditional centralized storage system has a serious single point of failure problem,which makes the stability of the system effectively unguaranteed.Even if the advanced multi-active mode is adopted,it is only physically independent in reality,and it can still only logically rely on the service capacity of the node.Blockchain technology is a new type of decentralized,distributed technology architecture,which has been fully applied in the financial field(Bitcoin).The research focus of this article is to design a decentralized,high-performance,trusted storage system based on blockchain technology that can protect data from tampering.In order to avoid witch attacks,the existing blockchain technology has adopted a proof of work(POW)algorithm as a consensus algorithm between nodes.Although the POW algorithm can reach consensus among nodes,a large amount of hash calculation wastes too much resources.If it is directly applied to the storage system,the response speed of the storage system will be greatly reduced,which cannot meet the needs of production.In the data storage scenario,since all storage nodes need to pass strict authentication to enter the distributed network.To some extent,it can be considered that the probability of a witch attack in the distributed storage system is low,and the benefits of using POW as the consensus algorithm is low.In view of this situation,based on the practical Byzantine fault tolerance(PBFT)algorithm,this paper proposes a high-performance blockchain consensus algorithm HPBFT,which is applicable to data storage scenarios,namely High Performance Byzantine Fault Tolerance algorithm.The HPBFT algorithm improves the shortcoming that the communication complexity of the prepare phase and the commit phase is still O(n ^ 2)without the Byzantine node in the PBFT algorithm.After optimization of the algorithm,the communication complexity of the HPBFT algorithm during the prepare phase and the commit phase can be reduced to O(n).At the same time,the HPBFT algorithm adds punitive measures to Byzantium nodes during view switching,which reduces the number of view switching occurrences and enhances the throughput and efficiency of the entire system.Based on HPBFT algorithm,this paper implements a distributed data storage system(Block Chain Storage System),and perform Integration test and comparison test.Experiments show that in case when the distributed system exist wrong node,it can still ensure the normal operation of the entire system.At the same time,HPBFT perform high performance compare to the PBFT and Pow in storage scenarios.