Relative greedy weights advance measures of information leakage in coding
On Relative Greedy Weights
Information TheoryCryptography and Security
Summary
Measuring how much information an eavesdropper can gather is important for secure communication. The paper revisits and expands tools called relative greedy weights, which quantify how well an adversary using a greedy strategy can access information. The authors introduce new versions of these weights and compare them to previous ones, showing cases where the new measures provide a stronger assessment. They also explore applications beyond the originally intended two-party communication scenarios.
What this means in practice
- •For network security engineers: Design communication protocols that better assess and limit information leakage under greedy adversary attacks using the new relative greedy weight measures.
- •For error correction code designers: Develop nested code families with improved resistance to information leakage assessed by bottom-up greedy weights to enhance coding security.
A theory result. No direct application yet.
Authors
Olav Geil
Abstract
Relative greedy weights were introduced by Li and Liu in [19] as a measure of information leakage in coordinated two-party wire-tap channels of type II when the adversary follows a greedy strategy. Their definition can be viewed as a relative version of the CEZ greedy weights, which are only locally greedy. In this paper, we revisit the concept of greediness and relative greediness introducing new measures, and we discuss other perhaps more relevant applications of relative greedy weights than the coordinated two-party wire-tap channel of type II. We pay special attention to bottom-up greedy weights, which correspond to an adversary with an ultimate greedy approach, and we present families of nested codes for which such weights are larger than the relative CEZ greedy weights.