A pump for rapid, reliable, secure communication
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
IEEE Transactions on Software Engineering
A note on the confinement problem
Communications of the ACM
Information and Coding Theory
From a Trickle to a Flood: Active Attacks on Several Mix Types
IH '02 Revised Papers from the 5th International Workshop on Information Hiding
Experimental Results Of Covert Channel Limitation In One-Way Communication Systems
SNDSS '97 Proceedings of the 1997 Symposium on Network and Distributed System Security
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Covert channels and anonymizing networks
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Timing channels, anonymity, mixes, and spikes
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Algebraic Information Theory For Binary Channels
Electronic Notes in Theoretical Computer Science (ENTCS)
An analysis of the timed Z-channel
IEEE Transactions on Information Theory
Topology in information theory in topology
Theoretical Computer Science
A Monotonicity Principle for Information Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Information-Theoretic Modeling and Analysis of Interrupt-Related Covert Channels
Formal Aspects in Security and Trust
Algebraic information theory for binary channels
Theoretical Computer Science
| Hi-index | 0.00 |
We develop the algebraic theory of timed capacity for channels with binary inputs and outputs in the presence of noise, by obtaining a formula for capacity in terms of the unique solution of a nonlinear algebraic equation. We give provably correct numerical algorithms for solving this equation, specifically tailored toward calculating capacity. We use our results to establish that information theory has an inherent discontinuity in it: the function which assigns the unique capacity achieving distribution to the noise matrix of a binary channel has no continuous extension to the set of all noise matrices. Our results provide new formulae in the case of untimed binary channels as well. Our results are important in the study of real-world systems, such as the NRL Network Pump® system and traffic analysis in anonymity systems.