A Tamper-Free Semi-Universal Communication System for Deletion Channels

TL;DR

This paper introduces a new communication system designed to be tamper-proof and reliable over deletion channels, even under active jamming, using probabilistic automata for encoding and decoding.

Contribution

It presents a novel theoretical framework and encoding/decoding schemes that improve tamper detection and reliability in adversarial deletion channels.

Findings

Scheme achieves low error probability in message decoding

Scheme effectively detects tampering attempts

Experimental results confirm reliability and tamper detection

Abstract

We investigate the problem of reliable communication between two legitimate parties over deletion channels under an active eavesdropping (aka jamming) adversarial model. To this goal, we develop a theoretical framework based on probabilistic finite-state automata to define novel encoding and decoding schemes that ensure small error probability in both message decoding as well as tamper detecting. We then experimentally verify the reliability and tamper-detection property of our scheme.