Abstract
Identity authentication is the process of verifying users’ validity. Unlike classical key-based authentications, which are built on noiseless channels, this paper introduces a general analysis and design framework for identity authentication over noisy channels. Specifically, the authentication scenarios of single time and multiple times are investigated. For each scenario, the lower bound on the opponent’s success probability is derived, and it is smaller than the classical identity authentication’s. In addition, it can remain the same, even if the secret key is reused. Remarkably, the Cartesian authentication code proves to be helpful for hiding the secret key to maximize the secrecy performance. Finally, we show a potential application of this authentication technique.
Highlights
Identity authentication verifies users’ identities to prevent potential losses caused by fraudsters [1,2]
(3) In the multiple-time authentication scenario, with the Cartesian authentication code, we show that the noise spreading over two separate channels can together hide the secret key from the opponent
In comparison with the classical authentication model, analysis results have shown that our new authentication model is more secure
Summary
Identity authentication ( known as identification or entity authentication) verifies users’ identities to prevent potential losses caused by fraudsters [1,2]. This lower bound suggests that after eavesdropping on several rounds of authentication, Eve can be aware of almost all of the information about the secret key K She can initiate an attack successfully with a high probability. By jointly designing the channel and authentication coding, Eve’s success probability can reduce from P ≥ 2−H(K)/2 to P = 2−H(K) , since the secret key can be hidden from her by channel noise. (3) In the multiple-time authentication scenario, with the Cartesian authentication code, we show that the noise spreading over two separate channels can together hide the secret key from the opponent. In this way, the opponent’s success probability can be effectively reduced.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
