A Tamper-Free Semi-Universal Communication System for Deletion Channels
This addresses secure communication for legitimate parties in adversarial environments, but appears incremental as it builds on existing deletion channel models with added tamper detection.
The paper tackled reliable communication over deletion channels with active eavesdropping by developing a theoretical framework using probabilistic finite-state automata for encoding and decoding, resulting in small error probabilities for message decoding and tamper detection, as verified experimentally.
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.