Keyless authentication in the presence of a simultaneously transmitting\n adversary

2016/09/29 by Eric Graves, Graves, Eric, Paul K. L. Yu +3
Computer Science · Engineering · #Cryptographic Implementations and Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1609.09454

openalex publication_date 2016/09/29 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28

Abstract

If Alice must communicate with Bob over a channel shared with the adversarial\nEve, then Bob must be able to validate the authenticity of the message. In\nparticular we consider the model where Alice and Eve share a discrete\nmemoryless multiple access channel with Bob, thus allowing simultaneous\ntransmissions from Alice and Eve. By traditional random coding arguments, we\ndemonstrate an inner bound on the rate at which Alice may transmit, while still\ngranting Bob the ability to authenticate. Furthermore this is accomplished in\nspite of Alice and Bob lacking a pre-shared key, as well as allowing Eve prior\nknowledge of both the codebook Alice and Bob share and the messages Alice\ntransmits.\n

Related

• Composable, Unconditionally Secure Message Authentication without any Secret Key
• Keyless Authentication for AWGN Channels
• Authentication Against a Myopic Adversary
• On the Optimality of Keyless Authentication in a Noisy Model
• On Authentication against a Myopic Adversary using Stochastic Codes