Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Authentication over noisy channels
IEEE Transactions on Information Theory
Secret rate - privacy leakage in biometric systems
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Biometric systems: privacy and secrecy aspects
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Achieving the empirical capacity using feedback: memoryless additive models
IEEE Transactions on Information Theory
On information theoretic security: mathematical models and techniques
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Common randomness and secret key capacities of two-way channels
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
General Theory of Information Transfer and Combinatorics
General Theory of Information Transfer and Combinatorics
Watermarking identification codes with related topics on common randomness
General Theory of Information Transfer and Combinatorics
On concepts of performance parameters for channels
General Theory of Information Transfer and Combinatorics
Search with noisy and delayed responses
General Theory of Information Transfer and Combinatorics
Optimal trading of classical communication, quantum communication, and entanglement
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
Biometric Security from an Information-Theoretical Perspective
Foundations and Trends in Communications and Information Theory
Public and private resource trade-offs for a quantum channel
Quantum Information Processing
Strong secrecy for multiple access channels
Information Theory, Combinatorics, and Search Theory
Capacity results for arbitrarily varying wiretap channels
Information Theory, Combinatorics, and Search Theory
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 754.96 |
For pt.I see ibid., vol.39, p.1121, 1993. The common randomness (CR) capacity of a two-terminal model is defined as the maximum rate of common randomness that the terminals can generate using resources specified by the given model. We determine CR capacity for several models, including those whose statistics depend on unknown parameters. The CR capacity is shown to be achievable robustly, by common randomness of nearly uniform distribution no matter what the unknown parameters are. Our CR capacity results are relevant for the problem of identification capacity, and also yield a new result on the regular (transmission) capacity of arbitrarily varying channels with feedback