Secure and Verifiable P2P Card Games

Yeh, Chun-Chao

doi:10.1109/euc.2008.165

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In , the authors propose a TTP‐free shuffling protocol, which uses only symmetric operations (modular additions and permutations) for distributing secret shares among players; during the game, these shares are disclosed to the appropriate players, which can then recover the value of the cards. However, it requires at least three players and is not collusion resistant, because two colluding players may be able to discover all cards in the deck.…”

Section: Related Workmentioning

confidence: 99%

SecureTCG: a lightweight cheating‐detection protocol for P2P multiplayer online trading card games

Simplício

Santos

Leal

et al. 2014

Security Comm Networks

View full text Add to dashboard Cite

Online gaming is today a very lucrative market, with millions of users all around the globe. At the same time, the increasing popularity and complexity of such games implies the need of deploying cheating‐detection mechanisms for ensuring the continuous interest of honest users in playing. The development of secure and efficient solutions for online games is, however, a challenging issue. This is especially true in P2P environments, in which the lack of a central trusted entity monitoring the game greatly facilitates the activity of malicious players. Aiming to tackle this issue, this paper presents SecureTCG, a protocol for detecting cheating attempts in P2P multiplayer card games where the players use their own decks to play, such as the so‐called trading card games. In summary, SecureTCG allows the multiple players participating in a trading card game match to detect cheating attempts as soon as they are made and without the intervention of third parties, supports multiple players and different game styles, displays tolerance to players’ dropouts during a match, prevents collusion among any number of players, provides (optional) after‐match auditability mechanisms, and has a reduced computational cost. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Section: Related Workmentioning

confidence: 99%