PEAFOWL:多方隐私保护机器学习中的私有实体对齐

IF 8 1区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS IEEE Transactions on Information Forensics and Security Pub Date : 2025-02-14 DOI:10.1109/TIFS.2025.3542244
Ying Gao;Huanghao Deng;Zukun Zhu;Xiaofeng Chen;Yuxin Xie;Pei Duan;Peixuan Chen
{"title":"PEAFOWL:多方隐私保护机器学习中的私有实体对齐","authors":"Ying Gao;Huanghao Deng;Zukun Zhu;Xiaofeng Chen;Yuxin Xie;Pei Duan;Peixuan Chen","doi":"10.1109/TIFS.2025.3542244","DOIUrl":null,"url":null,"abstract":"In privacy-preserving machine learning with vertically distributed data, private entity alignment methods are used to securely match and utilize features of the same samples. However, existing methods not only risk exposing sample intersections and introducing unnecessary samples but also face a gap in adapting to multi-party scenarios. To address these limitations, we propose P<sc>eafowl</small>, a novel multi-party private entity alignment protocol. P<sc>eafowl</small> achieves entity alignment among multiple parties through a mapping from original datasets to intersections, termed permutation. This method mitigates intersection disclosure and sample redundancy concerns by avoiding direct use of the intersection. The proposed protocol leverages a cloud server that utilizes secret-shared shuffle to protect the privacy of the permutation, in case of colluding data providers reconstructing intersections. Further, by integrating a seed homomorphic pseudorandom generator, P<sc>eafowl</small> avoids the intensive communication of secret sharing and achieves superior runtime performance. Additionally, an offline/online variant is introduced to ensure a linear growth in communication and computation complexity relative to the dataset size by pre-computing permutation calculations. Implemented on a real PPML framework, the protocol demonstrates practical efficiency in various multi-party settings. Experimental results indicate that Peafowl’s overhead is less than 1% of the total training cost, while the offline/online variant achieves approximately a 50% reduction in online runtime. Overall, P<sc>eafowl</small> offers an efficient and straightforward solution for multi-party PPML, making it an attractive option for implementation and future improvements.","PeriodicalId":13492,"journal":{"name":"IEEE Transactions on Information Forensics and Security","volume":"20 ","pages":"2706-2720"},"PeriodicalIF":8.0000,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Peafowl: Private Entity Alignment in Multi-Party Privacy-Preserving Machine Learning\",\"authors\":\"Ying Gao;Huanghao Deng;Zukun Zhu;Xiaofeng Chen;Yuxin Xie;Pei Duan;Peixuan Chen\",\"doi\":\"10.1109/TIFS.2025.3542244\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In privacy-preserving machine learning with vertically distributed data, private entity alignment methods are used to securely match and utilize features of the same samples. However, existing methods not only risk exposing sample intersections and introducing unnecessary samples but also face a gap in adapting to multi-party scenarios. To address these limitations, we propose P<sc>eafowl</small>, a novel multi-party private entity alignment protocol. P<sc>eafowl</small> achieves entity alignment among multiple parties through a mapping from original datasets to intersections, termed permutation. This method mitigates intersection disclosure and sample redundancy concerns by avoiding direct use of the intersection. The proposed protocol leverages a cloud server that utilizes secret-shared shuffle to protect the privacy of the permutation, in case of colluding data providers reconstructing intersections. Further, by integrating a seed homomorphic pseudorandom generator, P<sc>eafowl</small> avoids the intensive communication of secret sharing and achieves superior runtime performance. Additionally, an offline/online variant is introduced to ensure a linear growth in communication and computation complexity relative to the dataset size by pre-computing permutation calculations. Implemented on a real PPML framework, the protocol demonstrates practical efficiency in various multi-party settings. Experimental results indicate that Peafowl’s overhead is less than 1% of the total training cost, while the offline/online variant achieves approximately a 50% reduction in online runtime. Overall, P<sc>eafowl</small> offers an efficient and straightforward solution for multi-party PPML, making it an attractive option for implementation and future improvements.\",\"PeriodicalId\":13492,\"journal\":{\"name\":\"IEEE Transactions on Information Forensics and Security\",\"volume\":\"20 \",\"pages\":\"2706-2720\"},\"PeriodicalIF\":8.0000,\"publicationDate\":\"2025-02-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Forensics and Security\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10887259/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Forensics and Security","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10887259/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

在具有垂直分布数据的隐私保护机器学习中,使用私有实体对齐方法来安全地匹配和利用相同样本的特征。然而,现有的方法不仅存在暴露样本交叉点和引入不必要样本的风险,而且在适应多方场景方面存在差距。为了解决这些限制,我们提出了一种新的多方私有实体对齐协议Peafowl。Peafowl通过从原始数据集到交叉点的映射(称为排列)来实现多方之间的实体对齐。该方法通过避免直接使用交集来减轻交集的公开和样本冗余问题。提议的协议利用一个云服务器,该服务器利用秘密共享洗牌来保护排列的隐私,以防串通数据提供商重建交叉点。此外,通过集成种子同态伪随机生成器,Peafowl避免了秘密共享的密集通信,实现了优越的运行时性能。此外,还引入了离线/在线变体,通过预计算排列计算来确保通信和计算复杂性相对于数据集大小的线性增长。该协议在实际的PPML框架上实现,在各种多方设置中显示出实际的效率。实验结果表明,孔雀的开销小于总训练成本的1%,而离线/在线变体的在线运行时间减少了大约50%。总的来说,pear为多方PPML提供了一个高效和直接的解决方案,使其成为实现和未来改进的一个有吸引力的选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Peafowl: Private Entity Alignment in Multi-Party Privacy-Preserving Machine Learning
In privacy-preserving machine learning with vertically distributed data, private entity alignment methods are used to securely match and utilize features of the same samples. However, existing methods not only risk exposing sample intersections and introducing unnecessary samples but also face a gap in adapting to multi-party scenarios. To address these limitations, we propose Peafowl, a novel multi-party private entity alignment protocol. Peafowl achieves entity alignment among multiple parties through a mapping from original datasets to intersections, termed permutation. This method mitigates intersection disclosure and sample redundancy concerns by avoiding direct use of the intersection. The proposed protocol leverages a cloud server that utilizes secret-shared shuffle to protect the privacy of the permutation, in case of colluding data providers reconstructing intersections. Further, by integrating a seed homomorphic pseudorandom generator, Peafowl avoids the intensive communication of secret sharing and achieves superior runtime performance. Additionally, an offline/online variant is introduced to ensure a linear growth in communication and computation complexity relative to the dataset size by pre-computing permutation calculations. Implemented on a real PPML framework, the protocol demonstrates practical efficiency in various multi-party settings. Experimental results indicate that Peafowl’s overhead is less than 1% of the total training cost, while the offline/online variant achieves approximately a 50% reduction in online runtime. Overall, Peafowl offers an efficient and straightforward solution for multi-party PPML, making it an attractive option for implementation and future improvements.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security 工程技术-工程:电子与电气
CiteScore
14.40
自引率
7.40%
发文量
234
审稿时长
6.5 months
期刊介绍: The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features
期刊最新文献
Polar Coding for the Multiple Access Wiretap Channel with Partial Rate-Limited Feedback via Rate-Splitting Machine Learning Validation of a Physical Prime Random Number Generator Closing the Proof-of-Stake Security Gap: A Signature-Based Defense Against Malicious Validators in Long-Range Attacks ESCM: A Toolkit for Efficient and Secure Outsourced Computation with Multiple Keys Towards Robust Receiver-Invariant Specific Emitter Identification via Multi-Task Adversarial Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1