Francis N. Nwebonyi1,2, Rolando Martins1,2, Manuel Eduardo Correia1,2
1Faculty of Science, University of Porto, 2CRACS/INESC-TEC
Aim: this work aims at deriving a fair, inexpensive, and highly robust reputation based security system, for peers in distributed networks. Its importance follows the emergence and popularity of distributed platforms such as P2P, IOT, etc, used to share information. Sensitive information can be shared through these
platforms, making security and privacy very essential.
Methods: we began with a detailed study of the literature, revealing their strengths and weaknesses. Mathematical methods were derived to capture vital trust concepts, and then algorithms were designed based on the derived methods. BitTorrent which is an example of P2P, was used as a test bed. Peersim simulator
was used to implement the algorithm, the simulator already has a version of BitTorrent implementation, with which we compared our method.
Results: we tested the new method, comparing it with the tit-for-tat based BitTorrent, in the presence of the following maliciousness and attacks; free-rider, bandwidth attack, badchunk attack, and sybil attack. The result shows that the new method is clearly more effective. Non-malicious peers were able to download faster, and resources, such as bandwidth, was seen to be utilized more efficiently.
Discussion: the new bootstrapping method discourages whitewashing, and minimizes sybil attack. Our algorithm also defends seeders and leechers from attacks, and encourages fairness, which results in enhanced efficiency.
Conclusion: we have developed a novel distributed reputation bootstrapping method for P2P and similar networks. The new method also incorporates earlier missing concepts such as personal trust, and it effectively defends peers from attacks.
keywords: Reputation, P2P, Security, Fairness