Practical trust management without reputation in peer-to-peer games
Multiagent and Grid Systems - Grid Computing, high performance and distributed applications
Scalable Byzantine Fault Tolerant Public Key Authentication for Peer-to-Peer Networks
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary
Journal of the ACM (JACM)
Trust enforcement in peer-to-peer massive multi-player online games
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
A virtual grouping based fault-tolerant scheme for autonomous networks
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
Peer-to-peer (P2P) systems are composed of large number and various types of peer processes interconnected in networks. Peers may not only stop by fault but also be arbitrarily faulty by attacks like hacking. We have to discuss how to make a system tolerant of Byzantine faults of processes. Byzantine agreement protocols imply large communication overhead. In order to reduce the overhead, we consider a hierarchical group composed of subgroups. Each subgroup shares at least one of correct processes named gateway ones with other subgroups. Even if a leader process of a subgroup is faulty, all the correct processes can make an agreement on the correct value in a whole group because correct gateway processes forward correct values to the subgroup. We evaluate the protocol compared with traditional protocols in terms of number of messages and rounds.