identity authentication over noisy channels

Clicks: 149
ID: 223960
2015
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #320 of 406 articles by views in European journal of medicinal chemistry

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 406 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
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.
Reference Key
zheng2015entropyidentity Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Fanfan Zheng;Zhiqing Xiao;Shidong Zhou;Jing Wang;Lianfen Huang
Journal European journal of medicinal chemistry
Year 2015
DOI
10.3390/e17074940
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.