Timing channels, anonymity, mixes, and spikes
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Topology in information theory in topology
Theoretical Computer Science
Noisy timing channels with binary inputs and outputs
IH'06 Proceedings of the 8th international conference on Information hiding
Evaluating the transmission rate of covert timing channels in a network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Secure two-party computation over a Z-channel
ProvSec'11 Proceedings of the 5th international conference on Provable security
SP'12 Proceedings of the 20th international conference on Security Protocols
| Hi-index | 754.84 |
Golomb analyzed the Z-channel, a memoryless channel with two input symbols and two output symbols, where one of the input symbols is transmitted with noise while the other is transmitted without noise, and the output symbol transmission times are equal. We generalize to the timed Z-channel, where the output symbol transmission times are not equal. The timed Z-channel appears as the basis for a large class of covert (communication) channels appearing in multilevel secure computer systems. We give a detailed mathematical analysis of the timed Z-channel and report a result expressing the capacity of the timed Z-channel as the log of the root of a characteristic equation. This generalizes Shannon's work on noiseless channels for this special case. We also report a new result bounding the timed Z-channel's capacity from below. We show how an interesting observation that Golomb reported for the Z-channel also holds for the timed Z-channel