The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
A survey of covert channels and countermeasures in computer network protocols
Open accessAbstract
Covert channels are used for the secret transfer of information. Encryption only protects communication from being decoded by unauthorised parties, whereas covert channels aim to hide the very existence of the communication. Initially, covert channels were identified as a security threat on monolithic systems i.e. mainframes. More recently focus has shifted towards covert channels in computer network protocols. The huge amount of data and vast number of different protocols in the Internet seems ideal as a high-bandwidth vehicle for covert communication. This article is a survey of the existing techniques for creating covert channels in widely deployed network and application protocols. We also give an overview of common methods for their detection, elimination, and capacity limitation, required to improve security in future computer networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
(2011) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,053
Hypertext Transfer Protocol (HTTP)
(2003) · The Hacker's Handbook · doi:10.1201/9780203490044-20 · Cited by 2,824
Security Architecture for the Internet Protocol
Atkinson, R. (1995) · doi:10.17487/rfc1825 · Cited by 2,762
Petitcolas, F. A. P., Anderson, R. J., & Kuhn, M. G. (1999) · Proceedings of the IEEE · doi:10.1109/5.771065 · Cited by 2,546
Postel, J. (1980) · doi:10.17487/rfc0768 · Cited by 2,223
Postel, J. (1981) · doi:10.17487/rfc0793 · Cited by 2,122
Security Policies and Security Models
Goguen, J. A., & Meseguer, J. (1982) · 1982 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1982.10014 · Cited by 2,119
A Mathematical Theory of Communications
Shannon, C. E. (1948) · Cited by 2,080
A lattice model of secure information flow
Denning, D. E. (1976) · Communications of the ACM · doi:10.1145/360051.360056 · Cited by 1,907
A note on the confinement problem
Lampson, B. W. (1973) · Communications of the ACM · doi:10.1145/362375.362389 · Cited by 1,429
RTP: A Transport Protocol for Real-Time Applications
Audio-Video Transport Working Group, Schulzrinne, H., Casner, S., Frederick, R., & Jacobson, V. (1996) · doi:10.17487/rfc1889 · Cited by 1,297
Hypertext Transfer Protocol -- HTTP/1.1
Fielding, R., Gettys, J., Mogul, J., Frystyk, H., Masinter, L., Leach, P., & Berners-Lee, T. (1999) · doi:10.17487/rfc2616 · Cited by 1,218
Postel, J. B. (1981) · Cited by 1,130
Secure Computer Systems: Mathematical Foundations
Bell, D. E., & LaPadula, L. J. (1973) · Defense Technical Information Center (DTIC) · Cited by 1,017
TCP Extensions for High Performance
Borman, D., Braden, B., & Jacobson, V. (2014) · doi:10.17487/rfc7323 · Cited by 1,010
The Prisoners’ Problem and the Subliminal Channel
Simmons, G. J. (1984) · Advances in Cryptology · doi:10.1007/978-1-4684-4730-9_5 · Cited by 977
Security Architecture for the Internet Protocol
Kent, S., & Atkinson, R. (1998) · doi:10.17487/rfc2401 · Cited by 891
Internet Control Message Protocol
Postel, J. (1981) · doi:10.17487/rfc0777 · Cited by 866
Postel, J. B. (1981) · doi:10.17487/rfc0791 · Cited by 802
TCP Extensions for High Performance
Jacobson, V., Braden, R., & Borman, D. (1992) · doi:10.17487/rfc1323 · Cited by 746
Postel, J., & Reynolds, J. (1985) · doi:10.17487/rfc0959 · Cited by 568
Embedding Covert Channels into TCP/IP
Murdoch, S. J., & Lewis, S. (2005) · Lecture Notes in Computer Science · doi:10.1007/11558859_19 · Cited by 302
Fan, J., Xu, J., Ammar, M. H., & Moon, S. B. (2004) · Computer Networks · doi:10.1016/j.comnet.2004.03.033 · Cited by 288
RIFLE: An Architectural Framework for User-Centric Information-Flow Security
Vachharajani, N., Bridges, M. J., Chang, J., Rangan, R., Ottoni, G., Blome, J. A., Reis, G. A., Vachharajani, M., & August, D. I. (2005) · 37th International Symposium on Microarchitecture (MICRO-37'04) · doi:10.1109/micro.2004.31 · Cited by 270
Hot or not: Revealing hidden services by their clock skew
Murdoch, S. J. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180410 · Cited by 253
Shared resource matrix methodology: an approach to identifying storage and timing channels
Kemmerer, R. A. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357369.357374 · Cited by 227
Practical Data Hiding in TCP/IP
Ahsan, K., & Kundur, D. (2002) · Cited by 226
Girling, C. G. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.233153 · Cited by 211
Shah, G., Molina, A., & Blaze, M. (2006) · Cited by 210
Reducing timing channels with fuzzy time
Hu, W.-M. (2002) · IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1991.130768 · Cited by 197
Eliminating Steganography in Internet Traffic with Active Wardens
Fisk, G., Fisk, M., Papadopoulos, C., & Neil, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36415-3_2 · Cited by 162
A pump for rapid, reliable, secure communication
Kang, M. H., & Moskowitz, I. S. (1993) · Proceedings of the ACM Conference on Computer and Communications Security · doi:10.1145/168588.168604 · Cited by 142
Infranet: Circumventing Web Censorship and Surveillance
Feamster, N., Bałazińska, M., Harfst, G., Balakrishnan, H., & Karger, D. R. (2002) · Cited by 138
Web tap: detecting covert web traffic
Borders, K., & Prakash, A. (2004) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1030083.1030100 · Cited by 133
Mapping internet sensors with probe response attacks
Bethencourt, J., Franklin, J., & Vernon, M. K. (2005) · Cited by 131
On Public-Key Steganography in the Presence of an Active Warden
Craver, S. A. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49380-8_25 · Cited by 128
Limitations of End-to-End Encryption in Secure Computer Networks
Padlipsky, M. A., Snow, D. W., & Karger, P. A. (1978) · Defense Technical Information Center (DTIC) · doi:10.21236/ada059221 · Cited by 102
Transport and application protocol scrubbing
Malan, G. R., Watson, D., Jahanian, F., & Howell, P. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832535 · Cited by 86
Improved Port Knocking with Strong Authentication
deGraaf, R., Aycock, J., & Jacobson, M. J. (2006) · Annual Computer Security Applications Conference · doi:10.1109/csac.2005.32 · Cited by 74
Negative Caching of DNS Queries (DNS NCACHE)
Andrews, M. (1998) · doi:10.17487/rfc2308 · Cited by 71
A Study on the Covert Channel Detection of TCP/IP Header Using Support Vector Machine
Sohn, T., Seo, J. T., & Moon, J. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39927-8_29 · Cited by 68
New covert channels in HTTP: adding unwitting Web browsers to anonymity sets
Bauer, M. (2003) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1005140.1005152 · Cited by 65
Data exfiltration and covert channels
Giani, A., Berk, V. H., & Cybenko, G. V. (2006) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.670123 · Cited by 55
Data Hiding in Identification and Offset IP Fields
Cauich, E., Cárdenas, R. G., & Watanabe, R. (2005) · Lecture notes in computer science · doi:10.1007/11533962_11 · Cited by 38
Results concerning the bandwidth of subliminal channels
Simmons, G. J. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668970 · Cited by 35
IP traceback solutions based on time to live covert channel
Jones, E. L., Moigne, O. L., & Robert, J.-M. (2005) · The ... IEEE International Conference on Networks/The IEEE International Conference on Networks · doi:10.1109/icon.2004.1409207 · Cited by 23
Covert Distributed Processing with Computer Viruses
White, S. R. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_57 · Cited by 14
Covert Communications Despite Traffic Data Retention
Danezis, G. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22137-8_27 · Cited by 11
Using Covert Channels to Evaluate the Effectiveness of Flow Confidentiality Measures
Graham, B., Zhu, Y., Fu, X., & Bettati, R. (2005) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads.2005.290 · Cited by 4
A portable microcontroller-based HTTP tunnelling activity detection system
Pack, D. J., & Mullins, B. E. (2004) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2003.1244631 · Cited by 2
Cited by
Security and Privacy for 6G: A Survey on Prospective Technologies and Challenges
Nguyen, V.-L., Lin, P.-C., Cheng, B.-C., Hwang, R.-H., & Lin, Y.-D. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3108618 · Cited by 515
A Survey of Security in Software Defined Networks
Scott-Hayward, S., Natarajan, S., & Sezer, S. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2453114 · Cited by 501
Covert Communications: A Comprehensive Survey
Chen, X., An, J., Xiong, Z., Xing, C., Zhao, N., Yu, F. R., & Nallanathan, A. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3263921 · Cited by 371
Taxonomy and Survey of Collaborative Intrusion Detection
Vasilomanolakis, E., Karuppayah, S., Mühlhäuser, M., & Fischer, M. (2015) · ACM Computing Surveys · doi:10.1145/2716260 · Cited by 326
Metadata
- Authors
- Zander, S., Armitage, G., & Branch, P.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2007
- Volume
- 9
- Issue
- 3
- Pages
- 44-57
- ISSN
- 1553-877X (ISSN-L)
- 2373-745X
- OpenAlex
- W1993704367
- Cited by
- 561
- References
- 52
- FWCI
- 16.15
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.