Research And Implementation Of Copyright Protection System Based On Blockchain Consensus Optimization

The popularity of the Internet and the rapid development of digital technology have greatly changed the mode of transmission of digital works,and the market scale of digital culture industry has also increased rapidly.However,with the progress of information technology,piracy has become increasingly rampant and has become one of the biggest challenges to digital copyright protection.China has relatively complete laws and regulations on copyright infringement,but the traditional copyright protection system still has room for optimization when facing digital copyright,such as complex copyright registration procedures,difficult to confirm rights,and difficult to ensure security in transactions.The characteristics of blockchain can well solve the above problems.In order to explore the application of blockchain in the field of copyright protection,this thesis studies the relevant technical content,including:Addressing the issue of high consensus communication overhead in practical Byzantine fault-tolerant algorithms.By assigning credit points to nodes,the behavior of nodes is constrained,and the fault nodes and Byzantine nodes participate in the consensus;Change the mutual communication between nodes to consensus.Each node should take its own calculation results as the standard.Compare the calculation results with the calculation results transmitted by the master node to determine whether to reach consensus;Using the node’s credit score,when selecting the master node in the view change phase,the node with higher score will be selected first,and the selected master node will be more reliable.Through the above three improvements,it will effectively reduce the communication overhead generated by the node during consensus,improve the efficiency of consensus,and save system resources.In addition,Addressing the issue of insufficient detection accuracy in similarity detection algorithms,This thesis is based on the Text Rank algorithm and uses the cosine similarity calculation method to quantify the results,and makes fine-grained improvements to the whole calculation process.The improvement mainly includes: analyze and calculate the text based on the features of part of speech and word frequency,and consider the contribution of different parts of speech to the final result;The weight between word frequency and part of speech is calculated by particle swarm optimization algorithm to find the optimal solution.This optimization will effectively improve the accuracy of similarity calculation.This thesis is divided into identity recognition modules based on functional modules,including login,registration,and user permission recognition functions;Article related functional modules,including article publishing,reading,forwarding,and other functions;The text similarity calculation module includes functions such as text abstract data generation and text similarity calculation before copyright authentication;The blockchain module includes functions such as uploading copyright data,storing and processing related transaction hashes,and displaying on chain data.At the same time,conduct detailed functional requirement analysis and system design for each module of the system.And the above two improved algorithms are applied in the system,with the improved practical Byzantine fault-tolerant algorithm applied in the blockchain module to improve data consensus efficiency.The fine-grained text duplication algorithm is applied in the text similarity calculation module,making the text similarity calculation have better results in this system.Based on this,build the overall system framework,complete the coding work of the system,and conduct functional and performance tests on the system.The copyright protection system optimized based on blockchain consensus has good plagiarism detection performance and faster data uploading speed,while effectively reducing the complexity of copyright registration,making copyright data tamper resistant,traceable,and trustworthy.