SaTC: CORE: Small: Collaborative: Proof of Work Without All the Work

SaTC：核心：小型：协作：无需所有工作的工作证明

• 批准号: 1816076
• 负责人: Maxwell Young
• 金额: $ 24.9万
• 依托单位: Mississippi State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2018
• 资助国家: 美国
• 起止时间: 2018-08-01 至 2022-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1816076&HistoricalAwards=false
• 关键词: SaTC; CORE; Small; Collaborative; Proof

Proof-of-work (PoW) is an economic tool used to deter network attacks by requiring participants to perform verifiable work, typically by solving computational puzzles. Unfortunately, there is a significant barrier impeding wide-spread applicability: PoW is expensive. This project aims to significantly reduce the cost of PoW schemes, and thereby broaden their utility. Our general model concerns a distributed system consisting of good and bad identifiers (IDs). The good IDs have two goals: (1) ensure fair sharing of a limited resource; and (2) securely perform distributed computations. The bad IDs are controlled by an attacker who possesses a constant fraction of the computational resources, and tries to subvert these goals. An important security objective is to develop mechanisms that preserve these goals while incurring bandwidth and computational costs that scale with the magnitude of an attack. That is, when there is no attack, costs are low; conversely, when there is an attack, the good IDs' cost grows commensurately with the attacker's cost. This project focuses on the design of distributed algorithms for: (i) tolerating large attacks while having good IDs spend asymptotically less than the attacker; (ii) handling a setting where participants are selfish but rational; and (iii) designing fast and robust diffuse protocols via attack-resistant overlays with low state and bandwidth costs. The project provides research experience for undergraduate and underrepresented students, incorporates state-of-the-art results into course development, and establishes a workshop venue for cybersecurity researchers to share their findings.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.

工作量证明（PoW）是一种经济工具，通过要求参与者执行可验证的工作（通常是通过解决计算难题）来阻止网络攻击。不幸的是，有一个显著的障碍阻碍了广泛的适用性：PoW是昂贵的。该项目旨在大幅降低PoW计划的成本，从而扩大其效用。 我们的一般模型涉及一个分布式系统，包括好的和坏的标识符（ID）。 好的ID有两个目标：（1）确保有限资源的公平共享;（2）安全地执行分布式计算。 坏ID由拥有恒定部分计算资源的攻击者控制，并试图破坏这些目标。一个重要的安全目标是开发一种机制，既能保持这些目标，又能产生带宽和计算成本，这些成本会随着攻击的规模而增加。也就是说，当没有攻击时，成本很低;相反，当有攻击时，好ID的成本随着攻击者的成本而增加。 该项目的重点是分布式算法的设计：（i）容忍大的攻击，同时具有良好的ID花费渐近小于攻击者;（ii）处理参与者自私但理性的设置;（iii）通过具有低状态和带宽成本的抗攻击覆盖层设计快速和鲁棒的扩散协议。该项目为本科生和代表性不足的学生提供研究经验，将最先进的成果纳入课程开发，并为网络安全研究人员建立一个研讨会场地，以分享他们的发现。该奖项反映了NSF的法定使命，并通过使用基金会的智力价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Peace Through Superior Puzzling: An Asymmetric Sybil Defense

通过卓越的谜题实现和平：不对称的女巫防御

• 发表时间: 2019
• 期刊: 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS
• 作者: Gupta, Diksha;Saia, Jared;Young, Maxwell
• 通讯作者: Young, Maxwell

Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness

缩放指数退避：恒定吞吐量、多对数通道访问尝试和鲁棒性

• DOI: 10.1145/3276769
• 发表时间: 2019
• 期刊: Journal of the ACM
• 影响因子: 2.5
• 作者: Bender, Michael A.;Fineman, Jeremy T.;Gilbert, Seth;Young, Maxwell
• 通讯作者: Young, Maxwell

Singletons for Simpletons: Revisiting Windowed Backoff with Chernoff Bounds

为简单者而单身：用切尔诺夫界限重新审视窗口退避

• DOI: 10.4230/lipics.fun.2021.24
• 发表时间: 2020
• 期刊: 10th International Conference on Fun with Algorithms (FUN 2021
• 作者: Zhou, Qian;Calvert, Aiden;Young, Maxwell
• 通讯作者: Young, Maxwell

A Policy Driven AI-Assisted PoW Framework

政策驱动的人工智能辅助 PoW 框架

• DOI: 10.1109/dsn-s54099.2022.00023
• 发表时间: 2022
• 期刊: 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN
• 作者: Chakraborty, Trisha;Mitra, Shaswata;Mittal, Sudip;Young, Maxwell
• 通讯作者: Young, Maxwell

Singletons for Simpletons: Revisiting Windowed Backoff using Chernoff Bounds

为简单而单身：使用切尔诺夫界限重新审视窗口退避

• 发表时间: 2020
• 期刊: 10th International Conference on Fun with Algorithms (FUN
• 作者: Zhou, Qian;Calvert, Aiden;Young, Maxwell
• 通讯作者: Young, Maxwell