(Enter summary)
Abstract: We discuss the different ways of defining channel capacity
for certain types of illicit communication channels.
We also correct some errors from the literature,
offer new proofs of some historical results, and give
bounds for channel capacity. Special function techniques
are employed to express the results in closed
form. We conclude with examples.
1 Introduction
Even the most securely designed computer systems
may inadvertently contain covert (communication)
channels between specific... (Update)
Context of citations to this paper: More
...logarithms are base two and N(k) is the number of distinct sequences of symbols (ACK times) that take a total of time k. It can be shown [15, 16] that C = log , where is the positive root of 1 Gamma (x GammaO v x Gammaffl ) The polynomial arises from the recurrence...
...and N (k) is the number of distinct sequences of zeroes and ones that High can send that take a total of time k. It can be shown [Sh48, MiMo93, Mo93] that C = log , where is the positive root of x 2ffl Gamma x ffl Gamma 1 = 0. The polynomial arises from the recurrence...
Cited by: More
Capacity Estimation of Non-Synchronous Covert Channels - Zhenghong Wang And
(Correct)
Partitioning in Avionics Architectures: Requirements, Mechanisms, .. - Rushby (2000)
(Correct)
Covert Channels - Here to Stay? - Moskowitz, Kang (1994)
(Correct)
Active bibliography (related documents): More All
0.7: Reduction Of A Class Of Fox-Wright PSI Functions For Certain .. - Miller, Moskowitz (1995)
(Correct)
0.7: A Pump for Rapid, Reliable, Secure Communication - Myong Kang (1993)
(Correct)
0.7: Countermeasures and Tradeoffs for a Class of Covert Timing.. - Gray, III
(Correct)
Similar documents based on text: More All
0.4: Covert Channels and Anonymizing Networks - Moskowitz, Newman, al. (2003)
(Correct)
0.4: Non-Differential Space-Time Transmission Diversity In Fast Fading - Abreu, Kohno
(Correct)
0.3: Space-Time Codes for Wireless Optical Communications - Haas, Shapiro, Tarokh (2001)
(Correct)
Related documents from co-citation: More All
6: Reduction of a class of Fox-Wright Psi functions for certain rational parameters
- Miller, Moskowitz - 1995
6: A Note on the Confinement Problem
- Lampson - 1973
5: Finite-state noiseless covert channels (context) - Millen - 1989
BibTeX entry: (Update)
I.S. Moskowitz and A.R. Miller. Simple timing channels. In Proceedings of the IEEE Symposium in Security and Privacy, pages 56--64, Oakland, California, May 1994. http://citeseer.ist.psu.edu/moskowitz94simple.html More
@inproceedings{ moskowitzsimple,
author = "Ira S. Moskowitz and Allen R. Miller",
title = "Simple Timing Channels",
pages = "56--64",
url = "citeseer.ist.psu.edu/moskowitz94simple.html" }
Citations (may not include all citations):
265
Secure Computer System: Unified Exposition and Multics Inter.. (context) - Bell, Padula - 1976
153
A note on the confinement problem
- Lampson - 1973
76
Trusted Computer System Evaluation Criteria (context) - Defense, Security - 1985
58
and Oren Patashnik (context) - Graham, Knuth - 1989
37
IEEE Transactions on Information Theory (context) - Golomb, behavior et al. - 1980
26
On channel capacity per unit cost (context) - Verd'u - 1990
25
Science and Information Theory (context) - Brillouin - 1962
22
An analysis of covert timing channels (context) - Wray - 1991
14
The channel capacity of a certain noisy timing channel (context) - Moskowitz, Miller - 1992
13
Finite-state noiseless covert channels (context) - Millen - 1989
13
the entropy of context-free languages (context) - Kuich - 1970
11
Fundamentals of Performance Modeling (context) - Molloy - 1989
9
Channels which transmit letters of unequal duration (context) - Krause - 1962
9
Basic Complex Analysis (context) - Marsden, Hoffman - 1987
7
Reduction of a class of Fox-Wright Psi functions for certain..
- Miller, Moskowitz - 1993
7
Also appeared as a series of papers by Shannon in the Bell S.. (context) - Shannon, Weaver et al. - 1949
7
Analysis of a storage channel in the two-phase commit protoc.. (context) - Costich, Moskowitz - 1991
6
The concurrency control and recovery problem for multilevel ..
- Keefe, Mathur - 1993
6
The concurrency control and recovery problem for multilevel ..
- Mathur, Keefe - 1993
5
Information Theory (context) - Goldman - 1953
5
A security retrofit of vm (context) - Gold, Linde et al. - 1979
4
Reducing timing channels with fuzzy time (context) - Hu - 1991
4
Simple proofs of some theorems on noiseless channels (context) - Csisz'ar - 1969
4
Kang and Ira S (context) - Myong - 1993
3
Variable noise effects upon a simple timing channel (context) - Moskowitz - 1991
3
Controlled signalling systems and covert channels (context) - Wittbold - 1989
2
Zur theorie der trinomischengleichungen (context) - Mellin - 1915
1
Massachusetts Institute of Technology (context) - Marcus, Coding - 1957
1
Fonctions Hyperg'eom'etriques de Plusieurs Variables et R'es.. (context) - Belardinelli - 1960
1
Problemy Peredachi Informatsii (context) - Csisz'ar - 1970
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.itd.nrl.navy.mil/ITD/5540/publications/CHACS/1994/index1994.html): More
A Formal Model of Several Fundamental VHDL Concepts - Goldschlag (1994)
(Correct)
A Model of Computation for the NRL Protocol Analyzer - Meadows (1994)
(Correct)
Discussion of a Statistical Channel - Moskowitz, Kang (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC