Covert Channels for Collusion in Online Computer Games

18Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Collusion between paxtners in Contract Bridge is an oft-used example in cryptography papers and an interesting topic for the development of covert channels. In this paper, a different type of collusion is discussed, where the parties colluding are not part of one team, but instead are multiple independent players, acting together in order to achieve a result that none of them are capable of achieving by themselves. Potential advantages and defences against collusion are discussed. Techniques designed for low-probability-of-intercept spread spectrum radio and multilevel secure systems are also applied in developing covert channels suitable for use in games. An example is given where these techniques were successfully applied in practice, in order to win an online programming competition. Finally, suggestions for further work are explored, including exploiting similarities between competition design and the optimisation of voting systems. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Murdoch, S. J., & Zielinski, P. (2004). Covert Channels for Collusion in Online Computer Games. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3200, 355–369. https://doi.org/10.1007/978-3-540-30114-1_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free