Skip to main content
Springer Nature Link
Log in

Covert Information Transmission through the Use of Standard Collision Resolution Algorithms

  • Conference paper
Information Hiding (IH 1999)

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

Included in the following conference series:

Abstract

The objective of this paper is to demonstrate the potential of the wireless medium to host covert channels. We do so by considering a simple covert channel and evaluating its performance. The channel is based on the First Come First Serve (FCFS) spliting algorithm, which is a standard collision resolution algorithm [1,2] that operates in a distributed fashion and coordinates access to a standard collision channel (possibly wireless medium or multi access cable) shared by a large number of users.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1992)

    MATH  Google Scholar 

  2. Mosely, J., Humblet, P.A.: A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels. IEEE Transactions on Communications COM-33(2) (February 1985)

    Google Scholar 

  3. Verdu, S.: Computation of the Efficiency of the Mosely-Humblet Contention Resolution Algorithm: A Simple Method. In: Proceedings of IEEE, April 1986, vol. 74(4) (1986)

    Google Scholar 

  4. Moskowitz, I.S., Miller, A.R.: Simple Timing Channels. In: Proc. of the IEEE Symposium on Research in Security and Privacy, Oakland, CA (1994)

    Google Scholar 

  5. Kaufman, C., Perlman, R., Spencer, M.: Network Security. Prentice-Hall, Englewood Cliffs (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Systems Research and Department of Electrical Engineering, University of Maryland, College Park, MD, 20742, USA

    Talat Mert Doğu & Anthony Ephremides

Authors
  1. Talat Mert Doğu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anthony Ephremides
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, TU Dresden, 01062, Dresden, Germany

    Andreas Pfitzmann

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Doğu, T.M., Ephremides, A. (2000). Covert Information Transmission through the Use of Standard Collision Resolution Algorithms. In: Pfitzmann, A. (eds) Information Hiding. IH 1999. Lecture Notes in Computer Science, vol 1768. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719724_29

Download citation

  • DOI: https://doi.org/10.1007/10719724_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67182-4

  • Online ISBN: 978-3-540-46514-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics