首页> 外文OA文献 >Algorithms and architecture for multiusers, multi-terminal, multi-layer information theoretic security
【2h】

Algorithms and architecture for multiusers, multi-terminal, multi-layer information theoretic security

机译:多用户算法和体系结构,多终端,多层信息理论安全

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。
获取外文期刊封面目录资料

摘要

As modern infrastructure systems become increasingly more complex, we are faced with many new challenges in the area of information security. In this thesis we examine some approaches to security based on ideas from information theory. The protocols considered in this thesis, build upon the "wiretap channel," a model for physical layer security proposed by A. Wyner in 1975. At a higher level, the protocols considered here can strengthen existing mechanisms for security by providing a new location based approach at the physical layer.In the first part of this thesis, we extend the wiretap channel model to the case when there are multiple receivers, each experiencing a time varying fading channel. Both the scenario when each legitimate receiver wants a common message as well as the scenario when they all want separate messages are studied and capacity results are established in several special cases. When each receiver wants a separate independent message, an opportunistic scheme that transmits to the strongest user at each time, and uses Gaussian codebooks is shown to achieve the sum secrecy capacity in the limit of many users. When each receiver wants a common message, a lower bound to the capacity is provided, independent of the number of receivers. In the second part of the thesis the role of multiple antennas for secure communication studied. We establish the secrecy capacity of the multi antenna wiretap channel (MIMOME channel), when the channel matrices of the legitimate receiver and eavesdropper are fixed and known to all the terminals. To establish the capacity, a new computable upper bound on the secrecy capacity of the wiretap channel is developed, which may be of independent interest. It is shown that Gaussian codebooks suffice to attain the capacity for this problem. For the case when the legitimate receiver has a single antenna (MISOME channel) a rank one transmission scheme is shown to attain the capacity.
机译:随着现代基础设施系统变得越来越复杂,我们在信息安全领域面临许多新挑战。在本文中,我们研究了基于信息论思想的一些安全性方法。本文考虑的协议基于“窃听通道”,这是A. Wyner于1975年提出的物理层安全性模型。在更高层次上,此处考虑的协议可以通过提供基于位置的新位置来增强现有的安全性机制。在本文的第一部分,我们将窃听信道模型扩展到存在多个接收器的情况,每个接收器都经历一个时变衰落信道。研究了每个合法接收者想要一条公共消息的场景以及他们都想要单独的消息的场景,并在几种特殊情况下确定了容量结果。当每个接收者想要一个单独的独立消息时,将显示一个机会方案,该方案每次都发送给最强的用户,并使用高斯码本,以在许多用户的限制下实现总保密能力。当每个接收器都需要一条公共消息时,将提供容量的下限,而与接收器的数量无关。在论文的第二部分,研究了多天线在安全通信中的作用。当固定合法接收者和窃听者的信道矩阵并为所有终端所知时,我们建立了多天线窃听信道(MIMOME信道)的保密容量。为了建立容量,开发了窃听通道的保密容量的新的可计算上限,这可能是独立引起关注的。结果表明,高斯码本足以解决此问题。对于合法接收机具有单个天线(MISOME信道)的情况,示出了一种秩传输方案来获得容量。

著录项

  • 作者

    Khisti Ashish 1979-;

  • 作者单位
  • 年度 2009
  • 总页数
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号