sm - cs - hfl:一种安全有效的保护隐私的异构联邦学习解决方案

IF 3.7 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Jinzhao Wang , Wenlong Tian , Junwei Tang , Xuming Ye , Yaping Wan , Zhiyong Xu , Lingna Chen
{"title":"sm - cs - hfl:一种安全有效的保护隐私的异构联邦学习解决方案","authors":"Jinzhao Wang ,&nbsp;Wenlong Tian ,&nbsp;Junwei Tang ,&nbsp;Xuming Ye ,&nbsp;Yaping Wan ,&nbsp;Zhiyong Xu ,&nbsp;Lingna Chen","doi":"10.1016/j.jisa.2025.104253","DOIUrl":null,"url":null,"abstract":"<div><div>In the era of big data, deep learning models play a crucial role in identifying underlying patterns within data. However, the need for large volumes of training data, often scattered across various organizations with privacy constraints, poses a significant challenge. Federated Learning (FL) addresses this by enabling the collaborative training of models without sharing the underlying data. Despite its promise, FL encounters challenges with model privacy leakage and computational overhead, particularly when dealing with non-identically distributed (Non-IID) data. To overcome these challenges, we introduce Sym-CS-HFL, a novel Privacy-Preserving Federated Learning (PPFL) framework that combines Symmetric Homomorphic Encryption with a Local Adaptive Aggregation (LAA) scheme. Our approach minimizes the reliance on asymmetric keys, simplifying the encryption process and reducing computational overhead. We implement a DCT-Neural Network Compressive Sensing Scheme to decrease communication costs substantially. Furthermore, the LAA scheme addresses the heterogeneity in Non-IID data, enhancing model convergence and accuracy. Our experiments on diverse datasets, including MNIST, FashionMNIST, CIFAR-10/100, and AG News, demonstrate that Sym-CS-HFL achieves a Top-3 test accuracy while significantly reducing communication overhead by <span><math><mrow><mn>15</mn><mo>.</mo><mn>2</mn><mo>×</mo></mrow></math></span> to <span><math><mrow><mn>74</mn><mo>×</mo></mrow></math></span> compared to existing HE schemes. The computational overhead is also reduced, with training times only <span><math><mrow><mn>1</mn><mo>.</mo><mn>1</mn><mo>×</mo></mrow></math></span> to <span><math><mrow><mn>1</mn><mo>.</mo><mn>8</mn><mo>×</mo></mrow></math></span> that of plaintext training. These results underscore Sym-CS-HFL’s effectiveness in maintaining high performance and privacy in PPFL.</div></div>","PeriodicalId":48638,"journal":{"name":"Journal of Information Security and Applications","volume":"94 ","pages":"Article 104253"},"PeriodicalIF":3.7000,"publicationDate":"2025-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sym-CS-HFL: A secure and efficient solution for privacy-preserving heterogeneous federated learning\",\"authors\":\"Jinzhao Wang ,&nbsp;Wenlong Tian ,&nbsp;Junwei Tang ,&nbsp;Xuming Ye ,&nbsp;Yaping Wan ,&nbsp;Zhiyong Xu ,&nbsp;Lingna Chen\",\"doi\":\"10.1016/j.jisa.2025.104253\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In the era of big data, deep learning models play a crucial role in identifying underlying patterns within data. However, the need for large volumes of training data, often scattered across various organizations with privacy constraints, poses a significant challenge. Federated Learning (FL) addresses this by enabling the collaborative training of models without sharing the underlying data. Despite its promise, FL encounters challenges with model privacy leakage and computational overhead, particularly when dealing with non-identically distributed (Non-IID) data. To overcome these challenges, we introduce Sym-CS-HFL, a novel Privacy-Preserving Federated Learning (PPFL) framework that combines Symmetric Homomorphic Encryption with a Local Adaptive Aggregation (LAA) scheme. Our approach minimizes the reliance on asymmetric keys, simplifying the encryption process and reducing computational overhead. We implement a DCT-Neural Network Compressive Sensing Scheme to decrease communication costs substantially. Furthermore, the LAA scheme addresses the heterogeneity in Non-IID data, enhancing model convergence and accuracy. Our experiments on diverse datasets, including MNIST, FashionMNIST, CIFAR-10/100, and AG News, demonstrate that Sym-CS-HFL achieves a Top-3 test accuracy while significantly reducing communication overhead by <span><math><mrow><mn>15</mn><mo>.</mo><mn>2</mn><mo>×</mo></mrow></math></span> to <span><math><mrow><mn>74</mn><mo>×</mo></mrow></math></span> compared to existing HE schemes. The computational overhead is also reduced, with training times only <span><math><mrow><mn>1</mn><mo>.</mo><mn>1</mn><mo>×</mo></mrow></math></span> to <span><math><mrow><mn>1</mn><mo>.</mo><mn>8</mn><mo>×</mo></mrow></math></span> that of plaintext training. These results underscore Sym-CS-HFL’s effectiveness in maintaining high performance and privacy in PPFL.</div></div>\",\"PeriodicalId\":48638,\"journal\":{\"name\":\"Journal of Information Security and Applications\",\"volume\":\"94 \",\"pages\":\"Article 104253\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information Security and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S221421262500290X\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Security and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S221421262500290X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在大数据时代,深度学习模型在识别数据中的潜在模式方面发挥着至关重要的作用。然而,对大量训练数据的需求(通常分散在具有隐私限制的各种组织中)构成了一个重大挑战。联邦学习(FL)通过在不共享底层数据的情况下支持模型的协作训练来解决这个问题。尽管前途光明,但FL遇到了模型隐私泄露和计算开销的挑战,特别是在处理非同分布(Non-IID)数据时。为了克服这些挑战,我们引入了一种新的隐私保护联邦学习(PPFL)框架,该框架结合了对称同态加密和本地自适应聚合(LAA)方案。我们的方法最大限度地减少了对非对称密钥的依赖,简化了加密过程并减少了计算开销。我们实现了一种dct -神经网络压缩感知方案,大大降低了通信成本。此外,LAA方案解决了非iid数据的异构性,提高了模型的收敛性和准确性。我们在包括MNIST、FashionMNIST、CIFAR-10/100和AG News在内的不同数据集上进行的实验表明,与现有HE方案相比,symm - cs - hfl实现了前3名的测试精度,同时显着降低了15.2到74倍的通信开销。计算开销也降低了,训练次数仅为明文训练的1.1 - 1.8倍。这些结果强调了symm - cs - hfl在PPFL中保持高性能和隐私的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sym-CS-HFL: A secure and efficient solution for privacy-preserving heterogeneous federated learning
In the era of big data, deep learning models play a crucial role in identifying underlying patterns within data. However, the need for large volumes of training data, often scattered across various organizations with privacy constraints, poses a significant challenge. Federated Learning (FL) addresses this by enabling the collaborative training of models without sharing the underlying data. Despite its promise, FL encounters challenges with model privacy leakage and computational overhead, particularly when dealing with non-identically distributed (Non-IID) data. To overcome these challenges, we introduce Sym-CS-HFL, a novel Privacy-Preserving Federated Learning (PPFL) framework that combines Symmetric Homomorphic Encryption with a Local Adaptive Aggregation (LAA) scheme. Our approach minimizes the reliance on asymmetric keys, simplifying the encryption process and reducing computational overhead. We implement a DCT-Neural Network Compressive Sensing Scheme to decrease communication costs substantially. Furthermore, the LAA scheme addresses the heterogeneity in Non-IID data, enhancing model convergence and accuracy. Our experiments on diverse datasets, including MNIST, FashionMNIST, CIFAR-10/100, and AG News, demonstrate that Sym-CS-HFL achieves a Top-3 test accuracy while significantly reducing communication overhead by 15.2× to 74× compared to existing HE schemes. The computational overhead is also reduced, with training times only 1.1× to 1.8× that of plaintext training. These results underscore Sym-CS-HFL’s effectiveness in maintaining high performance and privacy in PPFL.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Information Security and Applications
Journal of Information Security and Applications Computer Science-Computer Networks and Communications
CiteScore
10.90
自引率
5.40%
发文量
206
审稿时长
56 days
期刊介绍: Journal of Information Security and Applications (JISA) focuses on the original research and practice-driven applications with relevance to information security and applications. JISA provides a common linkage between a vibrant scientific and research community and industry professionals by offering a clear view on modern problems and challenges in information security, as well as identifying promising scientific and "best-practice" solutions. JISA issues offer a balance between original research work and innovative industrial approaches by internationally renowned information security experts and researchers.
×
引用
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学术官方微信