TWC: Small: Towards Stealth Networks: Fundamental Limits and Algorithms for Stealth Communications

TWC：小型：迈向隐形网络：隐形通信的基本限制和算法

• 批准号: 1527387
• 负责人: Matthieu Bloch
• 金额: $ 42万
• 依托单位: Georgia Tech Research Corporation
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-09-01 至 2020-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1527387&HistoricalAwards=false
• 关键词: TWC; Small; Towards; Stealth; Networks

The widespread development of communication networks has profoundly transformed our society, resulting in a significant increase in productivity and efficiency. However, the benefits of this increased connectivity are today also counterbalanced by the ease with which malicious individuals can interfere or tamper with sensitive data and information. The past decade has thus witnessed a growing concern for the issues of privacy, confidentiality, and integrity of communications. In many instances, the users in a communication network may now wish to communicate without being detected by others, to maintain privacy, avoid attacks, or escape the attention of regulatory entities monitoring the network. This project takes a distinctive approach to lay the foundation of a comprehensive framework, enabling both the analysis of the fundamental information-theoretic limits and the development of explicit low-complexity algorithms for stealth communication.The project investigates two interrelated research tasks. In the first task, the researchers will develop information-theoretic tools enabling the systematic analysis of stealth communications over a wide range of channel models; this includes architectures with and without secret keys, as well as wired and wireless networks, in which privacy and un-detectability play a central role. In the second task, the researchers will design low-complexity algorithms from error-control codes for stealth communication, which will be tested on experimental prototypes. Additional activities related to the project include, dissemination of research results in various forms and mentoring of students. The proposed research has the potential to enable advances in the implementation of provably stealth communication systems and lead to novel cost-effective techniques for the the generation of stealth communication system.

通信网络的广泛发展深刻地改变了我们的社会，导致生产力和效率的显着提高。然而，如今，恶意个人可以轻松地干扰或篡改敏感数据和信息，从而抵消了这种增强连接性的好处。因此，过去十年见证了人们对通信隐私、保密性和完整性问题的日益关注。在许多情况下，通信网络中的用户现在可能希望在不被其他人检测到的情况下进行通信，以维护隐私、避免攻击或逃避监视网络的监管实体的注意。该项目采用独特的方法来奠定综合框架的基础，既能够分析基本信息论极限，又能够开发用于隐形通信的显式低复杂度算法。该项目研究了两项相互关联的研究任务。在第一项任务中，研究人员将开发信息论工具，能够对各种信道模型上的隐形通信进行系统分析；这包括带有和不带有密钥的架构，以及有线和无线网络，其中隐私和不可检测性发挥着核心作用。在第二项任务中，研究人员将从用于隐形通信的错误控制代码设计低复杂度算法，并将在实验原型上进行测试。与该项目相关的其他活动包括以各种形式传播研究成果和指导学生。所提出的研究有可能推动可证明的隐形通信系统的实现取得进展，并为隐形通信系统的生成带来新颖的、具有成本效益的技术。

项目成果

Covert and Secret Key Expansion Over Quantum Channels Under Collective Attacks

集体攻击下量子通道的隐蔽密钥扩展

• DOI: 10.1109/tit.2020.3021595
• 发表时间: 2020-09-03
• 期刊: IEEE Transactions on Information Theory
• 影响因子: 2.5
• 作者: Mehrdad Tahmasbi;M. Bloch
• 通讯作者: M. Bloch