SaTC: CORE: Small: Efficient Trustless Distributed Cryptography

SaTC：核心：小型：高效的无信任分布式密码学

• 批准号: 2240976
• 负责人: Ling Ren
• 金额: $ 60万
• 依托单位: University of Illinois at Urbana-Champaign
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2023
• 资助国家: 美国
• 起止时间: 2023-05-15 至 2026-04-30
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2240976&HistoricalAwards=false
• 关键词: SaTC; CORE; Small; Efficient; Trustless

Distributed cryptography refers to the paradigm where different parties or organizations jointly run a protocol for privacy or integrity. Prominent examples include secure multi-party computation and distributed ledger technology. A central goal in distributed cryptography is to avoid any centralized trusted party or single point of failure. Many protocols and systems today, however, still need to keep some degree of central trust, often in the form of an initial trusted dealer or trusted setup phase. These central trust assumptions go against the philosophy of distributed cryptography. The reason why they are still common is efficiency and convenience. More often than not, solutions without central trust are harder to construct and more costly than ones using central trust. This project seeks to invent and promote distributed cryptographic protocols without central trust by placing them on equal footing with their trusted counterparts in terms of simplicity and efficiency. The project will study a series of fundamental problems including reliable broadcast, Byzantine fault tolerant consensus (the underlying technology of distributed ledgers), verifiable information dispersal, verifiable secret sharing, and distributed randomness beacons. For each of these problems, the goal is to design new solutions that do not rely on any central trust and can match the efficiency of their trusted counterparts, both in terms of asymptotic complexity and practical performance. The project will also design practical distributed key generation and setup generation protocols to help remove central trust from existing distributed cryptographic protocols. A crucial insight that inspired this project is that underlying all these important problems is a simple yet overlooked problem known as data dissemination. The project will systematically investigate data dissemination and apply it to many areas of distributed cryptography.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的法定使命，并通过使用基金会的智力优势和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Threshold Signatures from Inner Product Argument: Succinct, Weighted, and Multi-threshold

• DOI: 10.1145/3576915.3623096
• 发表时间: 2023-11
• 期刊: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security
• 作者: Sourav Das;Philippe Camacho;Zhuolun Xiang;Javier Nieto;Benedikt Bünz;Ling Ren

On the Amortized Communication Complexity of Byzantine Broadcast

• DOI: 10.1145/3583668.3594596
• 发表时间: 2023-06
• 期刊: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing
• 作者: Jun Wan;Atsuki Momose;Ling Ren;E. Shi;Zhuolun Xiang

On the Security of KZG Commitment for VSS

• DOI: 10.1145/3576915.3623127
• 发表时间: 2023-11
• 期刊: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security
• 作者: Atsuki Momose;Sourav Das;Ling Ren

Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling

• 发表时间: 2022
• 期刊: IACR Cryptol. ePrint Arch.
• 作者: Sourav Das;Zhuolun Xiang;Lefteris Kokoris-Kogias;Ling Ren