TWC: Small: Communication under Adversarial Attacks in Complex Networks - Fundamental Limits and Secure Coding Strategies

TWC：小：复杂网络中对抗性攻击下的通信 - 基本限制和安全编码策略

• 批准号: 1526547
• 负责人: Joerg Kliewer
• 金额: $ 33.82万
• 依托单位: New Jersey Institute of Technology
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-09-01 至 2020-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1526547&HistoricalAwards=false
• 关键词: TWC; Small; Communication; under; Adversarial

Today's world is highly dependent on the integrity of communication systems as the Internet, WiFi, or cellular networks. As networks become more pervasive, they are increasingly being used for communication and storage of critical as well as sensitive data and therefore impose more stringent demands on reliability and security, which must be maintained even under extreme settings such as partial power failures, natural disasters, or, most importantly, adversarial attacks. This research seeks to understand fundamental limits of protecting complex practical networks against adversarial attacks, and how these limits can be achieved by optimal secure strategies, thus bridging the gap between advanced theoretical research and the development of realistic solutions. Further, the project is able to provide a significant transformative impact on many other critical applications employing reliable networked communications, for example in the fields of healthcare, environmental monitoring, finance, etc. It also provides a platform for creating broader technological, societal, research, and educational impact as advancing information technology and its benefits to society through newly established theory and practice, an ambitious education plan, and actively engaging students from underrepresented demographics.Specifically, the project focuses on aspects (e.g., distributed users, heterogeneity, delay requirements, actions of adversaries described by probability distributions) important in real network systems but poorly understood in current literature, and seeks to elucidate the impact of each such aspect on capacity and code design. This research aims both to characterize features of the problems and solutions (e.g., hardness of computing the rate of communication under adversarial attacks, interaction between redundancy in different network flows, and non-uniform adversarial sets) that are new to the literature, as well as to identify commonalities between the solutions required in each new scenario. These commonalities are then applied to characterize the fundamental tradeoff between security and performance in general adversarial networks. The technique employed here is via reductions, which demonstrate the relationship between two problems by showing that any solution for one can be employed to build a solution for the other. In particular, reductions are derived between noisy networks with a state chosen by the adversary and their corresponding noiseless and stateless versions, for which capacity is much easier to characterize. Further, these results lead to analytical performance guarantees for the designed secure coding strategies, thus providing guidance on specific design approaches and for those cases where capacity bounds are still open.

当今世界高度依赖互联网、WiFi 或蜂窝网络等通信系统的完整性。随着网络变得越来越普遍，它们越来越多地用于关键数据和敏感数据的通信和存储，因此对可靠性和安全性提出了更严格的要求，即使在部分断电、自然灾害、或者，最重要的是，对抗性攻击。本研究旨在了解保护复杂的实际网络免受对抗性攻击的基本限制，以及如何通过最佳安全策略来实现这些限制，从而缩小先进理论研究与实际解决方案开发之间的差距。此外，该项目能够对许多其他采用可靠网络通信的关键应用产生重大变革性影响，例如医疗保健、环境监测、金融等领域。它还为创建更广泛的技术、社会、研究提供了一个平台。以及教育影响，即通过新建立的理论和实践、雄心勃勃的教育计划以及积极吸引来自弱势群体的学生来推进信息技术及其对社会的益处。具体而言，该项目侧重于各个方面（例如，分布式用户、异质性、延迟需求、概率分布描述的对手的行为）在真实网络系统中很重要，但在当前文献中知之甚少，并试图阐明每个此类方面对容量和代码设计的影响。这项研究的目的是表征文献中新出现的问题和解决方案的特征（例如，计算对抗性攻击下的通信速率的难度、不同网络流中冗余之间的相互作用以及非均匀对抗性集合）以确定每个新场景所需的解决方案之间的共性。然后应用这些共性来描述一般对抗网络中安全性和性能之间的基本权衡。这里使用的技术是通过归约，它通过表明一个问题的任何解决方案都可以用来为另一个问题构建解决方案来证明两个问题之间的关系。特别是，在具有对手选择的状态的噪声网络与其相应的无噪声和无状态版本之间得出减少，其容量更容易表征。此外，这些结果为设计的安全编码策略提供了分析性能保证，从而为特定的设计方法以及容量界限仍然开放的情况提供了指导。