Abstract

Due to the lack of trusted third parties as guarantees in peer-to-peer (P2P) networks, how to ensure trusted transactions between peers has become a research hotspot. However, the open and distributed characteristics of P2P networks have brought challenges to network security, and there are problems such as node fraud and unavailability of services in the network. To solve the problem of how to select trusted transaction peers in P2P groups, a new trust model, GT-Bidding, is proposed in this paper. This model follows the bidding process of human society. First, each service peer applies for a group of guarantee peers and carries out credit mortgages for this service. Second, based on the entropy and TOPSIS method (Technology for Order Preference by Similarity to an Ideal Solution) approaching the ideal solution, a set of ideal trading sequences is selected. Then, the transaction impact function is used to assign weights to the selected guarantee peers and service nodes, respectively; thus, the comprehensive trust of each service node can be calculated. Finally, the service peer is verified using feedback based on the specific confidence level, which encourages the reputation of the service and its guarantee peers to update. Experiments show that GT-Bidding improves the successful transaction rate and resists complex attacks.

Highlights

  • With the continuous development of network technology, P2P networks have been widely used because of their anonymity and openness, such as in file sharing and instant messaging

  • (3) Malicious Peer (MP). is type of peer is divided into the following subclasses: (I) Complete Malicious Peer (CMP). is type of peer maliciously provides services, guarantees, and gives malicious feedback (II) Defame Peer (DP). is type of peer provides real services and guarantees, but when used as a request peer, it will give poor feedback after the transaction is ended (III) Strategic Malicious Peer (SMP)

  • In Experiment 3, by changing the CMP ratio from 0 to 50%, the other peers were set to Real Peer (RP) and Unreliable Peer (URP). e GTBidding is compared with the PSRTrust, SGTM model, and SecureTrust model, and the successful transaction rate is used as the evaluation index

Read more

Summary

Introduction

With the continuous development of network technology, P2P networks have been widely used because of their anonymity and openness, such as in file sharing and instant messaging. Cloud computing [4] has developed rapidly due to its excellent model It allows on-demand access to adaptive resources and functions, making P2P technology widely used in traditional networks, but it puts forward new requirements for P2P security. E trust model calculates the global trust of Pi by aggregating the local trust of all peers, but it does not consider the dynamic reliability of the peers in the network As a result, it has the disadvantages of poor scalability and high computational complexity. Wu [10] proposed an SGTM model based on the enhanced stable group, presented the construction algorithm of the stable group, effectively partitioned the MP2P network, and maintained relatively stable trust relationships and topology among the same group peers; this study lacked the filter processing of feedback information and could not discard false evaluations and avoid malicious aggressive feedback. Experiments 5 to 6 show the ability to resist cooperative cheating. e reputation updating mechanism can guarantee the reward and punishment of nodes

Trust-Based P2P Group Bidding Model
Guarantee Process
Entropy-Based TOPSIS Service Peer Selection Method
Calculation of Comprehensive Trust
Reputation Update
Conclusion and Future Work
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call