Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: Ph.D. Dissertation
- Language: Farsi
- Document No: 58016 (05)
- University: Sharif University of Technology
- Department: Electrical Engineering
- Advisor(s): Aref, Mohammad Reza
- Abstract:
- Today, ensuring privacy alongside other security features is essential for many services, and with the advancement of various technologies, different aspects of privacy are emerging. In most systems, establishing privacy is a challenging issue that may conflict with other system features or reduce the effectiveness of other system parameters. This dissertation studies privacy from the perspective of information theory in authentication as one of the significant security challenges. Applications of this issue include vehicular networks, sensor networks, and services based on blockchain technology. We consider various privacy features in the authentication problem, which includes a certificate authority, one or multiple verifiers, several legitimate users (provers), and any number of attackers. In anonymous authentication, each legitimate user aims to be authenticated by the verifier(s) using their personal key while remaining completely anonymous (even to the verifier). Conversely, an attacker must fail in the authentication process. In anonymous mutual authentication, the legal verifier and legitimate user must mutually authenticate each other using the user’s key, while the user’s identity must remain concealed. An attacker (illegitimate prover) and an illegal verifier must both fail during the authentication process. Other privacy features considered include untraceability and unlinkability. Untraceability ensures that an attacker eavesdropping the links between the user and the verifiers cannot identify the user’s identity during the authentication process. Unlinkability guarantees that the eavesdropper is unable to link the identities of users during multiple authentication processes. To address these issues, a general framework based on information theory is proposed in two regimes: finite fields and asymptotic regime, where the normalized total key rate is defined as a metric for reliability. Maximizing this rate presents a trade-off with establishing privacy. These problems are studied in both single-server and multi-server scenarios. In the multi-server case, two perspectives are considered: individual authentication (where a single verifier conducts the authentication process) and distributed authentication (where authentication is performed by N verifiers in a distributed manner). For all these cases, achievable schemes that meet the desired features of the problems are proposed
- Keywords:
- Information Theory ; Privacy ; Authentication ; Anonymity ; Unlinkability
Digital Object List
محتواي کتاب
Bookmark