An information-theoretic and game-theoretic study of timing channels

This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for continuous-time or discrete-time packet waveforms. Fluid waveform approximations of each of these classes of waveforms are employed to aid in analysis. Channel capacity is defined and an information-theoretic game based on mutual information rate is studied. Min-max optimal jammers and max-min optimal input processes are sought. Bounds on the min-max and max-min mutual information rates are described, and numerical examples are given. For maximum-delay-constrained (MDC) jammers with continuous-time packet waveforms, saddle-point input and jammer strategies are identified. The capacity of the maximum-delay constrained jamming channel with continuous-time packet waveforms is shown to equal the mutual information rate of the saddle point. For MDC jammers with discrete-time packet waveforms, saddle-point strategies are shown to exist. Jammers which have quantized batch departures at regular intervals are shown to perform well. Input processes with batches at regular intervals perform well for MDC or maximum-buffer-size-constrained jammers.

[1]  Irvin G. Stiglitz,et al.  Coding for a class of unknown channels , 1966, IEEE Trans. Inf. Theory.

[2]  Anand S. Bedekar,et al.  The Information-Theoretic Capacity of Discrete-Time Queues , 1997, IEEE Trans. Inf. Theory.

[3]  D. Blackwell,et al.  The Capacities of Certain Channel Classes Under Random Coding , 1960 .

[4]  Oliver Costich,et al.  Analysis of a storage channel in the two phase commit protocol , 1991, Proceedings Computer Security Foundations Workshop IV.

[5]  I. S. Moskowitz,et al.  Discussion of a statistical channel , 1994 .

[6]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[7]  Virgil D. Gligor,et al.  Auditing the use of covert storage channels in secure systems , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[8]  Virgil D. Gligor,et al.  A bandwidth computation model for covert storage channels and its applications , 1988, Proceedings. 1988 IEEE Symposium on Security and Privacy.

[9]  Louise E. Moser,et al.  Protection against covert storage and timing channels , 1991, Proceedings Computer Security Foundations Workshop IV.

[10]  Ira S. Moskowitz,et al.  A Data Pump for Communication , 1995 .

[11]  Emre Telatar,et al.  The Compound Channel Capacity of a Class of Finite-State Channels , 1998, IEEE Trans. Inf. Theory.

[12]  R. Ahlswede.  Elimination of correlation in random codes for arbitrarily varying channels , 1978 .

[13]  Jonathan T. Trostle.  Multiple Trojan horse systems and covert channel analysis , 1991, Proceedings Computer Security Foundations Workshop IV.

[14]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[15]  D. Blackwell,et al.  Proof of Shannon's Transmission Theorem for Finite-State Indecomposable Channels , 1958 .

[16]  Samuel Karlin,et al.  Mathematical Methods and Theory in Games, Programming, and Economics , 1961 .

[17]  Toby Berger,et al.  Performance analysis for MRC and postdetection EGC over generalized gamma fading channels , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[18]  Ira S. Moskowitz,et al.  Simple timing channels , 1994, Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy.

[19]  Imre Csiszár,et al.  Graph decomposition: A new key to coding theorems , 1981, IEEE Trans. Inf. Theory.

[20]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[21]  Wei-Ming Hu.  Reducing Timing Channels with Fuzzy Time , 1992, J. Comput. Secur..

[22]  Virgil D. Gligor,et al.  A guide to understanding covert channel analysis of trusted systems , 1993 .

[23]  Robert J. McEliece,et al.  Communication in the Presence of Jamming-An Information-Theoretic Approach , 1983 .

[24]  Sergio Verdú,et al.  Bits through queues , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[25]  Rajesh Sundaresan,et al.  Robust decoding for timing channels , 2000, IEEE Trans. Inf. Theory.

[26]  Robert G. Gallager,et al.  Basic limits on protocol information in data communication networks , 1976, IEEE Trans. Inf. Theory.

[27]  Richard E. Newman,et al.  Capacity estimation and auditability of network covert channels , 1995, Proceedings 1995 IEEE Symposium on Security and Privacy.

[28]  Ira S. Moskowitz,et al.  An analysis of the timed Z-channel , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[29]  I. S. Moskowitz,et al.  Covert channels-here to stay? , 1994, Proceedings of COMPASS'94 - 1994 IEEE 9th Annual Conference on Computer Assurance.

[30]  L. Goddard.  Information Theory , 1962, Nature.

[31]  Imre Csiszár,et al.  Capacity and decoding rules for classes of arbitrarily varying channels , 1989, IEEE Trans. Inf. Theory.

[32]  Imre Csiszár,et al.  Arbitrarily varying channels with constrained inputs and states , 1988, IEEE Trans. Inf. Theory.

[33]  Wayne E. Stark,et al.  On the capacity of channels with unknown interference , 1989, IEEE Trans. Inf. Theory.

[34]  James W. Gray.  On introducing noise into the bus-contention channel , 1993, Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy.

[35]  Jonathan K. Millen.  Finite-state noiseless covert channels , 1989, Proceedings of the Computer Security Foundations Workshop II,.

[36]  Rudolf Ahlswede,et al.  Correlated Decoding for Channels with Arbitrarily Varying Channel Probability Functions , 1969, Inf. Control..

[37]  Ira S. Moskowitz,et al.  A Network Pump , 1996, IEEE Trans. Software Eng..