| Industrial Internet is a new application model that combines information technology such as artificial intelligence,cloud computing and big data with the industrial field.Among them,data,as the core element of the industrial Internet,can realize the generalized interconnection of all elements such as human,machine and object.At present,the data in the industrial Internet has many challenges such as difficult trust transfer,weak privacy protection and poor collaboration and sharing.In view of this,a large number of research institutions,enterprises and scholars have explored the mechanism of blockchain and industrial Internet integration to store industrial data with high requirements for security by using its tamper-evident characteristics.The existing industrial blockchain architecture faces problems such as storage capacity limitation,low data interaction efficiency,and single retrieval method vulnerable to attack.Combined with the advantage of storing massive data in off-chain database,on-chain and off-chain interaction can reduce storage cost.However,the construction mode and database indexing method of on-chain-off-chain interaction scheme based on Diffie-Hellman and traditional mapping architecture will bring problems such as high computational overhead and low retrieval efficiency as data volume increases.To address the above issues,the main work of this paper is as follows.(1)In order to improve the efficiency of data retrieve and reduce the redundancy of data storage performance under the industrial Internet domain.This paper proposes an efficient data interaction method applied to prefix-Hash of data and improved red-black tree index in combination with a trusted hardware execution environment,relying on the characteristics of the decentralized and tamper-evident blockchain technology.Without changing the characteristics of the blockchain,the features of the blockchain system are used to store the public index,and the form of the data structure similar to the hash query and the improved red-black tree is embedded in the on-chain block structure,and the off-chain storage corresponding to a large amount of raw data is considered.This storage method effectively improves the efficiency of retrieval interaction of industrial data in the blockchain.(2)When interacting with on and off chain data based on blockchain,off chain data still faces the risk of privacy leakage.Among them,the need to only obtain corresponding information for specific roles without disclosing the privacy of other partners is often not met.In this paper,we propose the use of Pedersen secret sharing scheme to solve the problem that each party can obtain specific private information without destroying the privacy of the whole and without accessing the private information of the remaining parties under the participation of multiple parties.Combined with the multi-party aggregation signature method in this paper,it not only fully protects the privacy of data information when access control is automatically performed using smart contracts,but also achieves disclosure in the final secret recovery signature verification stage under the blockchain network.In summary,the efficiency of privacy data recovery,multiparty signature and contract verification in the proposed BPMC(Blockchain-Pedersen Multi-party Computation)framework are greatly enhanced.(3)The blockchain experimental platform is built,and the simulation experiments are conducted by simulating the proposed scheme above.The experiments compare the performance and interaction efficiency of the proposed scheme with the original Fabric federated chain and the current industrial Internet data interaction,and prove that the proposed method can improve the performance of industrial Internet data interaction,and the overall efficiency of the system is improved by 5% compared with the original,and the time of 5ms per 10,000 queries is optimized,and 1.3s per million data insertion is achieved by eliminating the recursion of the native red-black tree.by eliminating the recursion of the native red-black tree.In addition,the load security risk of Kafka consensus mechanism under this scheme can be circumvented after analysis.For the proposed multi-party aggregation scheme the efficiency is improved by 97.5%,93.2%,and 68.5% compared to the native BLS algorithm,BLS multi-party signature algorithm,and Shamir algorithm,respectively. |
PDF Full Text Request