Multiple-Access Channels With Confidential Messages

DOI10.1109/TIT.2007.915978zbMATH Open1311.94056arXivcs/0605014MaRDI QIDQ3604539FDOQ3604539

Authors: Yingbin Liang, H. Vincent Poor 

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: A discrete memoryless generalized multiple access channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information intended for the destination. The two users are allowed to receive channel outputs, and hence may obtain the confidential information sent by each other from channel outputs they receive. However, each user views the other user as a wire-tapper, and wishes to keep its confidential information as secret as possible from the other user. The level of secrecy of the confidential information is measured by the equivocation rate, i.e., the entropy rate of the confidential information conditioned on channel outputs at the wire-tapper. The performance measure of interest for the GMAC with confidential messages is the rate-equivocation tuple that includes the common rate, two private rates and two equivocation rates as components. The set that includes all these achievable rate-equivocation tuples is referred to as the capacity-equivocation region. The GMAC with one confidential message set is first studied, where only one user (user 1) has private (confidential) information for the destination. Inner and outer bounds on the capacity-equivocation region are derived, and the capacity-equivocation are established for some classes of channels including the Gaussian GMAC. Furthermore, the secrecy capacity region is established, which is the set of all achievable rates with user 2 being perfectly ignorant of confidential messages of user 1. For the GMAC with two confidential message sets, where both users have confidential messages for the destination, an inner bound on the capacity-equivocation region is obtained.

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

Recommendations

• Multiple-Input Multiple-Output Gaussian Broadcast Channels With Confidential Messages
• Strong secrecy for multiple access channels
• Multiple-Input Multiple-Output Gaussian Broadcast Channels With Common and Confidential Messages
• On a special class of broadcast channels with confidential messages
• Fading Cognitive Multiple-Access Channels With Confidential Messages
• New Results on Multiple-Input Multiple-Output Broadcast Channels With Confidential Messages
• Covert Communication Over a $K$ -User Multiple-Access Channel
• The Gaussian Many-to-One Interference Channel With Confidential Messages
• Capacity Bounds for Broadcast Channels With Confidential Messages
• Multi-Receiver Wiretap Channel With Public and Confidential Messages

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Authentication, digital signatures and secret sharing (94A62)

Cited In (10)

• Strong secrecy for multiple access channels
• Secure Communication Over Fading Channels
• The Gaussian Multiple Access Wire-Tap Channel
• Capacity region of a new bus communication model
• On the Secrecy Capacity of Fading Channels
• A formal treatment of multi-key channels
• Secrecy Generation for Multiaccess Channel Models
• Strong Secrecy From Channel Resolvability
• Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker
• The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming

This page was built for publication: Multiple-Access Channels With Confidential Messages

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