计算机科学
瓶颈
计算
分布式计算
云计算
保密
软件部署
组分(热力学)
安全多方计算
乘法(音乐)
并行计算
计算机网络
嵌入式系统
计算机安全
操作系统
算法
物理
声学
热力学
作者
Oscar G. Bautista,Kemal Akkaya
标识
DOI:10.1109/lcn53696.2022.9843372
摘要
Secure multi-party computation (SMPC) allows mutually distrusted parties to evaluate a function jointly without revealing their private inputs. This technique helps organizations collaborate on a common goal without disclosing confidential or protected data. Despite its suitability for privacy-preserving computation, SMPC suffers from network-based performance limitations. Specifically, the SMPC parties perform the techniques in rounds, where they execute a local computation and then share their round output with the other parties. This network interchange creates a bottleneck as parties need to wait until the data propagates before resuming the execution. To reduce the SMPC execution time, we propose a pipelining-like approach for each round's computation and communication by dividing the data and readjusting the execution order. Targeting deep learning applications, we propose strategies for the case of matrix multiplication, a core component of such applications. Our results on a distributed cloud deployment show a significant reduction in the SMPC execution time.
科研通智能强力驱动
Strongly Powered by AbleSci AI