Skip to main content

The Dilemma of Covert Channels Searching

  • Conference paper
Information Security and Cryptology - ICISC 2005 (ICISC 2005)

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

Included in the following conference series:

Abstract

Covert channel is a famous drawback exists in most of multilevel security systems. Both TESEC and CC standards need covert channel analysis when secure software tries to get the certification of some security levels, i.e. B2 and EAL5 or above in TCSEC and CC, respectively. Search method is one of the most important works with ad hoc characters in covert channels analysis. Though some semi auto tools have been built, peoples who work in this area are eager to develop an auto search tool to find all of covert channels since it was first known in 1973. This paper proves that willingness is a kind of undecidable problems, by which illustrates it’s impossible to build a program which can identify all of covert channels in a security computer system automatically.

This work was supported in part by National Natural Science Foundation of China (No.60573046).

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. Kemmerer, R.A., Porras, P.A.: Covert Flow Trees: A Visual Approach to Analyzing Covert Storage Channels. IEEE Transactions on Software Engineering 17(11), 1166–1184 (1991)

    Article  Google Scholar 

  2. Kemmerer, R.A.: Shared resource matrix methodology: A practical approach to identifying covert channels. ACM Transactions on Computer Systems 1(3), 256–277 (1983)

    Article  Google Scholar 

  3. Wang, C., Ju, S., Guo, D., Yang, Z., Zheng, W.: Research on the methods of search and elimination in covert channel. In: Li, M., Sun, X.-H., Deng, Q.-n., Ni, J. (eds.) GCC 2003. LNCS, vol. 3032, pp. 988–991. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Wang, C., Ju, S.: Searching Covert Channels by Identifying Malicious Subjects in the Time Domain. In: 5th IEEE Information Assurance Workshop, U.S.A, June 9-11, 2004, pp. 68–73 (2004)

    Google Scholar 

  5. Wang, C., Ju, S.: The minimum criteria of covert channels existence and its application. Journal of Computer Science 32(1), 77–79 (2005)

    Google Scholar 

  6. Salomaa, A.: Formal language. ACM Monography Series. Academic Press, New York (1973)

    MATH  Google Scholar 

  7. Tsai, C.R., Gligor, V.D., Chandersekaran, C.S.: On the identification of covert storage channels in secure systems. IEEE Transactions on Software Engineering 16(6), 569–580 (1990)

    Article  Google Scholar 

  8. Tsai, C.R., Gligor, V.D., Chandersekaran, C.S.: A formal method for the identification of covert storage channels in source code. In: 1987 IEEE Symposium on Security and Privacy, Oakland, CA, pp. 74–86. IEEE Computer Society Press, Los Alamitos (1987)

    Google Scholar 

  9. http://www.cgl.uwaterloo.ca/~csk/halt/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, C., Ju, S. (2006). The Dilemma of Covert Channels Searching. In: Won, D.H., Kim, S. (eds) Information Security and Cryptology - ICISC 2005. ICISC 2005. Lecture Notes in Computer Science, vol 3935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11734727_15

Download citation

  • DOI: https://doi.org/10.1007/11734727_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33354-8

  • Online ISBN: 978-3-540-33355-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics