EVA-S3PC:高效、可验证、准确的安全矩阵乘法协议组件及其在回归中的应用

IF 15.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Shizhao Peng , Tianle Tao , Derun Zhao , Tianrui Liu , Shoumo Li , Hao Sheng , Haogang Zhu
{"title":"EVA-S3PC:高效、可验证、准确的安全矩阵乘法协议组件及其在回归中的应用","authors":"Shizhao Peng ,&nbsp;Tianle Tao ,&nbsp;Derun Zhao ,&nbsp;Tianrui Liu ,&nbsp;Shoumo Li ,&nbsp;Hao Sheng ,&nbsp;Haogang Zhu","doi":"10.1016/j.inffus.2025.103803","DOIUrl":null,"url":null,"abstract":"<div><div>Efficient multi-party secure matrix multiplication (SMM) is crucial for privacy-preserving machine learning (PPML), but existing mixed-protocol frameworks often face challenges in balancing security, efficiency, and accuracy. This paper presents an efficient, verifiable and accurate secure three-party computing (EVA-S3PC) framework that addresses these challenges by proposing elementary two-party and three-party matrix operations based on data obfuscation techniques. Our approach includes basic protocols for secure matrix multiplication, inversion, and hybrid multiplication, ensuring computational security and result verifiability. EVA-S3PC leverages Monte Carlo methods for robust anomaly detection, achieving a negligible error rate with a verification overhead that drops below 10 % for large-scale tasks. Experimental results demonstrate that EVA-S3PC achieves up to 14 significant decimal digits of precision in Float64 calculations, while reducing communication overhead by up to <span><math><mrow><mn>54.8</mn><mspace></mspace><mo>%</mo></mrow></math></span> compared to state-of-the-art methods. Furthermore, regression models trained using EVA-S3PC on vertically partitioned data achieve accuracy nearly identical to plaintext training. The framework’s practical application in secure three-party linear regression illustrates its potential in distributed PPML scenarios, offering a scalable, efficient, and precise solution for secure collaborative modeling across various domains such as healthcare and finance.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"127 ","pages":"Article 103803"},"PeriodicalIF":15.5000,"publicationDate":"2025-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"EVA-S3PC: Efficient, verifiable, accurate secure matrix multiplication protocol assembly and its application in regression\",\"authors\":\"Shizhao Peng ,&nbsp;Tianle Tao ,&nbsp;Derun Zhao ,&nbsp;Tianrui Liu ,&nbsp;Shoumo Li ,&nbsp;Hao Sheng ,&nbsp;Haogang Zhu\",\"doi\":\"10.1016/j.inffus.2025.103803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Efficient multi-party secure matrix multiplication (SMM) is crucial for privacy-preserving machine learning (PPML), but existing mixed-protocol frameworks often face challenges in balancing security, efficiency, and accuracy. This paper presents an efficient, verifiable and accurate secure three-party computing (EVA-S3PC) framework that addresses these challenges by proposing elementary two-party and three-party matrix operations based on data obfuscation techniques. Our approach includes basic protocols for secure matrix multiplication, inversion, and hybrid multiplication, ensuring computational security and result verifiability. EVA-S3PC leverages Monte Carlo methods for robust anomaly detection, achieving a negligible error rate with a verification overhead that drops below 10 % for large-scale tasks. Experimental results demonstrate that EVA-S3PC achieves up to 14 significant decimal digits of precision in Float64 calculations, while reducing communication overhead by up to <span><math><mrow><mn>54.8</mn><mspace></mspace><mo>%</mo></mrow></math></span> compared to state-of-the-art methods. Furthermore, regression models trained using EVA-S3PC on vertically partitioned data achieve accuracy nearly identical to plaintext training. The framework’s practical application in secure three-party linear regression illustrates its potential in distributed PPML scenarios, offering a scalable, efficient, and precise solution for secure collaborative modeling across various domains such as healthcare and finance.</div></div>\",\"PeriodicalId\":50367,\"journal\":{\"name\":\"Information Fusion\",\"volume\":\"127 \",\"pages\":\"Article 103803\"},\"PeriodicalIF\":15.5000,\"publicationDate\":\"2025-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Fusion\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1566253525008656\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Fusion","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1566253525008656","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

高效的多方安全矩阵乘法(SMM)对于保护隐私的机器学习(PPML)至关重要,但现有的混合协议框架在平衡安全性、效率和准确性方面经常面临挑战。本文提出了一个高效、可验证和准确的安全三方计算(EVA-S3PC)框架,通过提出基于数据混淆技术的基本两方和三方矩阵操作来解决这些挑战。我们的方法包括安全矩阵乘法、反演和混合乘法的基本协议,确保计算安全性和结果可验证性。EVA-S3PC利用蒙特卡罗方法进行稳健的异常检测,实现了可以忽略不计的错误率,并且对于大规模任务的验证开销降至10%以下。实验结果表明,EVA-S3PC在Float64计算中实现了高达14位有效十进制数字的精度,同时与最先进的方法相比,通信开销减少了54.8%。此外,在垂直分割的数据上使用EVA-S3PC训练的回归模型几乎与明文训练相同。该框架在安全三方线性回归中的实际应用说明了它在分布式PPML场景中的潜力,为医疗保健和金融等各个领域的安全协作建模提供了可扩展、高效和精确的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
EVA-S3PC: Efficient, verifiable, accurate secure matrix multiplication protocol assembly and its application in regression
Efficient multi-party secure matrix multiplication (SMM) is crucial for privacy-preserving machine learning (PPML), but existing mixed-protocol frameworks often face challenges in balancing security, efficiency, and accuracy. This paper presents an efficient, verifiable and accurate secure three-party computing (EVA-S3PC) framework that addresses these challenges by proposing elementary two-party and three-party matrix operations based on data obfuscation techniques. Our approach includes basic protocols for secure matrix multiplication, inversion, and hybrid multiplication, ensuring computational security and result verifiability. EVA-S3PC leverages Monte Carlo methods for robust anomaly detection, achieving a negligible error rate with a verification overhead that drops below 10 % for large-scale tasks. Experimental results demonstrate that EVA-S3PC achieves up to 14 significant decimal digits of precision in Float64 calculations, while reducing communication overhead by up to 54.8% compared to state-of-the-art methods. Furthermore, regression models trained using EVA-S3PC on vertically partitioned data achieve accuracy nearly identical to plaintext training. The framework’s practical application in secure three-party linear regression illustrates its potential in distributed PPML scenarios, offering a scalable, efficient, and precise solution for secure collaborative modeling across various domains such as healthcare and finance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Fusion
Information Fusion 工程技术-计算机:理论方法
CiteScore
33.20
自引率
4.30%
发文量
161
审稿时长
7.9 months
期刊介绍: Information Fusion serves as a central platform for showcasing advancements in multi-sensor, multi-source, multi-process information fusion, fostering collaboration among diverse disciplines driving its progress. It is the leading outlet for sharing research and development in this field, focusing on architectures, algorithms, and applications. Papers dealing with fundamental theoretical analyses as well as those demonstrating their application to real-world problems will be welcome.
×
引用
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学术官方微信