<p>Federated learning (FL) enables distributed model training with data privacy, but requires efficient authentication and communication in resource-constrained environments. This paper presents SSL-FL, a framework that combines semiconductor superlattice physically unclonable functions (SSL-PUFs) and compressed sensing (CS). SSL-PUFs exploit chaotic synchronization to generate device-specific true random keys from quantum randomness, enabling decentralized authentication without centralized key management or large storage tables. CS compresses model updates, reducing transmission overhead while retaining data required for aggregation. The protocol employs multi-client challenge perturbations to enforce cross-device key generation consistency against side-channel attacks. An adaptive timing mechanism further optimizes synchronization under variable network conditions. Security is verified with BAN logic and Real-Or-Random models, confirming the consistency and indistinguishability of keys, and addressing various threats through informal analysis. Experiments show that it can resist a wide range of attacks from simple replay to complex time manipulation while maintaining moderate accuracy at compression ratios from 0.04 to 0.5. The framework generates proofs of size <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="44443_2025_29_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="120" /> </InlineMediaObject> <EquationSource Format="TEX">\(2|C|+|R|+|T|\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <mo stretchy="false">|</mo> <mi>C</mi> <mo stretchy="false">|</mo> <mo>+</mo> <mo stretchy="false">|</mo> <mi>R</mi> <mo stretchy="false">|</mo> <mo>+</mo> <mo stretchy="false">|</mo> <mi>T</mi> <mo stretchy="false">|</mo> </mrow> </math></EquationSource> </InlineEquation> (132 bytes) with computational cost of <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="44443_2025_29_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="93" /> </InlineMediaObject> <EquationSource Format="TEX">\(2T_{\text {PUF}}+T_{SE}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <msub> <mi>T</mi> <mtext>PUF</mtext> </msub> <mo>+</mo> <msub> <mi>T</mi> <mrow> <mi mathvariant="italic">SE</mi> </mrow> </msub> </mrow> </math></EquationSource> </InlineEquation> per round, reducing communication and computation requirements compared to existing approaches. SSL-FL provides a secure and scalable solution for FL in dynamic, resource-limited environments.</p>

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

SSL-FL: A lightweight authentication framework for secure federated learning

  • Xianwei Gao,
  • Bi Chen,
  • Xiang Yao,
  • Ye Yuan,
  • Zhufeng Suo

摘要

Federated learning (FL) enables distributed model training with data privacy, but requires efficient authentication and communication in resource-constrained environments. This paper presents SSL-FL, a framework that combines semiconductor superlattice physically unclonable functions (SSL-PUFs) and compressed sensing (CS). SSL-PUFs exploit chaotic synchronization to generate device-specific true random keys from quantum randomness, enabling decentralized authentication without centralized key management or large storage tables. CS compresses model updates, reducing transmission overhead while retaining data required for aggregation. The protocol employs multi-client challenge perturbations to enforce cross-device key generation consistency against side-channel attacks. An adaptive timing mechanism further optimizes synchronization under variable network conditions. Security is verified with BAN logic and Real-Or-Random models, confirming the consistency and indistinguishability of keys, and addressing various threats through informal analysis. Experiments show that it can resist a wide range of attacks from simple replay to complex time manipulation while maintaining moderate accuracy at compression ratios from 0.04 to 0.5. The framework generates proofs of size \(2|C|+|R|+|T|\) 2 | C | + | R | + | T | (132 bytes) with computational cost of \(2T_{\text {PUF}}+T_{SE}\) 2 T PUF + T SE per round, reducing communication and computation requirements compared to existing approaches. SSL-FL provides a secure and scalable solution for FL in dynamic, resource-limited environments.