NSFSaTC-BSF: TWC: Small: Practical Succinct Proof Systems without Trusted Setup

NSFSaTC-BSF：TWC：小型：无需可信设置的实用简洁证明系统

• 批准号: 1617676
• 负责人: Elaine Shi
• 金额: $ 49.96万
• 依托单位: Cornell University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2016
• 资助国家: 美国
• 起止时间: 2016-08-01 至 2021-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1617676&HistoricalAwards=false
• 关键词: NSFSaTC; BSF; TWC; Small; Practical

Succinct non-interactive proofs are a powerful cryptographic building block with many promising applications in secure cloud outsourcing and in domains such as Internet of Things, medical, and financial applications where computation over privacy sensitive data is desired. Existing implementations of succinct proofs all rely on a trusted setup phase, commonly known as preprocessing. This preprocessing phase can be problematic since the system loses all security guarantees if the secret trapdoor generated during preprocessing is compromised. To make matters worse, the preprocessing is often not a one-time operation, and must be repeated for each application or, even worse, for different input sizes of the very same application.The project investigates ways to circumvent this major drawback by exploring succinct proof systems without trusted setup. This project creates a programming framework and compiler toolchain called Lunaria which compiles general programs, written in high-level languages, into succinct zero-knowledge proofs without trusted setup. Lunaria aims to combine algebraic-, compiler-, and implementation-level improvements in non-trivial ways, and enable orders of magnitude speedup over a straightforward implementation of state-of-the-art theoretical results. Expected impacts include new, open-source frameworks for succinct proofs without trusted setup, thus giving research and industry access to the power of succinct proofs.

简洁的非交互式证明是一个强大的加密构建块，在安全云外包以及需要对隐私敏感数据进行计算的物联网、医疗和金融应用等领域具有许多有前景的应用。简洁证明的现有实现都依赖于可信设置阶段，通常称为预处理。这个预处理阶段可能会出现问题，因为如果预处理过程中生成的秘密陷门被泄露，系统将失去所有安全保证。更糟糕的是，预处理通常不是一次性操作，必须针对每个应用程序重复进行预处理，甚至更糟糕的是，针对同一应用程序的不同输入大小重复预处理。该项目通过探索简洁的方法来研究规避这一主要缺点的方法。无需可信设置即可证明系统。该项目创建了一个名为 Lunaria 的编程框架和编译器工具链，它将用高级语言编写的通用程序编译为简洁的零知识证明，无需可信设置。 Lunaria 旨在以非凡的方式将代数、编译器和实现级别的改进结合起来，并在直接实现最先进的理论结果的基础上实现数量级的加速。预期的影响包括无需可信设置即可进行简洁证明的新开源框架，从而使研究和行业能够获得简洁证明的力量。