Robust secret storage in networks
Summary
Robust secret storage in networks introduces a formal framework for distributed secret storage, balancing survivability under network degradation with resistance to adversarial compromise. It defines minimal information-carrying subgraphs (MICS) to compactly describe reconstruction events and develops semi-local optimization methods that do not require full global knowledge of the network. In a limiting case, the robustness functional maps to an effective spin Hamiltonian.