Skip to main content

Covert Channel Invisibility Theorem

  • Conference paper
Computer Network Security (MMM-ACNS 2007)


We consider a sequence of finite products of a finite set. A statistical test problem is defined on every product. Consistent sequences of probability measures on these products of the set generate probability measures on the set of infinite sequences. Sufficient conditions of nonexistence for consistent test sequences are proved. These results may be interpreted from the point of view of covert channel secrecy.

This work was supported by the Russian Foundation for Basic Research, grant 07-01-00484, grant 07-07-00236.

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

Access this chapter

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. Axelson, S.: The Base-Rate Fallacy and its Implications for the Difficulty, of Intrusion Detection. In: Proc. of the 6th Conference on Computer and Communications Security, November 1999 (1999)

    Google Scholar 

  2. Bainov, D., Grusho, A., Timonina, E., Volkovich, V.: On a Pobabilistic Model of Intrusion Detection. Int. J. of Pure and Appl. Math. 39(1) (2007)

    Google Scholar 

  3. Covert channels through the looking glass (October 2005)

  4. Department of Defense Trusted Computer System Evaluation, Criteria. DoD (1985)

    Google Scholar 

  5. Grusho, A.: Subliminal channels and information security in computer systems. Descrete Mathematics and Applications 8(2), 127–134 (1998)

    MATH  MathSciNet  Google Scholar 

  6. Grusho, A.: On existence of subliminal channels. Descrete Mathematics and Applications. 9(1), 1–8 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Grusho, A., Kniazev, A., Timonina, E.: Detection of Illegal Information Flow. In: Gorodetsky, V., Kotenko, I., Skormin, V.A. (eds.), MMM-ACNS 2005. LNCS, vol. 3685, pp. 235–244. Springer, Heidelberg (2005)

    Google Scholar 

  8. Grusho, A.A., Timonina, E.E.: Some relations between discrete statistical problems and properties of probability measures on topological spaces. Descrete Mathematics and Applications. 16(6), 547–554 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. A Guide to Understanding Covert Channel Analysis of Trusted Systems. National Computer Security Center. — NCSC-TG-030. Ver. 1 (1993)

    Google Scholar 

  10. Lehmann, E.L.: Testing Statistical Hypotheses (Springer Texts in Statistics), 2nd edn. p. 600. Springer, Heidelberg (1997)

    Google Scholar 

  11. Wu, M., Liu, B.: Multimedia data hiding, p. 219. Springer, New York (2003)

    MATH  Google Scholar 

  12. Prokhorov, U.V., Rozanov, U.A., Theory of probabilities. Moscow., Science (in Russian) (1973)

    Google Scholar 

  13. Shannon, C.: Works on Theory of Informatics and Cybernetics. Moscow. Foregin Literature, 830 (in Russian) (1963)

    Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grusho, A., Grebnev, N., Timonina, E. (2007). Covert Channel Invisibility Theorem. In: Gorodetsky, V., Kotenko, I., Skormin, V.A. (eds) Computer Network Security. MMM-ACNS 2007. Communications in Computer and Information Science, vol 1. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73985-2

  • Online ISBN: 978-3-540-73986-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics