2 October 2006 A role-based trust model for peer-to-peer systems
Author Affiliations +
Proceedings Volume 6387, Next-Generation Communication and Sensor Networks 2006; 63870C (2006) https://doi.org/10.1117/12.685611
Event: Optics East 2006, 2006, Boston, Massachusetts, United States
P2P systems are usually used for information exchange between peers in recent years. However, the open and anonymous nature of a P2P network makes it an ideal medium for malicious peers. There is a lack of efficient mechanism for existing P2P systems to avoid from free riding, whitewashing, collusion and malicious attackers. In this paper, we describe a novel role-base trust model for P2P file sharing system. First, we give object criteria to track each peer's contribution to the system. Second, according to their contribution we divide all the peers into 2 parts: super peers and normal peers. Each of the 2 roles is bonded with different rights and obligations. Third, we show how to carry out the computation and storage at local and global. Finally, we discuss how our trust model allows peer to revoke relationships with distrusted peers. We present a concrete method to validate the proposed trust model and report sets of simulation-based experiments, showing the feasibility and robustness of this model.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jie Zhang, Jie Zhang, Zheng Zhao, Zheng Zhao, Song Wang, Song Wang, Qiang Zhang, Qiang Zhang, Zhichao Zhao, Zhichao Zhao, } "A role-based trust model for peer-to-peer systems", Proc. SPIE 6387, Next-Generation Communication and Sensor Networks 2006, 63870C (2 October 2006); doi: 10.1117/12.685611; https://doi.org/10.1117/12.685611


Proceedings of SPIE (February 20 2001)
A micro-payment architecture for P2P networks
Proceedings of SPIE (September 09 2007)
Firewall systems: the next generation
Proceedings of SPIE (January 02 1996)
Internet firewalls: questions and answers
Proceedings of SPIE (March 11 1996)

Back to Top