The Experts below are selected from a list of 90 Experts worldwide ranked by ideXlab platform
Shi Jing-lin - One of the best experts on this subject based on the ideXlab platform.
-
3GPP Authentication and key agreement protocol based on public key cryptosystem
Journal of Computer Applications, 2009Co-Authors: Shi Jing-linAbstract:The Authentication and key agreement protocol adopted by 3rd Generation Partnership Project (3GPP) System Architecture Evolution (SAE) Release 8 standard was analyzed in contrast with 3G,and several security defects in SAE protocol were pointed out,then an improved 3GPP SAE Authentication and key agreement protocol was put forward based on public key cryptosystem. In the new protocol,user's identity information and Authentication Vector in network domain were encrypted based on public key cryptosystem,public parent key adopted in local Authentication was generated by random data. The security and efficiency of the proposed new scheme was analyzed at last. The analysis results show that the proposal can effectively solve the problems mentioned above and improve the security of protocol with less cost.
Min-shiang Hwang - One of the best experts on this subject based on the ideXlab platform.
-
An effective AKA protocol for UMTS
International Journal of Mobile Communications, 2012Co-Authors: Iuon-chang Lin, Min-shiang HwangAbstract:Universal Mobile Telecommunication System (UMTS) is the most popular third-generation mobile phone system at present and the UMTS AKA is Authentication and key agreement protocol. There are some weaknesses in the existing UMTS AKA protocol, such as synchronisation question, storage overhead, insecurity with leakiness Authentication Vector and weakness in mutual Authentications. In this paper, we use the concept of proxy key to design a more secure and more efficient UMTS AKA protocol. Our protocol can not only resist the above-mentioned drawback of the original UMTS AKA protocol on the security, but also improve the performance of UMTS AKA protocol, including the computational overhead, storage overhead and communication overhead.
-
A cocktail protocol with the Authentication and Key Agreement on the UMTS
Journal of Systems and Software, 2010Co-Authors: Min-shiang Hwang, Jinn-ke JanAbstract:At present, the Universal Mobile Telecommunications System (UMTS) is very popular in most parts of the world. It is a third-generation mobile communication technique known for its ability to conduct user Authentication and for its security of communication with the use of Authentication and Key Agreement (AKA) protocol. A mobile station (MS), a service network (SN) and a home environment (HE) use the protocol to authenticate each other and make an agreement with a session key. With the UMTS-AKA protocol standard, all Authentication Vectors (AV) produced by the HE are transferred to the SN for mutual Authentication with the MS. In this scenario, Authentication is exposed to two kinds of defects. One defect is computational overhead concentrating on the HE and the other is the communication overhead for delivering the AVs. To overcome these congenital defects, this study proposes a unique UMTS-AKA protocol called the cocktail-AKA protocol. The goal of this protocol is to allow the SN to share some medicated Authentication Vectors (MAV) that are calculated in advance and combined with a prescription at the Authentication stage. So, the HE only needs to produce a prescription Authentication Vector (PAV). Once the Authentication stage is initiated, the SN distributes MAV and PAV and produces an effective AV for mutual Authentication with the MS. The cocktail-AKA protocol can overcome both the aforesaid defects.
Lin-yi Wu - One of the best experts on this subject based on the ideXlab platform.
-
Authentication Vector Management for UMTS
IEEE Transactions on Wireless Communications, 2007Co-Authors: Lin-yi WuAbstract:In Universal Mobile Telecommunication System (UMTS), the security function provides mutual authenticity and key agreement between the core network and the Mobile Station (MS). Specifically, the Serving GPRS Support Node (SGSN) in the core network obtains an array of Authentication Vectors (AVs) from the Home Subscriber Server/Authentication Center (HSS/AuC), and consumes one AV for each mutual Authentication. After the departure of the MS, the SGSN may keep the unused AVs for a time interval called the Reservation Timeout (RT) period. If the MS returns within the RT period, the SGSN uses the stored AVs for mutual Authentication instead of obtaining new AVs from the HSS/AuC. Note that a long RT period results in fewer accesses to the HSS/AuC at the cost of extra AV storage in the SGSN. In this paper, we propose an analytic model to investigate the impact of the RT period on the system performance. Our study provides the guidelines for the mobile operators to select an appropriate RT period.
Jinn-ke Jan - One of the best experts on this subject based on the ideXlab platform.
-
A cocktail protocol with the Authentication and Key Agreement on the UMTS
Journal of Systems and Software, 2010Co-Authors: Min-shiang Hwang, Jinn-ke JanAbstract:At present, the Universal Mobile Telecommunications System (UMTS) is very popular in most parts of the world. It is a third-generation mobile communication technique known for its ability to conduct user Authentication and for its security of communication with the use of Authentication and Key Agreement (AKA) protocol. A mobile station (MS), a service network (SN) and a home environment (HE) use the protocol to authenticate each other and make an agreement with a session key. With the UMTS-AKA protocol standard, all Authentication Vectors (AV) produced by the HE are transferred to the SN for mutual Authentication with the MS. In this scenario, Authentication is exposed to two kinds of defects. One defect is computational overhead concentrating on the HE and the other is the communication overhead for delivering the AVs. To overcome these congenital defects, this study proposes a unique UMTS-AKA protocol called the cocktail-AKA protocol. The goal of this protocol is to allow the SN to share some medicated Authentication Vectors (MAV) that are calculated in advance and combined with a prescription at the Authentication stage. So, the HE only needs to produce a prescription Authentication Vector (PAV). Once the Authentication stage is initiated, the SN distributes MAV and PAV and produces an effective AV for mutual Authentication with the MS. The cocktail-AKA protocol can overcome both the aforesaid defects.
Sufian Yousef - One of the best experts on this subject based on the ideXlab platform.
-
Analytical model for Authentication transmission overhead between entities in mobile networks
Computer Communications, 2007Co-Authors: Ja'afer Al-saraireh, Sufian YousefAbstract:This paper analyses the Authentication and key agreement (AKA) protocol for UMTS mobile networks. In this research the current Authentication protocol has been enhanced by reducing the network traffic, signalling message between entities. Consequently the bottleneck at Authentication centre is avoided. This is achieved by reducing the number of messages between mobile and Authentication centre, then reducing the Authentication times, and setup time as well as improving Authentication efficiency as shown in analytical analysis and simulation results. In this paper dynamic length (L) for an array for Authentication Vector (AV) has been proposed. This requires designing a new technique to predict the numbers of records in AV in each Authentication data request depending on the arrival rate of Authentication events and residence time of the mobile station (MS) in VLR/SGSN. The analytical and simulation study have been carried out to explore the impact of dynamic length for Authentication Vector on the signalling traffic in mobile network. To validate the simulation results in this research work, the results have been compared with the analytical results and fill match has been achieved.
-
Analyses Authentication and KeyAgreement (AKA) Protocol for UMTS Mobile Networks
2006 Proceedings of the First Mobile Computing and Wireless Communication International Conference, 2006Co-Authors: Ja'afer Al-saraireh, Sufian YousefAbstract:This paper analyses the Authentication and key agreement (AKA) protocol for UMTS mobile networks, where a new Authentication protocol which is able to reduce the network traffic and signaling message between entities, and consequently the bottleneck at Authentication centre is avoided, this is achieved by reducing the number of messages between mobile and Authentication centre, and then reducing the Authentication times and setup time as well as improving Authentication efficiency as shown in numerical analysis and simulation results. In this paper we propose dynamic length (L) for an array for Authentication Vector (AV). This required designing new technique to predict the numbers of records in AV in each Authentication data request depending on the to arrival rate of Authentication events and residence time of MS in VLR/SGSN. The proposed AKA with dynamic L for AV is compared with the current AKA with fixed length for AV.
-
Authentication Transmission Overhead Between Entities in Mobile Networks
2006Co-Authors: Sufian YousefAbstract:This paper analyses the Authentication and key agreement (AKA) protocol for UMTS mobile networks, where a new Authentication protocol which is able to reduce the network traffic and signaling message between entities, and consequently the bottleneck at Authentication centre is avoided, this is achieved by reducing the number of messages between mobile and Authentication centre, and then reducing the Authentication times and setup time as well as improveing Authentication efficiency as shown in numerical analysis and simulation results. In this paper we propose dynamic length (L) for an array for Authentication Vector (AV). This required designing new technique to predict the numbers of records in AV in each Authentication data request depending on the to arrival rate of Authentication events and residence time of MS in VLR/SGSN. The proposed AKA with dynamic L for AV is compared with the current AKA with fixed length for AV.
