speedTrust: a super peer-guaranteed trust model in hybrid P2P networks

Meng, Xiaohong

doi:10.1007/s11227-018-2286-9

Cited by 8 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the proposed trust models for P2P networks suffer from scalability, complexity, and overhead issues. Xianfu et al 49 propose a trust model termed as speedTrust for hybrid P2P systems. Simulation results reveal that the proposed scheme is effective in curbing the activities of malicious nodes.…”

Section: Related Workmentioning

confidence: 99%

A game‐theoretic approach for ensuring trustworthiness in cyber‐physical systems with applications to multiloop UAV control

Jithish

Sankaran

2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Advancements in computing and communication technologies, coupled with the ubiquitous availability of low‐cost embedded devices, have enabled the vision of cyber‐physical systems (CPSs). With the advent of advanced persistent threats, CPSs are more vulnerable to sophisticated cyber‐attacks that cause catastrophic damages, thereby necessitating the development of novel defence architectures for CPS security. This work presents an analytical framework based on noncooperative game theory to evaluate the trustworthiness of individual nodes that constitute CPSs. The proposed approach uses the Nash equilibrium solution to derive a minimum trust threshold score for the CPS nodes. The game‐theoretic framework is evaluated on a supervisory control and data acquisition system prototype to model the evolution of the trust scores its sensors. Furthermore, we apply the model on a simulated unmanned aerial vehicle (UAV) system and derive the trust threshold. The trust threshold represents the minimum trust score required to be maintained by individual UAV nodes. Nodes with trust scores below the threshold are potentially malicious and may be removed or isolated to ensure the secure operation of the system. The proposed approach is successfully implemented to detect malicious behavior in a simulated multiloop UAV control system with a fewer number of false‐positives, achieving a maximum accuracy of 98.85% across different scenarios.

show abstract

Section: Related Workmentioning

confidence: 99%

A game‐theoretic approach for ensuring trustworthiness in cyber‐physical systems with applications to multiloop UAV control

Jithish

Sankaran

2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Nevertheless, these characteristics also bring new challenges to P2P networks. e random spread of illegal messages by malicious peers will have negative impacts on the data security [1] and user experiences [2]. Moreover, the dynamic and distributed nature of the P2P network makes it difficult for peers to conduct long-term and stable transactions [3].…”

Section: Introductionmentioning

confidence: 99%

GT-Bidding: Group Trust Model of P2P Network Based on Bidding

Zhang

Wei

Huang

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

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.

show abstract

“…In a P2P network, each peer can act indistinctly as a client and a server and can collaborate in order to share information in a distributed environment without any centralized coordination. These systems are vulnerable to security problems, abuse, and other threats, and consequently, it is necessary to be resilient to different forms of attacks, to have mechanisms to detect and remove poisoned data [20,72], and to distinguish spammers from honest peers [92,122,94]. Despite these issues, P2P networks are widely used for large-scale data sharing, content distribution, and application-level multicast working with a tolerable waiting time for the users [86,97,144].…”

Section: Introductionmentioning

confidence: 99%

Intelligent query processing in P2P networks: Semantic issues and routing algorithms

et al. 2019

View full text Add to dashboard Cite

P2P networks have become a commonly used way of disseminating content on the Internet. In this context, constructing efficient and distributed P2P routing algorithms for complex environments that include a huge number of distributed nodes with different computing and network capabilities is a major challenge. In the last years, query routing algorithms have evolved by taking into account different features (provenance, nodes' history, topic similarity, etc.). Such features are usually stored in auxiliary data structures (tables, matrices, etc.), which provide an extra knowledge engineering layer on top of the network, resulting in an added semantic value for specifying algorithms for efficient query routing. This article examines the main existing algorithms for query routing in unstructured P2P networks in which semantic aspects play a major role. A general comparative analysis is included, associated with a taxonomy of P2P networks based on their degree of decentralization and the different approaches adopted to exploit the available semantic aspects.

show abstract

speedTrust: a super peer-guaranteed trust model in hybrid P2P networks

Cited by 8 publications

References 16 publications

A game‐theoretic approach for ensuring trustworthiness in cyber‐physical systems with applications to multiloop UAV control

A game‐theoretic approach for ensuring trustworthiness in cyber‐physical systems with applications to multiloop UAV control

GT-Bidding: Group Trust Model of P2P Network Based on Bidding

Intelligent query processing in P2P networks: Semantic issues and routing algorithms

Contact Info

Product

Resources

About