View Item 

Secure referee selection for fair and responsive peer to peer gaming

Access Status
Open access
Authors
Webb, Steven
Soh, Sieteng
Trahan, J.L.
Date
2008
Type
Conference Paper

Metadata
Show full item record
Citation
Webb, Steven and Soh, Sieteng and Trahan, Jerry. 2008. Secure referee selection for fair and responsive peer to peer gaming, in Workshop on Parallel and Distributed Simulation (ed), PADS '08: Proceedings of the 22nd Workshop on Principles of Advanced and Distributed Simulation, Jun 3 2008, pp. 63-72, Rome, Italy: Institute of Electrical and Electronics Engineers (IEEE) Computer Society.
Source Title
22nd Workshop on Principles of Advanced and Distributed Simulation
Source Conference
PADS '2008
DOI
ISBN
Faculty
School of Electrical Engineering & Computing
Science and Engineering
School
Department of Computing
Remarks

Copyright © 2008 IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

URI
Collection
Abstract

Peer-to-peer (P2P) architectures for Massively Multiplayer Online Games (MMOG) provide better scalability than Client/Server (C/S); however, they increase the possibility of cheating. Recently proposed P2P protocols use trusted referees that simulate/validate the game to provide security equivalent to C/S. When selecting referees from un-trusted peers, selecting non-colluding referees becomes critical. Further, referees should be selected such that the range and length of delays to players is minimised (maximising game fairness and responsiveness). In this paper we formally define the referee selection problem and propose two secure referee selection algorithms, SRS-1 and SRS-2, to solve it. Both algorithms ensure the probability of corrupt referees controlling a zone/region is below a pre-defined limit, while attempting to maximise responsiveness and fairness. The trade-off between responsiveness and fairness is adjustable for both algorithms. Simulations show the effectiveness of our algorithms in two different scenarios.