Simple timing channels

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 are interested in a specific type of covert channel, a timing channel. A timing channel exists if it is possible for High to interfere with the system response time to an input by Low. Therefore, a timing channel is a communication channel where the output alphabet is constructed from different time values. However, the thrust of the paper is the analysis of timing channels that are discrete, memoryless, and noiseless. We call such a timing channel a simple timing channel (STC).<<ETX>>

[1]  Wei-Ming Hu,et al.  Reducing timing channels with fuzzy time , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[2]  Thomas F. Keefe,et al.  The concurrency control and recovery problem for multilevel update transactions in MLS systems , 1993, [1993] Proceedings Computer Security Foundations Workshop VI.

[3]  Ira S. Moskowitz,et al.  A pump for rapid, reliable, secure communication , 1993, CCS '93.

[4]  P. Garrett,et al.  Basic complex analysis , 2022 .

[5]  Michael K. Molloy.  Fundamentals of Performance Modeling , 1990, SIGMETRICS Perform. Evaluation Rev..

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

[7]  Sergio Verdú,et al.  On channel capacity per unit cost , 1990, IEEE Trans. Inf. Theory.

[8]  Jerrold E. Marsden,et al.  Basic Complex Analysis , 1973 .

[9]  D. Elliott Bell,et al.  Secure Computer System: Unified Exposition and Multics Interpretation , 1976 .

[10]  Ira S. Moskowitz,et al.  The channel capacity of a certain noisy timing channel , 1992, IEEE Trans. Inf. Theory.

[11]  Solomon W. Golomb,et al.  The limiting behavior of the Z-channel (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[12]  Ralph M. Krause,et al.  Channels Which Transmit Letters of Unequal Duration , 1962, Inf. Control..

[13]  I. S. Moskowitz,et al.  Reduction of a Class of Fox-Wright PSI Functions for Certain Rational Parameters , 1995 .

[14]  L. Brillouin,et al.  Science and information theory , 1956 .

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

[16]  J. Todd Wittbold,et al.  Controlled signalling systems and covert channels , 1989, Proceedings of the Computer Security Foundations Workshop II,.

[17]  Giuseppe Belardinelli.  Fonctions hypergéométriques de plusieurs variables et résolution analytique des équations algébriques générales , 1960 .

[18]  Richard S Marcus,et al.  Discrete noiseless coding , 1957 .

[19]  Ira S. Moskowitz,et al.  Variable noise effects upon a simple timing channel , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[20]  Werner Kuich,et al.  On the Entropy of Context-Free Languages , 1970, Inf. Control..

[21]  John C. Wray.  An Analysis of Covert Timing Channels , 1992, J. Comput. Secur..

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

[23]  B. D. GOLD,et al.  A security retrofit of VM/370 , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[24]  Imre Csiszár,et al.  Simple Proofs of Some Theorems on Noiseless Channels , 1969, Inf. Control..

[25]  Butler W. Lampson,et al.  A note on the confinement problem , 1973, CACM.