CRII: AF: RUI: Verifiable Computation Outsourcing: A Non-Cooperative Approach

CRII：AF：RUI：可验证计算外包：一种非合作方法

• 批准号: 1947789
• 负责人: Shikha Singh
• 金额: $ 15.46万
• 依托单位: Williams College
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2020
• 资助国家: 美国
• 起止时间: 2020-10-01 至 2024-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1947789&HistoricalAwards=false
• 关键词: CRII; AF; RUI; Verifiable; Computation

With the growing popularity of cloud computing, most computation today is not done locally but rather outsourced to third-party service providers (SPs). Outsourcing computation brings up the following research problem: how can the client outsourcing the computation verify that it has been performed correctly, without having to redo it? Most previous work has studied this problem from a security standpoint, assuming that the SPs are malicious or adversarial. This assumption does not capture the nature of SPs on internet marketplaces, who are often profit-driven, performing computation for money. This project approaches the problem of verifying outsourced computation from an economic perspective. In particular, this project focuses on SPs that want to maximize their payment, with the goal of designing payment schemes that directly incentivize correctness. The advantage of this approach is that is leads to verification protocols that are simple and practical, and require extremely small verification overhead on the part of the client. This project will advance understanding of the role of incentives in algorithms, which has wide applications to areas such as crowdsourcing, cloud computing and social computing.Interactive proofs (IP) are a fundamental theoretical framework used to study verifiable computation outsourcing. In an IP, the weak client (or verifier) interacts with powerful service providers (or provers) to determine the truthfulness of their claim. Existing IP protocols largely fall into two categories: the cooperative-prover model such as classical IPs or the competing-prover model such as refereed games. In computation-outsourcing applications, the nature of SPs is arguably in the middle of these two extremes, neither cooperative or competitive, but rational---acting to maximize their own payment. The model of non-cooperative rational interactive proofs was introduced recently to capture this middle ground. This project aims to take advantage of this new model to design extremely efficient interactive proofs tailored for computation outsourcing. As part of this work, new insights and techniques from game theory and mechanism design will be used to design protocols that: (a) achieve extremely small verification overhead compared to existing rational-proof and refereed-games protocols, (b) guarantee robustness against deviating provers (measured by the notion of utility gap), and (c) do not rely on private channels of communication between the verifier and provers. The project is divided into two parts. The first focuses on improving the verification overhead of existing non-cooperative rational proofs exponentially while simultaneously achieving large utility gap. The second focuses on improving the state-of-the-art delegation schemes based on refereed games by removing the requirement that at least one prover is honest and leveraging incentives of non-cooperative provers to improve the verification overhead asymptotically.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.

随着云计算的日益普及，今天的大多数计算都不是在本地完成的，而是外包给第三方服务提供商（SP）。外包计算带来了以下研究问题：外包计算的客户如何验证它已经正确执行，而不必重做？大多数以前的工作已经从安全的角度研究了这个问题，假设SP是恶意的或敌对的。这一假设没有抓住互联网市场上SP的本质，他们通常是利润驱动的，为金钱进行计算。本项目从经济角度探讨了验证外包计算的问题。特别是，该项目侧重于希望最大限度地提高其支付的SP，其目标是设计直接激励正确性的支付方案。这种方法的优点是，它导致验证协议是简单和实用的，并要求在客户端的一部分非常小的验证开销。该项目将促进对激励在算法中的作用的理解，该算法在众包、云计算和社会计算等领域具有广泛的应用。交互式证明（IP）是用于研究可验证计算外包的基本理论框架。在IP中，弱客户端（或验证者）与强大的服务提供者（或证明者）交互，以确定其声明的真实性。现有的IP协议主要分为两类：合作证明模型，如经典的IP或竞争证明模型，如裁判游戏。在计算外包应用中，SP的性质可以说是在这两个极端的中间，既不合作也不竞争，但理性的---采取行动，以最大限度地提高自己的报酬。最近引入了非合作理性交互式证明模型来捕获这一中间立场。这个项目旨在利用这种新的模式来设计非常有效的交互式证明，为计算外包量身定制。作为这项工作的一部分，来自博弈论和机制设计的新见解和技术将用于设计协议，这些协议：（a）与现有的合理证明和裁判游戏协议相比，实现极小的验证开销，（B）保证针对偏差证明者的鲁棒性（通过效用差距的概念来衡量），以及（c）不依赖于验证者和证明者之间的私人通信渠道。该项目分为两个部分。第一个重点是提高现有的非合作理性证明的验证开销指数，同时实现大的效用差距。第二个奖项的重点是通过取消至少有一个证明者是诚实的要求，并利用非合作证明者的激励来改善验证开销，从而改善基于裁判游戏的最先进的授权计划。该奖项反映了NSF的法定使命，并被认为值得通过使用基金会的智力价值和更广泛的影响审查标准进行评估来支持。

项目成果

Microteaching: Semantics, Definition of a Computer, Running Times, Fractal Trees, Classes as Encapsulation, and P vs NP

微格教学：语义、计算机的定义、运行时间、分形树、封装类以及 P 与 NP

• DOI: 10.1145/3408877.3432582
• 发表时间: 2021
• 期刊: SIGCSE '21: Proceedings of the 52nd ACM Technical Symposium on Computer Science Education
• 作者: Lewis, Colleen M.;Fisler, Kathi;Hinz, Jenny;Malan, David J.;Paley, Joshua E.;Pérez-Quiñones, Manuel A.;Singh, Shikha
• 通讯作者: Singh, Shikha

Telescoping Filter: A Practical Adaptive Filter

• DOI: 10.4230/lipics.esa.2021.60
• 发表时间: 2021-07
• 作者: David J. Lee;Samuel McCauley;Shikha Singh;Maximilian Stein