skip to main content
10.1145/1413140.1413150acmotherconferencesArticle/Chapter ViewAbstractPublication PagescsiirwConference Proceedingsconference-collections
extended-abstract

Secure and reliable covert channel

Published:12 May 2008Publication History

ABSTRACT

We describe the design, implementation and evaluation of a reliable and secure protocol to establish a covert channel that not only maintains a high degree of stealthiness, but also provides reliability despite temporary data loss as well as data confidentiality. An important feature of our proposed protocol is that it can be embedded in any legitimate channel that is based on IP. In this paper, we describe our protocol using ICMP. In particular, the proposed protocol satisfies four important properties: stealthiness, lightweight, confidentiality and integrity, and reliability.

References

  1. Man Ping: Linux manual page of PING.Google ScholarGoogle Scholar
  2. Project loki. Phrack Magazine, 7(49), August 1996.Google ScholarGoogle Scholar
  3. K. Ahsan and D. Kundur. Practical data hiding in tcp/ip, 2002.Google ScholarGoogle Scholar
  4. J. Giffin, R. Greenstadt, P. Litwack, and R. Tibbetts. Covert messaging through tcp timestamps.Google ScholarGoogle Scholar
  5. L. Kocarev and G. Jakimoski. Logistic map as a block encryption algorithm. Physics Letters A, 289, 2001.Google ScholarGoogle Scholar
  6. C. H. Rowland. Covert channels in the tcp/ip protocol suite. First Monday, 2(5), May 1997.Google ScholarGoogle Scholar

Index Terms

  1. Secure and reliable covert channel

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      CSIIRW '08: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead
      May 2008
      470 pages
      ISBN:9781605580982
      DOI:10.1145/1413140

      Copyright © 2008 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 12 May 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • extended-abstract

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader