Loading...

Anonymous Mutual Authentication: An Information Theoretic Framework

Kazempour, N ; Sharif University of Technology | 2021

197 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/IWCIT53998.2021.9519620
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2021
  4. Abstract:
  5. We consider the anonymous mutual authentication problem, which consists of a certificate authority, single or multiple verifiers, many legitimate users (provers) and any arbitrary number of illegitimate users. The legal verifier and a legitimate user must be mutually authenticated to each other using the user's key, while the identity of the user must stay unrevealed. An attacker (illegitimate prover) as well as an illegal verifier must fail in authentication. A general interactive information theoretic framework in a finite field is proposed, where the normalized total key rate as a metric for reliability is defined. Maximizing this rate has a trade-off with establishing anonymity. The problem is studied in two different scenarios: centralized scenario (one single verifier performs the authentication process) and distributed scenario (authentication is done by N verifiers, distributively). For both scenarios, achievable schemes, which satisfy the completeness, soundness (at both verifier and prover) and anonymity properties, are proposed. Increasing the size of the field, results in the key rate approaching its upper bound. © 2021 IEEE
  6. Keywords:
  7. Authentication ; Economic and social effects ; Anonymity property ; Arbitrary number ; Certificate authority ; Finite fields ; Interactive informations ; Legitimate users ; Mutual authentication ; Upper Bound ; Information theory
  8. Source: 9th Iran Workshop on Communication and Information Theory, IWCIT 2021, 19 May 2021 through 20 May 2021 ; 2021 ; 9781665400565 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/9519620