Secure referee selection for fair and responsive peer-to-peer gaming

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...

Full description

Bibliographic Details
Main Authors: Webb, Steven, Soh, Sieteng, Trahan, J.
Format: Journal Article
Published: Sage Publications 2009
Online Access:http://hdl.handle.net/20.500.11937/36545
_version_ 1848754799961440256
author Webb, Steven
Soh, Sieteng
Trahan, J.
author_facet Webb, Steven
Soh, Sieteng
Trahan, J.
author_sort Webb, Steven
building Curtin Institutional Repository
collection Online Access
description 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 untrusted 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 predefined limit, while attempting to maximise responsiveness and fairness. The trade-off between responsiveness and fairness is adjustable for both algorithms. Simulations of three different scenarios show the effectiveness of our algorithms.
first_indexed 2025-11-14T08:46:10Z
format Journal Article
id curtin-20.500.11937-36545
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T08:46:10Z
publishDate 2009
publisher Sage Publications
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-365452017-09-13T15:53:16Z Secure referee selection for fair and responsive peer-to-peer gaming Webb, Steven Soh, Sieteng Trahan, J. 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 untrusted 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 predefined limit, while attempting to maximise responsiveness and fairness. The trade-off between responsiveness and fairness is adjustable for both algorithms. Simulations of three different scenarios show the effectiveness of our algorithms. 2009 Journal Article http://hdl.handle.net/20.500.11937/36545 10.1177/0037549709102918 Sage Publications fulltext
spellingShingle Webb, Steven
Soh, Sieteng
Trahan, J.
Secure referee selection for fair and responsive peer-to-peer gaming
title Secure referee selection for fair and responsive peer-to-peer gaming
title_full Secure referee selection for fair and responsive peer-to-peer gaming
title_fullStr Secure referee selection for fair and responsive peer-to-peer gaming
title_full_unstemmed Secure referee selection for fair and responsive peer-to-peer gaming
title_short Secure referee selection for fair and responsive peer-to-peer gaming
title_sort secure referee selection for fair and responsive peer-to-peer gaming
url http://hdl.handle.net/20.500.11937/36545