Bounding virus proliferation in P2P networks with a diverse-parameter trust management scheme

Abstract

Abstract-Peer-to-peer (P2P) networking has the potential of providing wide channels for file exchange. At the same time, P2P is prone to the proliferation of viruses. Peer trust reputation can be used to prevent virus dissemination. However, when viruses have infectious properties, peer reputation may not be enough to limit their proliferation. This letter shows the inefficiency of simple peer reputation to bound epidemics in an infectious environment and introduces a trust management algorithm that uses the combination of trust values of peers and infection values of both peers and content to bound the proliferation of viruses in P2P networks. The proposed trust management scheme can bound virus proliferation to a small number of peers without inhibiting file-download activity.

Information Credibility Modeling in Cooperative Networks: Equilibrium and Mechanism Design

“…Specifically, in the early Internet era, peer-to-peer (P2P) networks encountered malicious recommendations and file sharing problems, as exemplified by P2P transactions in [7] and by P2P virus proliferation in [8]. Song et al [7] proposed a P2P reputation system based on fuzzy logic aided inferences by aggregating peer reputations, which can better handle uncertainty, fuzziness and incomplete information in peer-trust reports.…”

“…Song et al [7] proposed a P2P reputation system based on fuzzy logic aided inferences by aggregating peer reputations, which can better handle uncertainty, fuzziness and incomplete information in peer-trust reports. Similarly, the peer-trust reputation can also be used for limiting the P2P virus prorogation problem of file exchanges [8]. The authors of [9] proposed a credibility model by storing and evaluating each witness' past testimony-reporting, which effectively mitigated the adverse influence of unfair testimonies.…”

“…Proof: In order to verify the conditions of those solutions being evolutionary credibility equilibria, we need to first analyze the characteristics of the first-order derivative of function (8) and (9), we have…”

“…according to (8) and (9), respectively. If c 1−pa < 1 − e −µ , then it holds thatŪ G (0) >Ū F (0) and thus all UEs would transit to sharing genuine information for the sake of obtaining higher utilityŪ G (0).…”