Information Entropy Composition Algorithms for Multipath Trust Relationships in Trust Propagation

The miscellaneous users, devices, and information in the network bring a great threat to the security of network information. Compared with access control, data encryption and so on, trust management is a technology that can utilize many factors to measure the dynamic trust relationship between nodes. Trust propagation and trust evaluation are the contents of trust management, and trust propagation refers to the spread of trust relationships between nodes. This paper designs a trust propagation mechanism based on information entropy theory. First of all, this paper describes the trust relationship between nodes, including the normalization of trust value, series propagation, and parallel propagation, as well as the corresponding change principles of information entropy in the process of propagation. Then, this paper designs the increasing algorithm and decreasing algorithm of information entropy, and utilizes experiments to determine the values of related parameters. Finally, through the simulation experiment of the dynamic relationship between nodes, this paper verifies the effectiveness of the designed trust propagation mechanism. The experimental results show that the designed information entropy increasing algorithm and decreasing algorithm can be applied to trust propagation to measure the trust relationship between any node. Utilizing the trust propagation mechanism, to quantify the relationships between any non-adjacent nodes in the knowledge graph, and enhance the traversal and search of knowledge and their relationships.