SaTC: CORE: Small: Secure Computation with Minimal Interaction

SaTC：核心：小型：以最少的交互进行安全计算

• 批准号: 1814919
• 负责人: Abhishek Jain
• 金额: $ 47.42万
• 依托单位: Johns Hopkins University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2018
• 资助国家: 美国
• 起止时间: 2018-10-01 至 2023-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1814919&HistoricalAwards=false
• 关键词: SaTC; CORE; Small; Secure; Computation

Today, vast amounts of private datasets are stored by individuals and institutions on personal electronic devices and cloud servers. Many applications of tremendous societal impact can benefit from the ability to perform joint computations on these datasets. However, in the presence of malicious actors -- whether it be the entities performing the computation or external processes -- this benefit is associated with a significant risk of losing data privacy. The powerful paradigm of secure computation in cryptography aims to resolve the conflict between computation and privacy by providing a distributed mechanism for computing upon the private data of individuals, so that nothing beyond the output of the computation is revealed.Feasibility results for secure computation were established three decades ago, with an immense promise for the future. Over the years, however, secure computation has found limited real-world applicability. The primary reason for this disparity is that the protocol complexity of known solutions does not meet the demands of applications. To bring secure computation closer to real world applications, this project focuses on a fundamental metric of efficiency -- the number of required rounds of interaction between the parties -- and aims to fully resolve the round complexity of secure computation, leading to optimal protocols. To achieve this goal, the project develops new, low-overhead methods to achieve security against malicious adversaries, who may arbitrarily deviate from their prescribed strategies. To promote confident use in real world, the project develops solutions in the setting of minimal trust, where an individual does not need to trust any entity or external process beyond itself.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.

如今，个人和机构将大量私人数据集存储在个人电子设备和云服务器上。许多具有巨大社会影响的应用程序可以从这些数据集上执行联合计算的能力中受益。然而，在存在恶意行为者的情况下-无论是执行计算的实体还是外部过程-这种好处都与丢失数据隐私的重大风险有关。密码学中安全计算的强大范例旨在通过提供一种分布式机制来计算个人的私有数据，从而解决计算与隐私之间的冲突，因此除了计算的输出之外，没有任何东西被泄露。安全计算的可行性结果在30年前就已经建立，具有巨大的前景。然而，多年来，安全计算在现实世界中的适用性有限。这种差异的主要原因是已知解决方案的协议复杂性不满足应用的需求。为了使安全计算更接近真实的世界应用，该项目侧重于效率的基本度量-各方之间所需的交互轮数-并旨在完全解决安全计算的轮复杂性，从而获得最佳协议。为了实现这一目标，该项目开发了新的，低开销的方法来实现对恶意对手的安全性，谁可以任意偏离其规定的策略。为了促进在真实的世界中的自信使用，该项目在最低信任设置中开发解决方案，其中个人不需要信任任何实体或外部过程。该奖项反映了NSF的法定使命，并通过使用基金会的智力价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Succinct Zero Knowledge for Floating Point Computations

浮点计算的简洁零知识

• DOI: 10.1145/3548606.3560653
• 发表时间: 2022
• 期刊: 2022 ACM SIGSAC Conference on Computer and Communications Security
• 作者: Garg, Sanjam;Jain, Abhishek;Jin, Zhengzhong;Zhang, Yinuo
• 通讯作者: Zhang, Yinuo

Pre-Constrained Encryption

预约束加密

• 发表时间: 2022
• 期刊: 13th Innovations in Theoretical Computer Science Conference
• 作者: Prabhanjan Ananth, Abhishek Jain

Non-interactive Secure Computation from One-Way Functions

单向函数的非交互式安全计算

• DOI: 10.1007/978-3-030-03332-3_5
• 发表时间: 2018
• 期刊: Advances in Cryptology - ASIACRYPT 2018
• 作者: Badrinarayanan, Saikrishna;Jain, Abhishek;Ostrovsky, Rafail;Visconti, Ivan
• 通讯作者: Visconti, Ivan

Founding Secure Computation on Blockchains

在区块链上建立安全计算

• DOI: 10.1007/978-3-030-17656-3_13
• 发表时间: 2019
• 期刊: Advances in Cryptology - EUROCRYPT 2019
• 作者: Chouchuri, Arka Rai;Goel, Vipul;Jain, Abhishek
• 通讯作者: Jain, Abhishek

Two Round Information-Theoretic MPC with Honest Majority

诚实多数的两轮信息论 MPC

• DOI: 10.1007/978-3-030-17656-3_19
• 发表时间: 2019
• 期刊: Advances in Cryptology - EUROCRYPT 2019
• 作者: Ananth, Prabhanjan;Choudhuri, Arka Rafi;Goel, Aarushi;Jain, Abhishek
• 通讯作者: Jain, Abhishek