A coding approach to guarantee information integrity against a Byzantine relay

TL;DR

This paper introduces a random coding scheme enabling two nodes to exchange information with guaranteed integrity over a Byzantine relay without pre-shared secrets, expanding capacity bounds beyond secret-based methods.

Contribution

The paper proposes a novel coding scheme that guarantees information integrity in two-way Byzantine relay communication without secret keys, improving capacity bounds.

Findings

Inner bound on capacity region with guaranteed integrity

No pre-shared secret needed for the scheme

Larger capacity bounds than secret-based schemes

Abstract

This paper presents a random coding scheme with which two nodes can exchange information with guaranteed integrity over a two-way Byzantine relay. This coding scheme is employed to obtain an inner bound on the capacity region with guaranteed information integrity. No pre-shared secret or secret transmission is needed for the proposed scheme. Hence the inner bound obtained is generally larger than those achieved based on secret transmission schemes. This approach advocates the separation of supporting information integrity and secrecy.