In this paper, we investigate physical (PHY) layer message authentication to combat adversaries with infinite computational capacity. Specifically, a PHY-layer authentication …
In this paper, a novel message authentication model using the same key over wiretap channel is proposed to achieve information-theoretic security. Specifically, in the proposed …
D Chen, N Zhang, R Lu, X Fang… - IEEE Journal on …, 2018 - ieeexplore.ieee.org
In this paper, we study physical layer message authentication with perfect security for wireless networks, regardless of the computational power of adversaries. Specifically, we …
S Tomasin - IEEE Transactions on Wireless Communications, 2018 - ieeexplore.ieee.org
User authentication (UA) supports the receiver in deciding whether a message comes from either the claimed transmitter or an impersonating attacker. Information-theoretically secure …
We consider a cellular Internet of things (CIoT) network where many source nodes aim at exchanging messages with a single concentrator node. To this end, they are assisted by …
If Alice must communicate with Bob over a channel shared with the adversarial Eve, then Bob must be able to validate the authenticity of the message. In particular we consider the …
D Kim, S Seo, H Kim, WG Lim, YK Lee - Applied Sciences, 2020 - mdpi.com
Authentication algorithms in the form of cryptographic schemes, such as the Secure Hash Algorithm 1 (SHA-1) and the digital signature algorithm (DSA), specified in the current …
We introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system. We consider a two-user discrete memoryless multiple access …
S Jiang - IEEE Transactions on Information Forensics and …, 2015 - ieeexplore.ieee.org
We further study the keyless authentication problem in a noisy model in our previous work, where no secret setup is available for sender Alice and receiver Bob while there is discrete …