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

合作研究：CIF：媒介：RUI：你相信我吗？

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

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的法定任务，并被认为是通过基金会的智力优点和更广泛的影响来通过评估来获得的支持。