LP formulations for secrecy over erasure networks with feedback

TL;DR

This paper presents LP-based schemes for secure message transmission over erasure networks with feedback, outperforming existing methods and adaptable to various scenarios.

Contribution

It introduces polynomial-time LP formulations for secure communication over erasure networks with feedback, improving upon prior approaches.

Findings

LP schemes outperform previous methods in certain scenarios

The approach extends to multiple interesting network scenarios

Schemes are polynomial-time and explicitly select paths for keys and messages

Abstract

We design polynomial time schemes for secure message transmission over arbitrary networks, in the presence of an eavesdropper, and where each edge corresponds to an erasure channel with public feedback. Our schemes are described through linear programming (LP) formulations, that explicitly select (possibly different) sets of paths for key-generation and message sending. Although our LPs are not always capacity-achieving, they outperform the best known alternatives in the literature, and extend to incorporate several interesting scenaria.