Secret key authentication capacity region, Part I: average authentication rate
Jake Perazzone, Eric Graves, Paul Yu, Rick Blum

TL;DR
This paper characterizes the secret key authentication capacity region for a model where an adversary can replace observations, providing improved inner bounds using a novel combination of classical techniques.
Contribution
It introduces the first inner bound for the secret key authentication capacity region under the maximum expected false authentication metric, merging classical methods innovatively.
Findings
Improved inner bounds on authentication capacity region.
Authentication derived from both noisy channels and source obscurity.
First analysis under the maximum expected false authentication metric.
Abstract
This paper investigates the secret key authentication capacity region. Specifically, the focus is on a model where a source must transmit information over an adversary controlled channel where the adversary, prior to the source's transmission, decides whether or not to replace the destination's observation with an arbitrary one of their choosing (done in hopes of having the destination accept a false message). To combat the adversary, the source and destination share a secret key which they may use to guarantee authenticated communications. The secret key authentication capacity region here is then defined as the region of jointly achievable message rate, authentication rate, and key consumption rate (i.e., how many bits of secret key are needed). This is the first of a two part study, with the parts differing in how the authentication rate is measured. In this first study the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Chaos-based Image/Signal Encryption
