Strong secrecy for multiple access channels

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

Authors: Moritz Wiese, Holger Boche 

Publication date: 9 April 2013

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

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.

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

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

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)

Cites Work

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

Cited In (12)

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

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)