<p>Federated Learning (FL) is a machine learning framework that effectively provides multiple organizations with data usage and model training while meeting the requirements of privacy protection, data security and government regulations. However, the leakage of parameters frequently occurred in the process of their exchange. Existing parametric encryption algorithms, such as differential privacy and homomorphic encryption, can significantly elevate privacy protection levels but always bring negative effect to the convergence performance of the final model or huge time consuming for practical application. Therefore, this paper propose a new encryption and decryption algorithm based on the hyperchaotic system, called bit and parameter correlation permutation (BCP), which helps to protect the parameters through the upload and download process, and such algorithm is compatible with any hyperchaotic map. With this method, we could guarantee the security without any sacrifices of model accuracy in a shorter period of time. Finally, the proposed algorithm achieves a time complexity of O(<InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10489_2024_6209_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="23" /> </InlineMediaObject> <EquationSource Format="TEX">\(N^2\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>N</mi> <mn>2</mn> </msup> </math></EquationSource> </InlineEquation>) and offers a 0.69 reduction in loss for FL when compared with the differential privacy, while both ensure high security. Additionally, BCP can yield a difference of <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10489_2024_6209_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\(10^{50}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mn>10</mn> <mn>50</mn> </msup> </math></EquationSource> </InlineEquation> orders of magnitude, even with inputs differing by only <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10489_2024_6209_Article_IEq3.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="39" /> </InlineMediaObject> <EquationSource Format="TEX">\(10^{-11}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mn>10</mn> <mrow> <mo>-</mo> <mn>11</mn> </mrow> </msup> </math></EquationSource> </InlineEquation>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Parameters security strategy formulated by hyperchaos in federal learning

  • Zhen Yang,
  • Tiancheng Yang,
  • Shouliang Li,
  • Huale Li

摘要

Federated Learning (FL) is a machine learning framework that effectively provides multiple organizations with data usage and model training while meeting the requirements of privacy protection, data security and government regulations. However, the leakage of parameters frequently occurred in the process of their exchange. Existing parametric encryption algorithms, such as differential privacy and homomorphic encryption, can significantly elevate privacy protection levels but always bring negative effect to the convergence performance of the final model or huge time consuming for practical application. Therefore, this paper propose a new encryption and decryption algorithm based on the hyperchaotic system, called bit and parameter correlation permutation (BCP), which helps to protect the parameters through the upload and download process, and such algorithm is compatible with any hyperchaotic map. With this method, we could guarantee the security without any sacrifices of model accuracy in a shorter period of time. Finally, the proposed algorithm achieves a time complexity of O( \(N^2\) N 2 ) and offers a 0.69 reduction in loss for FL when compared with the differential privacy, while both ensure high security. Additionally, BCP can yield a difference of \(10^{50}\) 10 50 orders of magnitude, even with inputs differing by only \(10^{-11}\) 10 - 11 .