Quantum privacy and quantum wiretap channels
Problems of Information Transmission
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Fading cognitive multiple-access channels with confidential messages
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
On concepts of performance parameters for channels
General Theory of Information Transfer and Combinatorics
On a special class of broadcast channels with confidential messages
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. II. CR capacity
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Strong converse for identification via quantum channels
IEEE Transactions on Information Theory
Broadcast channels with confidential messages
IEEE Transactions on Information Theory
The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)
IEEE Transactions on Information Theory
Arbitrarily varying channels with states sequence known to the sender
IEEE Transactions on Information Theory
The private classical capacity and quantum capacity of a quantum channel
IEEE Transactions on Information Theory
Multiple-Access Channels With Confidential Messages
IEEE Transactions on Information Theory
The Gaussian Multiple Access Wire-Tap Channel
IEEE Transactions on Information Theory
Common randomness in information theory and cryptography. I. Secret sharing
IEEE Transactions on Information Theory
Secret key agreement by public discussion from common information
IEEE Transactions on Information Theory
The Compound Multiple Access Channel With Partially Cooperating Encoders
IEEE Transactions on Information Theory
Strongly Secure Communications Over the Two-Way Wiretap Channel
IEEE Transactions on Information Forensics and Security - Part 1
| Hi-index | 0.00 |
We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders have entropy-limited access to common randomness. If no common randomness is available, then the achievable region derived here does not allow for the secret transmission of a common message. The second coding problem assumes that the encoders do not have a common message nor access to common randomness. However, they may have a conferencing link over which they may iteratively exchange rate-limited information. This can be used to form a common message and common randomness to reduce the second coding problem to the first one. We give the example of a channel where the achievable region equals zero without conferencing or common randomness and where conferencing establishes the possibility of secret message transmission. Both coding problems describe practically relevant networks which need to be secured against eavesdropping attacks.