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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1992)
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)
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)
Moskowitz, I.S., Miller, A.R.: Simple Timing Channels. In: Proc. of the IEEE Symposium on Research in Security and Privacy, Oakland, CA (1994)
Kaufman, C., Perlman, R., Spencer, M.: Network Security. Prentice-Hall, Englewood Cliffs (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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