Secure covert channels in multiplayer games

ABSTRACT

Steganography is the art of hidden communication. In recent years, some publications presented approaches to transmit hidden information for different purposes via covert channels provided by games. These approaches used rather ad-hoc techniques to reach their objectives without establishing notions of steganographic security in their domain and applying them to review their solution. Therefore, this paper both theoretically and practically tackles the question how to implement secure steganography for games.

First, we recall the necessary game-theoretic basics from which we derive a notion of steganographic security for game-based methods that depends on strategy imitation. This is followed by a general information-theoretic analysis of games to calculate the total amount of information that is sent during a game and the share that can be used securely for game-theoretic steganography.

Second, based on our game-theoretic framework, we present a secure steganographic system for a simplified version of poker that serves as a proof of concept. Its features are evaluated and compared to the theoretical results. Despite its security, the system can replace over 50% of the cover data with steganographic information. Further advantages of our method are that no large cover messages are needed and that it can be used for steganographic streaming.

References

1. C. Cachin. An Information-Theoretic Model for Steganography. Information and Computation, 192(1):41--56, 1998. Revised edition published in 2004.
2. J. Fridrich, M. Goljan, and D. Hogea. Attacking the OutGuess. In Proc. ACM Workshop on Multimedia and Security 2002, 2002.
3. J. Fridrich, T. Pevný, and J. Kodovský. Statistically Undetectable JPEG Steganography: Dead Ends, Challenges, and Opportunities. In Proc. ACM Workshop on Multimedia and Security, 2007.
4. J. C. Hernandez-Castro, I. Blasco-Lopez, J. M. Estevez-Tapiador, and A. Ribagorda-Garnacho. Steganography in Games: A General Methodology and its Application to the Game of Go. Computers & Security, 25:64--71, 2006.
5. S. Katzenbeisser and F. Petitcolas. Defining Security in Steganographic Systems. In E. J. Delp and P. W. Won, editors, Security and Watermarking of Multimedia Contents IV, volume 4675 of Proc. SPIE, pages 260--268, 2002.
6. H. W. Kuhn. Contributions to the Theory of Games, volume 1, chapter A Simplified Two-Person Poker, pages 97--103. Princeton University Press, 1950.
7. S. J. Murdoch and P. Zielinski. Covert Channels for Collusion in Online Computer Games. In Proc. 6th Intl. Workshop on Information Hiding, 2004.
8. M. J. Osborne. An Introduction to Game Theory. Oxford University Press, 2004.
9. P. Sallee. Model-Based Steganography. In Proc. Intl. Workshop on Digital Watermarking, pages 154--167, 2004.
10. C. Ullerich and A. Westfeld. Weaknesses of MB2. In Y. Q. Shi, H.-J. Kim, and S. Katzenbeisser, editors, Digital Watermarking. 6th Intl. Workshop, IWDW 2007, 2007.
11. A. Westfeld. F5 - A Steganographic Algorithm: High Capacity Despite Better Steganalysis. In I. S. Moskowitz, editor, Information Hiding. 4th Intl. Workshop, IH'01, pages 289--302, 2001.
12. P. Winkler. The Advent of Cryptology in the Game of Bridge. Cryptologia, 7:327--332, 1983.

Index Terms

• Information systems

  • Data management systems

    • Data structures

      • Data layout

        • Data encryption

• Mathematics of computing

  • Information theory

    • Coding theory

• Security and privacy

  • Cryptography

    • Mathematical foundations of cryptography

• Theory of computation

  • Computational complexity and cryptography