Font Size: a A A

The Research Of Efficient And Anonymous Aka Protocols And Their Applications

Posted on:2015-12-18Degree:MasterType:Thesis
Country:ChinaCandidate:X XuFull Text:PDF
GTID:2298330467463269Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
With the rapid development of Information Technology (IT), information security is becoming a significant issue in the society, and mutual authentication is one of the effective means for solving information security problems. In this dissertation, we put forward some mutual authentication and key agreement (AKA) protocols, which are based on crypto algorithms and provide an opportunity for communication parties to authenticate with each other. What is more, everyone among all participants can share a secret session key during the authentication process. An effective measure to propose secure and efficient AKA protocols for diffident application scenarios is the key point of this dissertation, and the major contributions of the dissertation are put forward as follows:1. In order to reach the certain secure requirements of Telecare Medicine Information Systems (TMIS), we propose two secure and efficient two-factor AKA schemes, which all maintain a better network connectivity and resilience against some common attacks. We employ Elliptic Curve Cryptography (ECC) with shorter key length to support less computation overhead and a higher security level compared to the standard encryption techniques (RSA, ElGamal). Besides, according to the performance analysis, we demonstrate that the two protocols have the least computational cost among other related schemes and the less communication cost. These attributes render the two ones are promising approaches in privacy protection for TMIS.2. We give an introduction of the framework for a Medical Information Private Cloud System (MIPCS) and its application for medical professional field. In addition, an efficient AKA scheme is proposed to demonstrate the application value of MIPCS. Our protocol employs the discrete logarithm problem and reaches a two-factor authentication. Information of patients in MIPCS can be involved some moral or ethical problems. Therefore, it is important to protect of user anonymity. Fortunately, our protocol is a good option which can provide lots of practical advantages for MIPCS since of the dynamic ID.3. When a mobile user roams to a foreign network managed by a foreign agent, it will perform an authentication with its home agent under the assistance of the foreign agent to receive some services managed by the home agent. We propose an AKA protocol applied for Vehicular Roaming Network (VRN), and it reaches a good balance between security and efficiency. We emphasize on the efficiency in this protocol because of the low-power and locomotive environment. Therefore, we employ ECC for reducing computation cost and guaranteeing necessary security features.
Keywords/Search Tags:information security, mutual authentication, anonymous, key agreement, elliptic curve cryptosystem
PDF Full Text Request
Related items