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

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

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.