2024/04/02 by Esther Hänggi, Hänggi, Esther, Iyán Méndez Veiga +3 · 1 citation
Computer Science · Engineering · #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #Internet Traffic Analysis and Secure E-voting #Smart Grid Security and Resilience
paper · pdf · doi:10.48550/arxiv.2404.01760
openalex publication_date 2024/04/02 · openalex created_date 2024/04/05 · openalex updated_date 2026/07/28
We consider the wiretap channel, where the individual channel uses have memory or are influenced by an adversary. We analyze the explicit and computationally efficient construction of information-theoretically secure coding schemes which use the inverse of an extractor and an error-correcting code. These schemes are known to achieve secrecy capacity on a large class of memoryless wiretap channels. We show that this also holds for certain channel types with memory. In particular, they can achieve secrecy capacity on channels where an adversary can pick a sequence of ``states'' governing the channel's behavior, as long as, given every possible state, the channel is strongly symmetric.