• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Multiple-Access Channels With Confidential Messages
【24h】

Multiple-Access Channels With Confidential Messages

机译：带有机密消息的多路访问通道

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A discrete memoryless multiple-access channel (MAC) 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. This channel generalizes the classical MAC model in that each user also receives channel outputs, and hence may obtain the confidential information sent by the other user from the channel output it receives. However, each user views the other user as a wiretapper or eavesdropper, 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 wiretapper (the other user). The performance measure is the rate–equivocation tuple that includes the common rate, two private rates, and two equivocation rates as components. The set that includes all achievable rate–equivocation tuples is referred to as the capacity–equivocation region. The case of perfect secrecy is particularly of interest, in which each user''''s confidential information is perfectly hidden from the other user. The set that includes all achievable rates with perfect secrecy is referred to as the secrecy capacity region. For the MAC with two confidential messages, in which both users have confidential messages for the destination, inner bounds on the capacity–equivocation region, and secrecy capacity region are obtained. It is demonstrated that there is a tradeoff between the two equivocation rates (secrecy levels) achieved for the two confidential messages. For the MAC with one confidential message, in which only one user (user 1) has private (confidential) information for the destination, inner and outer bounds on the capacity-equivocation region are derived. These bounds match partially, and hence the capacity-equi-vocation region is partially characterized. Furthermore, the outer bound provides a tight converse for the case of perfect secrecy, and hence establishes the secrecy capacity region. A class of degraded MACs with one confidential message is further studied, and the capacity-equivocation region and the secrecy capacity region are established. These results are further explored via two example channels: the binary and Gaussian MACs. For both channels, the capacity-equivocation regions and the secrecy capacity regions are obtained.
机译：研究了带有机密消息的离散无记忆多路访问信道（MAC），其中两个用户试图将公用信息传输到目的地，每个用户还具有用于目的地的私有（机密）信息。该信道概括了经典的MAC模型，因为每个用户也都接收信道输出，因此可以从其他用户从其接收的信道输出中获得其他用户发送的机密信息。但是，每个用户都将另一个用户视为窃听者或窃听者，并希望将其机密信息对其他用户尽可能地保密。机密信息的保密级别是通过等价率（即窃听者（另一个用户）的信道输出所调节的机密信息的熵率）来衡量的。绩效衡量标准是费率计算元组，其中包括普通费率，两个私有费率和两个资产负债率。包括所有可实现的费率-计算元组的集合称为容量-计算区域。完全保密的情况尤其令人感兴趣，在这种情况下，每个用户的机密信息对另一个用户都是完全隐藏的。包括所有可达到的速率和完美保密性的集合称为保密容量区域。对于具有两个机密消息的MAC（其中两个用户都拥有目的地的机密消息），获得了容量确定区域和保密容量区域的内部界限。事实证明，对于两个机密消息而言，在两个确定性比率（安全级别）之间存在折衷。对于具有一个机密消息的MAC，其中只有一个用户（用户1）具有目的地的私有（机密）信息，将得出容量获取区域的内部和外部界限。这些界限部分匹配，因此，容量等同功能区域被部分表征。此外，对于完全保密的情况，外边界提供了紧密的对立关系，因此建立了保密能力区域。进一步研究了一类具有一个机密消息的降级MAC，并建立了容量占用区域和保密容量区域。通过两个示例通道进一步探讨了这些结果：二进制MAC和高斯MAC。对于这两个通道，都获得了容量确定区域和保密容量区域。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号