Collaborative Research: SaTC: CORE: Medium: New Constructions for Garbled Computation

协作研究：SaTC：核心：中：乱码计算的新结构

• 批准号: 2246354
• 负责人: Vladimir Kolesnikov
• 金额: $ 40万
• 依托单位: Georgia Tech Research Corporation
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2023
• 资助国家: 美国
• 起止时间: 2023-04-01 至 2027-03-31
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2246354&HistoricalAwards=false
• 关键词: Collaborative; Research; SaTC; CORE; Medium

Secure multi-party computation (MPC) is a large and growing subfield of cryptography that enables mutually untrusting parties to jointly evaluate functions on their private data. One exciting promise of MPC is the ability to write such functions as general programs and then evaluate them securely. This would enable even non-crypto-specialists to automatically augment ordinary software with powerful security properties. Tools for achieving this goal have proven elusive, due to barriers to efficiently executing ordinary programs inside MPC. The critical barrier is in efficiently handling random access memory (RAM). RAM is ubiquitous in computing, but efficient MPC handling of RAM is well known as a stubborn challenge. This project will significantly improve MPC handling of RAM, thus enabling far more efficient general-purpose MPC tools.Garbled RAM (GRAM) is a powerful MPC primitive that removes interactivity (and hence costly latency) from MPC of programs with RAM accesses. Recent GRAM techniques overcame several long-standing obstacles to GRAM efficiency and restored hope for significant further improvement. The investigators will seize the opportunity, and will explore and implement novel GRAM techniques. The project’s scope is broad, and includes improving GRAM efficiency, bringing GRAM to richer settings, understanding GRAM’s theoretical and practical limitations, improving the cryptographic assumptions needed to construct efficient GRAM, and implementing software prototypes.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.

安全多方计算 (MPC) 是密码学的一个庞大且不断发展的子领域，它使相互不信任的各方能够共同评估其私有数据上的函数，MPC 的一个令人兴奋的承诺是能够将此类函数编写为通用程序，然后安全地评估它们。事实证明，即使非加密专家也能自动增强普通软件的强大安全特性，但由于 MPC 内有效执行普通程序的障碍，关键障碍在于有效处理随机存取存储器。 RAM 在计算中无处不在，但众所周知，RAM 的高效 MPC 处理是一个棘手的挑战，该项目将显着改进 RAM 的 MPC 处理，从而实现更高效的通用 MPC 工具。是一个强大的 MPC 原语，它消除了具有 RAM 访问的程序的 MPC 的交互性（从而消除了昂贵的延迟）。最近的 GRAM 技术克服了一些长期存在的 GRAM 效率障碍，并恢复了进一步显着改进的希望。该项目的范围很广泛，包括提高 GRAM 效率、将 GRAM 引入更丰富的设置、了解 GRAM 的理论和实践局限性、改进构建高效 GRAM 所需的加密假设以及实现软件原型。该奖项反映了 NSF 的法定使命，并通过使用基金会的智力价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Tri-State Circuits A Circuit Model that Captures RAM

三态电路 捕获 RAM 的电路模型

• 发表时间: 2023-08
• 期刊: Crypto 2023
• 作者: David Heath; Vladimir Kolesnikov
• 通讯作者: Vladimir Kolesnikov

Fast ORAM with Server-Aided Preprocessing and Pragmatic Privacy-Efficiency Trade-Off

具有服务器辅助预处理和务实的隐私效率权衡的快速 ORAM

• 发表时间: 2023-07
• 期刊: and Machine Learning CSCML 2023
• 作者: Vladimir Kolesnikov; Stanislav Peceny
• 通讯作者: Stanislav Peceny

Batchman and Robin: Batched and Non-batched Branching for Interactive ZK

Batchman 和 Robin：Interactive ZK 的批处理和非批处理分支

• 发表时间: 2023-11
• 期刊: ACM CCS 2023
• 作者: Yibin Yang; David Heath
• 通讯作者: David Heath

Towards Generic MPC Compilers via Variable Instruction Set Architectures (VISAs)

通过可变指令集架构 (VISA) 实现通用 MPC 编译器

• 发表时间: 2023-11
• 期刊: ACM CCS 2023
• 作者: Yibin Yang; Stanislav Peceny
• 通讯作者: Stanislav Peceny