The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
with the rapid development of the network, P2P technology is widely used in the Internet, P2P application is facing the trust threat of the network. This paper first describes P2P trust problem, then proposes a P2P game trust model based on an unknown node type, and describes the modeling conditions and modeling process in detail. Use the simulation tool Gambit to verify the feasibility of the proposed...
The open, sharing and anonymous nature of peer-to-peer (P2P) network has offered opportunities and threats for the development of distributed computing technology. One feasible way to minimize threats is to establish the reputation-based global trust model. Previous work about the global trust model is almost based on the assumption that the peer with higher trust value will provide more honest feedbacks,...
In order to improve the trustworthiness of network and decrease the cheating behavior among the nodes in the network, a model for trust discovery based on weighted closeness (WCTD) is presented. This model considers the factors such as the transition fading, time decay, and weights of the path and so on when performing the trust path searching and choosing. So trustor can find the node which satisfies...
A trust model for P2P network is proposed in this thesis, namely CRM, a cluster and recommendation based multi-granularity trust model. Compared to the current trust model, some problems can be solved better, for instance, these disadvantages contain great costs due to iterative calculations, and security such as disguise, slandering caused by anonymous and open characteristics of P2P networks. The...
One of the fundamental challenges for Peer to Peer (P2P) systems is the ability to manage risks involved in interacting and collaborating with prior unknown and potentially malicious parties. Reputation-based trust management systems have proven to be essential to enforcing cooperative behavior in P2P networks. However, in many existing reputation-based trust models, the validity of peers' trust valuation...
As reputation mechanism has been widely accepted and adopted to enhance trust in P2P systems, how to cope with the attack and disturbance problems on reputation mechanism, such as collusion, malicious or unfair rating, and strategic attacks, becomes a key challenge. This paper extends the normal reputation based global trust model, which mostly mixes up the role difference between providing services...
With some critical defects existing in a P2P anonymous network such as stability and security issues, we propose a novel approach called REM-P2PAE to evaluating the reputation based on P2P anonymous environment in the light of our research and analysis. These defects having long been neglected including the short on-line time of reputation model peers, the variations in dynamic situations of peers,...
Because the P2P networkpsilas trust mechanism receives frequently cheat and attack from the malicious nodes, this paper identified four vulnerabilities that are detrimental to trust management, and presented a vague set-based anti-attacked trust model. This model used degree of membership to measure trust degree of uncertainty information, employed the time sensitive coefficient and the penalty coefficient...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.