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在计算中无处不在，但众所周知，RAM的高效MPC处理是一个顽固的挑战。该项目将显著改善RAM的MPC处理，从而实现更高效的通用MPC工具。乱码RAM （GRAM）是一种功能强大的MPC原语，它从具有RAM访问的程序的MPC中消除了交互性（从而减少了昂贵的延迟）。最近的GRAM技术克服了GRAM效率的几个长期障碍，并恢复了进一步显著改进的希望。研究人员将抓住机会，探索和实施新的GRAM技术。该项目的范围很广，包括提高GRAM的效率，将GRAM引入更丰富的设置，理解GRAM的理论和实践限制，改进构建高效GRAM所需的加密假设，以及实现软件原型。该奖项反映了美国国家科学基金会的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Tri-State Circuits - A Circuit Model that Captures RAM

• DOI: 10.1007/978-3-031-38551-3_5
• 发表时间: 2023
• 作者: David Heath;V. Kolesnikov;R. Ostrovsky

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

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

• 发表时间: 2023
• 期刊: and Machine Learning CSCML 2023
• 作者: Vladimir Kolesnikov, Stanislav Peceny

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

• DOI: 10.1145/3576915.3623169
• 发表时间: 2023-11
• 期刊: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security
• 作者: Yibin Yang;David Heath;Carmit Hazay;V. Kolesnikov;Muthuramakrishnan Venkitasubramaniam

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

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

• 发表时间: 2023
• 期刊: ACM CCS 2023
• 作者: Yibin Yang, Stanislav Peceny