Skip to main content

Covert Channels for Collusion in Online Computer Games

  • Conference paper
Information Hiding (IH 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3200))

Included in the following conference series:

Abstract

Collusion between partners 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. American Contract Bridge League: Law 20. Review and Explanation of Calls, in Laws of Duplicate Contract Bridge, American Edition (1997)

    Google Scholar 

  2. American Contract Bridge League: Laws of Contract Bridge (Rubber Bridge Laws, American Edition) (1993)

    Google Scholar 

  3. Winkler, P.: The advent of cryptology in the game of Bridge. Cryptologia 7, 327–332 (1983)

    Article  Google Scholar 

  4. Gligor, V.D.: DoD NCSC-TG-030 A Guide to Understanding Covert Channel Analysis of Trusted Systems (Light-Pink Book). National Computer Security Center (1993)

    Google Scholar 

  5. Huskamp, J.C.: Covert Communication Channels in Timesharing System. PhD thesis, University of California, Berkeley, California, Technical Report UCBCS- 78-02 (1978)

    Google Scholar 

  6. Kang, M.H., Moskowitz, I.S.: A pump for rapid, reliable, secure communication. In: 1st ACM Conf. on Computer and Communications Security, Fairfax, VA, Center for High Assurance Computer Systems, pp. 119–129 (1993)

    Google Scholar 

  7. Millen, J.K.: Finite-state noiseless covert channels. In: Proceedings of the Computer Security Foundations Workshop, Franconia, New Hampshire, pp. 81–85 (1989)

    Google Scholar 

  8. Knuth, D.E.: The Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1998)

    Google Scholar 

  9. Cambridge University Computing Society: Winter programming competition (2002), http://www.cucs.ucam.org/competition.html

  10. Allis, L.V.: A knowledge-based approach of connect-four. Master’s thesis, Vrije Universiteit, Amsterdam, The Netherlands (1988), ftp://ftp.cs.vu.nl/pub/victor/connect4.ps.Z

  11. Arrow, K.J.: Social Choice and Individual Values, 2nd edn. Yale Univ. Press, New Haven (1970)

    Google Scholar 

  12. Satterthwaite, M.: Strategy-proofness and Arrow’s condition: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory 10, 187–217 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41, 587–601 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gärdenfors, P.: Manipulations of social choice functions. Journal of Economic Theory 13, 217–228 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  15. Dutta, B., Jackson, M.O., Breton, M.L.: Strategic candidacy and voting procedures. Econometrica 69, 1013–1038 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  16. Dutta, B., Jackson, M.O., Breton, M.L.: Voting by successive elimination and strategic candidacy. Journal of Economic Theory 103, 190–218 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  17. Yan, J.: Security design in online games. In: 19th Annual Computer Security Applications Conference, Acteve (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Murdoch, S.J., Zieliński, P. (2004). Covert Channels for Collusion in Online Computer Games. In: Fridrich, J. (eds) Information Hiding. IH 2004. Lecture Notes in Computer Science, vol 3200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30114-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30114-1_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24207-9

  • Online ISBN: 978-3-540-30114-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics