Research On Key Technologies Of Data Sharing Based On Blockchain

As a valuable resource that has affected all aspects of people's daily life,data has huge potential for mining and is receiving more and more attention.Data has entered the time of mass production and application,and the development of network services has promoted this development.Data has become an asset,data sharing and trading have become the internal driving force to lead the progress of society.The development of data sharing solutions based on blockchain technology is not yet mature and complete,although it has been widely used.In the process of data sharing,the application of consensus mechanism and access control mechanism has low data sharing efficiency,poor system reliability,poor data privacy,and user access rights.Dynamic changes and other issues.This article solves the above problems by improving and optimizing the consensus mechanism and access control mechanism in data sharing based on blockchain.The main research contents and innovation points are as follows:1.In view of the low efficiency and poor security of the consensus mechanism applied in data sharing,a DPo S-PBFT(Delegated Proof of Stake-Practical Byzantine Fault Tolerance)consensus algorithm is proposed.First,the proxy node is elected according to the DPo S(Delegated Proof of Stake)algorithm.Then,the agent node monitors the network message,and the agent node on duty packs the block and sends it to the network.Next,the agent node verifies the packaged block according to the PBFT(Practical Byzantine Fault Tolerance)that can reduce security risks caused by the excessive power of the agent node,and ensures that data sharing is more reliable and efficient.Finally,the simulation experiment shows that the DPo S-PBFT consensus algorithm has good fault tolerance and security performance,while the consensus speed and throughput also have good performance through comparison.Although the range of fault tolerance is almost the same,the consensus speed of the algorithm is significantly better than the two models used for comparison.2.Aiming at the current data sharing solution ignoring the problem of access control after the data is shared on the chain and the user's access authority cannot be dynamically changed to meet actual needs,a CP-RABE(Ciphertext Policy-Revocable Attribute Based Encryption,Revocable attribute encryption based on ciphertext strategy)fine-grained access control algorithm.First,identify the attributes of users in the data sharing system.Then the user uses the CP-RABE algorithm to set the access strategy for the shared data and set the access authority for the data.Next,whether the user can access the data requires the verification of whether the user's attributes have been changed or withdrawn.Finally,the performance of the algorithm is analyzed.By comparing with CP-ABE(Ciphertext-Policy Attribute-Based Encryption,encryption based on ciphertext policy attributes)algorithm for communication overhead,computing overhead,and decryption time under different attribute numbers,it proves that although this algorithm adds the user attribute revocation function,But the performance is not much different from the CPABE algorithm.