Secure Referee Selection for Fair and Responsive Peer-to-Peer Gaming
Proceedings of the 22nd Workshop on Principles of Advanced and Distributed Simulation
Making an Agreement in an Order-Heterogeneous Group
NBiS '08 Proceedings of the 2nd international conference on Network-Based Information Systems
A protocol for reliably, flexibly, and efficiently making agreement among peers
International Journal of Web and Grid Services
TMPR-scheme for reliably broadcast messages among peer processes
International Journal of Grid and Utility Computing
Measuring Information Exposure Attacks on Interest Management
PADS '12 Proceedings of the 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation
| Hi-index | 0.00 |
The lack of a trusted central authority poses a unique security challenge to peer-to-peer networks. It must be assumed that some fraction of all peers in a network are corrupt and may collude to try to derive an advantage. Nonetheless, in some circumstances it is necessary to select a subset of the peer-to-peer network in such a way that all members of the selected group can be confident that most group members are honest. We propose a secure protocol for the selection of a subset of peers from the network without a trusted authority. Our protocol ensures, with any desired probability, that the percentage of corrupt members in the subset is no greater than a selected limit (up to the total percentage of corrupt peers). We then discuss the use of this protocol in the context of a peer-to-peer game.