Strong secrecy for multiple access channels

DOI10.1007/978-3-642-36899-8_4zbMATH Open1334.94050OpenAlexW3104109871MaRDI QIDQ4915232FDOQ4915232

Authors Moritz Wiese, Holger Boche 

Publication date 9 April 2013

Published in Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.4557

zbMATH Keywords

information-theoretic securitycommon randomnessstrong secrecywiretap multiple access channel

Mathematics Subject Classification ID

Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40)

Abstract: 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.

Recommendations

• The Gaussian Multiple Access Wire-Tap Channel
• Multiple-Access Channels With Confidential Messages
• Multiterminal secrecy by public discussion
• Strong Secrecy for Wireless Channels (Invited Talk)
• Information theoretic security

Cites work

• scientific article; zbMATH DE number 3841770 (Why is no real title available?)
• scientific article; zbMATH DE number 3702545 (Why is no real title available?)
• scientific article; zbMATH DE number 3779238 (Why is no real title available?)
• scientific article; zbMATH DE number 3562959 (Why is no real title available?)
• scientific article; zbMATH DE number 820501 (Why is no real title available?)
• A Coding Theorem for Multiple Access Channels With Correlated Sources
• Almost independence of random variables and capacity of a secrecy channel
• Arbitrarily varying channels with states sequence known to the sender
• Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true
• Broadcast channels with confidential messages
• Common randomness in information theory and cryptography. I. Secret sharing
• Common randomness in information theory and cryptography. II. CR capacity
• Elimination of correlation in random codes for arbitrarily varying channels
• Fading Cognitive Multiple-Access Channels With Confidential Messages
• Information theoretic security
• Information theory. Coding theorems for discrete memoryless systems
• MIMO Wiretap Channels With Unknown and Varying Eavesdropper Channel States
• Multiple-Access Channels With Confidential Messages
• On Concepts of Performance Parameters for Channels
• On a special class of broadcast channels with confidential messages
• Quantum privacy and quantum wiretap channels
• Secrecy results for compound wiretap channels
• Secret key agreement by public discussion from common information
• Strong Secrecy From Channel Resolvability
• Strong converse for identification via quantum channels
• The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
• The Compound Multiple Access Channel With Partially Cooperating Encoders
• The Gaussian Multiple Access Wire-Tap Channel
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel
• The Wire-Tap Channel
• The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)

Cited in

(12)

• Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels
• Secure \(N\)-dimensional simultaneous dense coding and applications
• On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders
• Multiple-Access Channels With Confidential Messages
• Secrecy results for compound wiretap channels
• The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming
• On secret sharing communication systems with two or three channels
• Secrecy Generation for Multiaccess Channel Models
• Secure Communication Over Fading Channels
• The Gaussian Multiple Access Wire-Tap Channel
• Strongly Secure Multiuser Communication and Authentication With Anonymity Constraints
• Strong Secrecy From Channel Resolvability

This page was built for publication: Strong secrecy for multiple access channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4915232)