Fully Polynomial Byzantine Agreement for Processors in Rounds
SIAM Journal on Computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
A reputation-based approach for choosing reliable resources in peer-to-peer networks
Proceedings of the 9th ACM conference on Computer and communications security
Looking up data in P2P systems
Communications of the ACM
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
A reputation system for peer-to-peer networks
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
A reputation-based trust model for peer-to-peer ecommerce communities [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
Supporting Trust in Virtual Communities
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 6 - Volume 6
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
ACSAC '04 Proceedings of the 20th Annual Computer Security Applications Conference
PET: A PErsonalized Trust Model with Reputation and Risk Evaluation for P2P Resource Sharing
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 07
Taxonomy of trust: categorizing P2P reputation systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
Reputation Management Techniques in DHT-Based Peer-to-Peer Networks
ICIW '07 Proceedings of the Second International Conference on Internet and Web Applications and Services
DHT routing using social links
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
METrust: A mutual evaluation-based trust model for P2P networks
International Journal of Automation and Computing
Understanding the effects of P2P dynamics on trust bootstrapping
Information Sciences: an International Journal
| Hi-index | 0.24 |
This paper addresses the problem of integration of reputation management mechanisms into data look-up and routing processes to cope with some specific security problems in peer-to-peer (P2P) networks based on Distributed Hash Tables (DHT). The goal is to find a mode for ''good'' peers to cooperate in order to withstand malicious activity of single malevolent peers and their collusions as well. We start from consideration of individual instruments for reputation evaluation that every single peer should be provided with to autonomously define the level of its own trust towards others. We also propose a possible scenario of integration of some existing reputation management techniques and routing mechanisms in a P2P network based on the popular Kademlia algorithm. Then, we present an interaction algorithm that allows peers to obtain the global trust value for each single node through exchanging opinions in the form of local trust values independently calculated by every peer with other members of the community. Such collaboration between peers is indispensable to cope with malicious activity of inconsistent nature specific to DHT-based environment. To render the algorithm resilient to the presence of malicious participants we propose to apply solutions for Byzantine Agreement to exchange opinions among peers. We also provide mathematical evaluations concerning the complexity and computational costs of the proposed algorithm that evidence apparent improvements over the previous one.