Network-Efficient Pipelining-Based Secure Multiparty Computation for Machine Learning Applications

Oscar G. Bautista, K. Akkaya
{"title":"Network-Efficient Pipelining-Based Secure Multiparty Computation for Machine Learning Applications","authors":"Oscar G. Bautista, K. Akkaya","doi":"10.1109/LCN53696.2022.9843372","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN53696.2022.9843372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

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.
机器学习应用中基于网络高效流水线的安全多方计算
安全多方计算(SMPC)允许互不信任的各方在不泄露其私人输入的情况下共同评估函数。该技术可帮助组织在不泄露机密或受保护数据的情况下为共同目标进行协作。尽管它适合于隐私保护计算,但SMPC受到基于网络的性能限制。具体来说,SMPC各方以轮执行技术,其中他们执行本地计算,然后与其他各方共享他们的轮输出。这种网络交换造成了瓶颈,因为各方需要等到数据传播之后才能恢复执行。为了减少SMPC的执行时间,我们提出了一种类似流水线的方法,通过划分数据和重新调整执行顺序来实现每轮的计算和通信。针对深度学习应用,我们提出了矩阵乘法的策略,这是这些应用的核心组成部分。我们在分布式云部署上的结果显示SMPC执行时间显著缩短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信