• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >An information theoretic approach to provably secure communications.
【24h】

An information theoretic approach to provably secure communications.

机译：一种信息理论方法，可证明通信安全。

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

摘要

With the rapid deployment of new wireless devices and pervasive use of wireless data and voice services, the demand for reliable and secure communications is becoming more and more urgent. The focus of this thesis is on the fundamental trade-off among throughput, reliability, and security of various wireless networks. Our study adopts the notion of provable security from an information theoretic perspective. Using equivocation to measure the confidentiality of messages, we establish, for various communication models, the fundamental rate-equivocation trade-off.;We first study capacity bounds for discrete memoryless broadcast channels with two confidential messages, which is a generalization of Csiszar and Korner's classical model. The outer bounds are proposed for the rate equivocation region of this channel model, which, together with a previously proposed inner bound, help establish the rate equivocation region of several classes of discrete memoryless broadcast channels. Furthermore, specializing to the general broadcast channel by removing the confidentiality constraint, the proposed outer bounds reduce to new capacity outer bounds for the discrete memoryless broadcast channel.;Next, we consider another variation of Csiszar and Korner's model. The transmitter sends both a confidential message and a non-confidential message (public message) to the intended receiver. While the unintended receiver should be kept ignorant from the confidential message, we do not impose the requirement that the public message needs to be perfectly recovered by the unintended receiver. This more liberal treatment of the non-confidential message is perhaps a more reasonable model than Csiszar and Korner's model where the non-confidential message (common message) is required to be decoded by both receivers. A single-letter characterization of the achievable rate equivocation region of this model is given and the result is then extended to the case when an extra secret key is available to the transmitter and the intended receiver.;Utilizing the developed framework of broadcast channels with confidential and public messages, we further study the problem of secure communication over a network in which each link may be noisy or noiseless. A single-source single-sink acyclic planar network is assumed, and the communication between the source and the sink is subject to non-cooperating eavesdropping on each link. Sufficient conditions, in terms of communication rates and network parameters, are found for provably secure communication. A constructive proof, which combines Shannon's key encryption, Wyner's random coding, and the Ford-Fulkerson algorithm, is provided which constitutes a readily implementable secure coding scheme for provably secure communications. The derived achievable rate equivocation region is tight when specializing to several special cases. In particular, when the communication network decouples into non-overlapping parallel paths, the proposed encoding scheme is optimal, i.e., it achieves the secure communication capacity for such networks.
机译：随着新无线设备的快速部署以及无线数据和语音服务的广泛使用，对可靠和安全的通信的需求变得越来越迫切。本文的重点是各种无线网络的吞吐量，可靠性和安全性之间的基本权衡。我们的研究从信息理论的角度采用可证明安全性的概念。我们使用等义性来衡量消息的机密性，为各种通信模型建立了基本的速率等价权衡。我们首先研究具有两个机密消息的离散无记忆广播信道的容量边界，这是对Csiszar和Korner的概括。古典模型。为该信道模型的速率等效区域提出了外部界限，并与先前提出的内部界限一起，帮助建立了几类离散无记忆广播信道的速率等效区域。此外，通过消除机密性约束，专门针对通用广播信道，将拟议的外部边界减小为离散无记忆广播信道的新容量外部边界。接下来，我们考虑Csiszar和Korner模型的另一个变体。发送器将机密消息和非机密消息（公共消息）发送到目标接收器。尽管应该使意外接收者对机密消息一无所知，但我们并不强加要求非预期接收者完全恢复公共消息的要求。比Csiszar和Korner的模型（两个接收者都需要对非机密消息（公共消息）进行解码），这种对非机密消息的更为宽松的处理可能是一种更合理的模型。给出了该模型可实现的速率等价区域的单字母表征，然后将结果扩展到当额外的秘密密钥可用于发送方和预期接收方时的情况。和公共消息，我们将进一步研究通过网络进行安全通信的问题，在该网络中，每条链路可能嘈杂无声。假设使用单源单宿非循环平面网络，并且源与宿之间的通信在每个链路上都受到非合作窃听。在通信速率和网络参数方面，找到了足以证明可安全通信的条件。提供了一个建设性的证据，结合了Shannon的密钥加密，Wyner的随机编码和Ford-Fulkerson算法，构成了易于实施的安全编码方案，可证明是安全的通信。当专门研究几种特殊情况时，得出的可实现速率模棱两可的区域很狭窄。特别地，当通信网络解耦成不重叠的并行路径时，所提出的编码方案是最优的，即，它实现了用于这种网络的安全通信容量。

著录项

  • 作者

    Xu, Jin.;

  • 作者单位

    Syracuse University.;

  • 授予单位 Syracuse University.;
  • 学科 Engineering Computer.;Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 2010
  • 页码 153 p.
  • 总页数 153
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号