A Two-Stage Stochastic Programming Approach for the Key Management q-Composite Scheme

Maciej Rysz (), Guanglin Xu and Alexander Semenov ()
Additional contact information
Maciej Rysz: Miami University
Guanglin Xu: University of North Carolina at Charlotte
Alexander Semenov: University of Florida

A chapter in Handbook of Trustworthy Federated Learning, 2025, pp 197-219 from Springer

Abstract: Abstract In federated learning, data is distributed across multiple devices or nodes, making secure and efficient information transfer a critical challenge. This requires the advancement of complex encryption strategies that can guarantee secure communications when one or more network sensors (nodes) are compromised (e.g., hacked), and when the network topology is not known a priori. In this article, we consider the q-Composite scheme, where a pair of nodes within proximity must share at least q keys to communicate. We introduce a stochastic optimization model for finding optimal key assignments that produce a desired level of communication security in settings where the network topology is unknown in advance. The model enables secure encryption strategies that are resilient against node capture, failures, and network topology changes. We present computational studies to demonstrate the efficacy of the proposed scheme.

Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-58923-2_7

Ordering information: This item can be ordered from
http://www.springer.com/9783031589232

DOI: 10.1007/978-3-031-58923-2_7

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().