Collaborative Research: CIF: Medium: Do You Trust Me? Practical Approaches and Fundamental Limits for Keyless Authentication

合作研究：CIF：中：你相信我吗？

• 批准号: 2107526
• 负责人: Oliver Kosut
• 金额: $ 45万
• 依托单位: Arizona State University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2021
• 资助国家: 美国
• 起止时间: 2021-10-01 至 2025-09-30
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2107526&HistoricalAwards=false
• 关键词: Collaborative; Research; CIF; Medium; Do

The last decade has witnessed a wide variety of emerging communication systems that have revolutionized nearly every aspect of society. To support this revolution, further technological advances are required to address ever-growing security and privacy concerns, including combating attempts by adversarial entities at tampering with communications. Despite recent advances in network security, such as public-key cryptography and various security protocols, the current design of security solutions is often governed by the assumption that an adversary is present at all times. In practice, this assumption may waste resources: even though adversaries may appear at any moment, they are not present for a majority of the time. This project explores authentication as an efficient, low-complexity approach to the security of communication systems. Authenticated communication requires transmitting a message from one location to another, so that whenever the receiver accepts a message, it can guarantee the message has not been corrupted. The hallmark of this approach is that it does not require any pre-shared secret knowledge between users, and it incurs little extra cost when an adversary is not present while providing an immediate alarm signal when one is. This research aims to foster interdisciplinary cooperation across engineering and mathematics, and will actively engage both undergraduate and graduate students across institutions.The project addresses information- and coding-theoretic questions related to both fundamental performance limits and principles of optimal authentication code design, along with the application of authentication to emerging areas such as computing and machine learning. First, new fundamental limits for authentication in point-to-point communication systems are being derived, building on the research team’s preliminary work. This includes the study of Gaussian models as well as myopic channels, where the adversary sees a noisy version of the transmitted signal and may use this knowledge to inform its strategy. Next, the project is studying canonical networks by considering a novel objective of partial correction, which allows a receiver to decode a fraction of the transmitted messages, even if it must reject the remainder. These theoretical findings will also be translated into practical coding schemes for authentication. In particular, new code constructions are being developed by incorporating a controlled amount of non-linearity into existing linear coding schemes. Finally, authentication is being interpreted in and applied to the context of emerging applications such as distributed computing and dataset integrity in supervised learning.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

在过去的十年里，出现了各种各样的新兴通信系统，几乎彻底改变了社会的各个方面。为了支持这场革命，需要进一步的技术进步，以解决日益增长的安全和隐私问题，包括打击敌对实体篡改通信的企图。尽管最近在网络安全方面取得了进展，例如公钥加密和各种安全协议，但目前的安全解决方案的设计往往受到攻击者始终存在的假设的支配。在实践中，这种假设可能会浪费资源：即使对手可能在任何时候出现，他们在大多数时间都不存在。该项目探讨了认证作为一种有效的，低复杂性的通信系统安全方法。认证通信需要将消息从一个位置传输到另一个位置，以便每当接收方接受消息时，它可以保证消息没有被破坏。这种方法的特点是，它不需要用户之间的任何预先共享的秘密知识，并且当对手不存在时，它几乎不会产生额外的成本，而当对手存在时，它会立即提供警报信号。该研究旨在促进工程和数学领域的跨学科合作，并将积极吸引各院校的本科生和研究生。该项目解决与基本性能限制和最佳认证码设计原理相关的信息和编码理论问题，沿着认证在计算和机器学习等新兴领域的应用。首先，在研究小组的初步工作的基础上，正在推导出点对点通信系统中身份验证的新的基本限制。这包括对高斯模型和近视信道的研究，在近视信道中，对手看到传输信号的噪声版本，并可能使用此知识来告知其策略。接下来，该项目通过考虑部分校正的新目标来研究规范网络，该目标允许接收器解码一部分传输的消息，即使它必须拒绝其余部分。这些理论研究结果也将转化为实际的编码方案进行认证。特别地，通过将受控量的非线性合并到现有的线性编码方案中，正在开发新的代码构造。最后，认证被解释并应用于新兴应用的背景下，如分布式计算和监督学习中的数据集完整性。该奖项反映了NSF的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。