2018/01/11 by Jake Perazzone, Eric Graves, Perazzone, Jake +5
Computer Science · Engineering · #Cooperative Communication and Network Coding #Cryptographic Implementations and Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1801.03920
openalex publication_date 2018/01/11 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
The rate regions of many variations of the standard and wire-tap channels\nhave been thoroughly explored. Secrecy capacity characterizes the loss of rate\nrequired to ensure that the adversary gains no information about the\ntransmissions. Authentication does not have a standard metric, despite being an\nimportant counterpart to secrecy. While some results have taken an\ninformation-theoretic approach to the problem of authentication coding, the\nfull rate region and accompanying trade-offs have yet to be characterized. In\nthis paper, we provide an inner bound of achievable rates with an average\nauthentication and reliability constraint. The bound is established by\ncombining and analyzing two existing authentication schemes for both noisy and\nnoiseless channels. We find that our coding scheme improves upon existing\nschemes.\n