Strong Secrecy for Multiple Access Channels

DOI10.1007/978-3-642-36899-8_4zbMath1334.94050arXiv1209.4557OpenAlexW3104109871MaRDI QIDQ4915232

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)

Related Items

Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels ⋮ On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secrecy results for compound wiretap channels
• Almost independence of random variables and capacity of a secrecy channel
• Quantum privacy and quantum wiretap channels
• MIMO Wiretap Channels With Unknown and Varying Eavesdropper Channel States
• The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel
• Information Theoretic Security
• Multiple-Access Channels With Confidential Messages
• The Gaussian Multiple Access Wire-Tap Channel
• Arbitrarily varying channels with states sequence known to the sender
• The Wire-Tap Channel
• Elimination of correlation in random codes for arbitrarily varying channels
• Broadcast channels with confidential messages
• Secret key agreement by public discussion from common information
• Common randomness in information theory and cryptography. I. Secret sharing
• On a special class of broadcast channels with confidential messages
• Common randomness in information theory and cryptography. II. CR capacity
• Strong converse for identification via quantum 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.)
• A Coding Theorem for Multiple Access Channels With Correlated Sources
• Fading Cognitive Multiple-Access Channels With Confidential Messages
• The Compound Multiple Access Channel With Partially Cooperating Encoders
• Strong Secrecy From Channel Resolvability
• On Concepts of Performance Parameters for Channels
• Information Theory