A dynamic algorithm for trust inference based on double DQN in the internet of things

The development of the Internet of Things(IoT)has brought great convenience to people.However,some information security problems such as privacy leakage are caused by communicating with risky users.It is a challenge to choose reliable users with which to interact in the IoT.Therefore,trust plays a crucial role in the IoT because trust may avoid some risks.Agents usually choose reliable users with high trust to maximize their own interests based on reinforcement learning.However,trust propagation is time-consuming,and trust changes with the interaction process in social networks.To track the dynamic changes in trust values,a dynamic trust inference algorithm named Dynamic Double DQN Trust(Dy-DDQNTrust)is proposed to predict the indirect trust values of two users without direct contact with each other.The proposed algorithm simulates the interactions among users by double DQN.Firstly,CurrentNet and TargetNet networks are used to select users for interaction.The users with high trust are chosen to interact in future iterations.Secondly,the trust value is updated dynamically until a reliable trust path is found according to the result of the interaction.Finally,the trust value between indirect users is inferred by aggregating the opinions from multiple users through a Modified Collaborative Filtering Averagebased Similarity(SMCFAvg)aggregation strategy.Experiments are carried out on the FilmTrust and the Epinions datasets.Compared with TidalTrust,MoleTrust,DDQNTrust,DyTrust and Dynamic Weighted Heuristic trust path Search algorithm(DWHS),our dynamic trust inference algorithm has higher prediction accuracy and better scalability.

FlowTrust： trust inference with network flows

Web-based social networking is increasingly gaining popularity due to the rapid development of computer networking technologies. However, social networking applications still cannot obtain a wider acceptance by many users due to some unresolved issues, such as trust, security, and privacy. In social networks, trust is mainly studied whether a remote user behaves as expected by an interested user via other users, who are respectively named trustee, trustor, and recommenders. A trust graph consists of a trustor, a trustee, some recommenders, and the trust relationships between them. In this paper, we propose a novel FlowTrust approach to model a trust graph with network flows, and evaluate the maximum amount of trust that can flow through a trust graph using network flow theory. FlowTrust supports multi-dimensional trust. We use trust value and confidence level as two trust factors. We deduce four trust metrics from these two trust factors, which are maximum flow of trust value, maximum flow of confidence level, minimum cost of uncertainty with maximum flow of trust, and minimum cost of mistrust with maximum flow of confidence. We also propose three FlowTrust algorithms to normalize these four trust metrics. We compare our proposed FlowTrust approach with the existing RelTrust and CircuitTrust approaches. We show that all three approaches are comparable in terms of the inferred trust values. Therefore, FlowTrust is the best of the three since it also supports multi-dimensional trust.