Low latency and cheat-proof event ordering for peer-to-peer games

GauthierDickey, Chris; Zappala, Daniel; Lo, Virginia; Marr, James P.

doi:10.1145/1005847.1005877

Cited by 81 publications

(61 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This gives TCGs some advantage in preventing cheating since certain types of cheats no longer apply when time constraints are not tightly bound. For example, research in the past has looked at cheating in specific types of games such as role-playing, first-person shooters, and real-time strategy games [2]- [4]. However, this prior work does not address cheating within the actual game such as by not actually shuffling cards, or choosing your most desired card instead of the next one from the top of your deck.…”

Section: Introductionmentioning

confidence: 99%

“…Cheating in games can be categorized by the level at which it occurs: the game, application, protocol or network [4]. Much of the research in cheat prevention in games has looked at preventing protocol or application level cheats, i.e., those cheats which occur by modifying network protocol behavior or altering the application in order to gain an unfair advantage [2]- [4], [6], [7].…”

Section: Introductionmentioning

confidence: 99%

“…Much of the research in cheat prevention in games has looked at preventing protocol or application level cheats, i.e., those cheats which occur by modifying network protocol behavior or altering the application in order to gain an unfair advantage [2]- [4], [6], [7]. In this paper, we focus specifically on avoiding or detecting game level cheats, which are those cheats that occur by breaking the rules of the game.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cheat-proof peer-to-peer trading card games

Pittman¹,

GauthierDickey²

2011

2011 10th Annual Workshop on Network and Systems Support for Games

Self Cite

View full text Add to dashboard Cite

Abstract-In trading card games (TCGs), players create a deck of cards from a subset of all cards in the game to compete with other players. Each card in the deck has some feature or ability that may be used strategically to help a player defeat her opponent. Recently, trading card games have been moving from physical cards to digital, online versions. We propose a cheat-proof peer-to-peer protocol for implementing online trading card games. We break down actions common to all TCGs and explain how they can be executed between two players without the need for a third party referee (which usually requires an unbiased server). In each action, the player is either prevented from cheating or if they do cheat, the opponent will be able to prove they have done so. We conclude by showing how these methods are secure and how they may be intermixed for other styles of TCGs and other peer-to-peer games.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cheat-proof peer-to-peer trading card games

Pittman¹,

GauthierDickey²

2011

2011 10th Annual Workshop on Network and Systems Support for Games

Self Cite

View full text Add to dashboard Cite

show abstract

“…It also creates new problems such as referee election and extra latency which may diminish the benefit of P2P overlay. Other anti-cheat systems [5]- [7] mainly rely on majority voting. Unfortunately, although it is efficient to solve consistency problem, majority voting is helpless to information exposure attacks.…”

Section: Introductionmentioning

confidence: 99%

SAFE: A Secure Area of Interests Filter for P2P-based MMOGs

Hao

Zhou

2010

2010 10th IEEE International Conference on Computer and Information Technology

View full text Add to dashboard Cite

Abstract-Area of interests (AOI) filter plays a vital role in reducing the network traffic in peer-to-peer (P2P) based massively multiplayer online games (MMOGs). However, not every peer in the system can be completely trusted. Secret information, such as players' positions are vulnerable to be disclosed in traditional AOI filtering and such cheating is hard to detect. We propose a protocol, called SAFE, based on secure computation theory, which is able to keep private data from unauthorized players who may cheat. The proposed SAFE protocol can also be easily implemented based on the existing P2P infrastructure.

show abstract

“…Under this aspect Baughman [4] first introduced the Lockstep synchronisation. Later, improvements and variations were proposed for distributed and peer to peer games such as the New Event Ordering protocol from GauthierDickey [5] and the Fair Synchronisation Protocol from Chen and Maheswaran [6] among others.…”

Section: Introductionmentioning

confidence: 99%

Fairness and playability in online multiplayer games

Brun

Safaei

Boustead

CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006.

View full text Add to dashboard Cite

Playability and fairness are crucial elements of an enjoyable online game experience. The unavoidable propagation time introduced by the geographical distance between participants can deteriorate the game responsiveness and playability. Also, differences in these delays can provide unfair advantages and/or disadvantages to different players. This paper explores the causal relationships between propagation time, inconsistencies, playability and fairness in online multiplayer games. It clearly defines causes of unfairness and introduces a theoretical quantification supported by an experimental technique to evaluate it in simulations. It also demonstrates through simulations the impact of changes in network architecture and topology on playability and fairness. Disciplines Physical Sciences and Mathematics Publication DetailsThis article was originally published as: Brun, J, Safaei, Abstract-Playability and fairness are crucial elements of an enjoyable online game experience. The unavoidable propagation time introduced by the geographical distance between participants can deteriorate the game responsiveness and playability. Also, differences in these delays can provide unfair advantages and/or disadvantages to different players. This paper explores the causal relationships between propagation time, inconsistencies, playability and fairness in online multiplayer games. It clearly defines causes of unfairness and introduces a theoretical quantification supported by an experimental technique to evaluate it in simulations. It also demonstrates through simulations the impact of changes in network architecture and topology on playability and fairness.

show abstract

Low latency and cheat-proof event ordering for peer-to-peer games

Cited by 81 publications

References 13 publications

Cheat-proof peer-to-peer trading card games

Cheat-proof peer-to-peer trading card games

SAFE: A Secure Area of Interests Filter for P2P-based MMOGs

Fairness and playability in online multiplayer games

Contact Info

Product

Resources

About