权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

SaTC: CORE: Small: Collaborative: Exploring the Boundaries of Large-Scale Secure Computation

SaTC：核心：小型：协作：探索大规模安全计算的边界

基本信息

批准号：
2001096
负责人：
Rafail Ostrovsky
金额：
$ 30万
依托单位：
University of California-Los Angeles
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2020
资助国家：
美国
起止时间：
2020-07-01 至 2024-06-30
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=2001096&HistoricalAwards=false
关键词：
SaTC CORE Small Collaborative Exploring

项目摘要

As the capability and connectivity of communication networks scale up, existing secure distributed protocols need to resort to a frugal use of their communication resources to ensure their scalability. Secure multi-party computation (MPC), which allows a set of mutually distrustful parties to perform arbitrary computations on their joint inputs in a secure way, even in the presence of malicious participants and attackers, epitomizes such kind of secure distributed computation, and despite great improvements in all communication metrics over the last decade, existing solutions do not scale well in settings where a large number of participants are involved. One of the reasons is that in standard MPC protocols every party needs to directly communicate will all other parties, yielding protocols with high communication costs. Recently, some attempts to address this issue were made to carry out MPC with lower communication costs. The project's impacts are to put forth a systematic study of this type of MPC protocols, which we call "Communication-Frugal MPC" (CF-MPC), and to advance its theoretical foundations to meet the state of the art comparable to standard MPC. In an era where computation on large data has become a dominant application, such exploration is of central importance in both theory and practice.The project's novelties include: (1) Development of a rigorous and composable cryptographic model for capturing CF-MPC; (2) feasibility study of CF-MPC with optimal resiliency (i.e., the maximal number of potentially malicious participants that can be tolerated) across all standard communication and adversary models (synchronous vs asynchronous, and static vs adaptive); and (3) improved constructions on additional communication metrics such as message, bit, and round complexity. The project will train graduate and undergraduate students.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。该项目的影响是对此类 MPC 协议（我们称之为“通信节俭 MPC”（CF-MPC））进行系统研究，并推进其理论基础，以满足与标准 MPC 相当的最先进技术。在大数据计算已成为主导应用的时代，这种探索在理论和实践中都具有至关重要的意义。该项目的新颖之处包括：（1）开发了用于捕获CF-MPC的严格且可组合的密码模型； (2) 在所有标准通信和对手模型（同步与异步、静态与自适应）中具有最佳弹性（即可以容忍的潜在恶意参与者的最大数量）的 CF-MPC 的可行性研究； (3) 改进了附加通信指标的构造，例如消息、比特和轮复杂度。该项目将培训研究生和本科生。该奖项反映了 NSF 的法定使命，并通过使用基金会的智力价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

期刊论文数量（4）

专著数量（0）

科研奖励数量（0）

会议论文数量（0）

专利数量（0）

Round-Optimal and Communication-Efficient Multiparty Computation

轮优化和通信高效的多方计算

DOI：
10.1007/978-3-031-06944-4_3
发表时间：
2022
期刊：
EUROCRYPT 2022
影响因子：
0
作者：
Ciampi, Michele;Ostrovsky, Rafail;Waldner, Hendrik;Zikas, Vassilis
通讯作者：
Zikas, Vassilis

Universally Composable Almost-Everywhere Secure Computation

通用可组合几乎无处不在的安全计算

DOI：
发表时间：
2022
期刊：
Information Theoretic Cryptography Conference (ITC 2022
影响因子：
0
作者：
Chandran, Nishanth;Forghani, Pouyan;Garay, Juan;Ostrovsky, Rafail;Patel, Rutvik;Zikas, Vassilis
通讯作者：
Zikas, Vassilis

A combinatorial characterization of self-stabilizing population protocols.

自稳定群体协议的组合表征。