Due to the expectedly higher density of mobile devices and exhaust of radio resources, the fifth generation (5G) mobile networks introduce small cell concept in the radio access technologies, so-called Small Cell Networks (SCNs), to improve radio spectrum utilization. However, this increases the chance of handover due to smaller coverage of a micro base station, i.e., home eNodeB (HeNB) in 5G. Subsequently, the latency will increase as the costs of authenticated key exchange protocol, which ensures entity authentication and communication confidentiality for secure handover, also increase totally. Thus, this work presents a secure region-based handover scheme (ReHand) with user anonymity and fast revocation for SCNs in 5G. ReHand greatly reduces the communication costs when UEs roam between small cells within the region of a macro base station, i.e., eNB in 5G, and the computation costs due to the employment of symmetry-based cryptographic operations. Compared to the three elaborated related works, ReHand dramatically reduces the costs from 82.92 to 99.99 . Nevertheless, this work demonstrates the security of ReHand by theoretically formal proofs.
A notable amount of roaming-based AKE protocols have been proposed and user anonymity has been carefully deliberated in @cite_25 @cite_32 @cite_17 @cite_16 @cite_3 @cite_6 @cite_26 @cite_37 @cite_54 @cite_27 @cite_18 @cite_46 . In mobile networks, an UE should complete authentication for identity identification prior to requesting for services when roaming to the coverage of a new visiting foreign network (FN). The user anonymous authentication prevents eavesdroppers or and FN from exposing the real identities of UEs in every authentication session such that the footprints of communications of UEs are concealed.
@cite_37 @cite_26 @cite_18 @cite_54 @cite_32 @cite_3 @cite_6 @cite_27 @cite_46 @cite_16 @cite_25 @cite_17
2091041197 2061926529 2316444051 2151648452 2131353907 2099803980 2032309315
The roaming service enables mobile subscribers to access the internet service anytime and anywhere, which can fulfill the requirement of ubiquitous access for the emerging paradigm of networking, e.g., the Internet of Things (IoT). In this paper, we propose a conditional privacy-preserving authentication with access linkability (CPAL) for roaming service, to provide universal secure roaming service and multilevel privacy preservation. CPAL provides an anonymous user linking function by utilizing a novel group signature technique, which can not only efficiently hide users’ identities but also enables the authorized entities to link all the access information of the same user without knowing the user’s real identity. Specifically, by using the master linking key possessed by the trust linking server, the authorized foreign network operators or service providers can link the access information from the user to improve its service, while preserving user anonymity, e.g., using individual access information to analyze user preferences without revealing user’s identity. Furthermore, the subscribers can also use this functionality to anonymously query their usage of service. In addition, CPAL has an efficient revocation function, which revokes a group of users at the same time. Through extensive analysis, we demonstrate that CPAL resists various security threats and provides more flexible privacy preservation compared to the existing schemes. Meanwhile, performance evaluations demonstrate its efficiency in terms of communication and computation overhead. We propose an anonymous authentication protocol that supports time-bound credentials for an efficient revocation. It is especially suitable for large-scale network in roaming scenario. With our newly designed group signature scheme as a building block, a timestamp can be embedded to user secret key. No expired key can be used to authenticate, and hence naturally revoked users (e.g., due to contract expiration) are not required to be put into the revocation list. This makes our protocol much faster than previous roaming protocols in terms of revocation checking, which is a main part in verification. User authentication is an imperative security mechanism for recognizing legal roaming users. However, designing an expeditious anonymous-user authentication scheme in the global mobility networking (GLOMONET) environment is always a challenging task. Because, due to the broadcast nature of the wireless channels, wireless networks are often susceptible to various attacks and mobile devices powered by batteries that have limited communication, processing, and storage capabilities. In this paper, we propose a lightweight, secure, and an expeditious authentication scheme, which can preserve the user anonymity for roaming services in GLOMONET. In this regard, we use the low-cost cryptographic primitives such as one-way hash functions and exclusive-or operations to accomplish goals, which is more suitable for battery-powered mobile devices. Although some authentication protocols for GLOMONET security have already been proposed, however, they are unable to achieve the desired imperative security properties, such as anonymity, privacy against eavesdroppers, communication security, etc. As a consequence of that, they are vulnerable to various security issues. Security and performance analyses show that our proposed scheme is secure and even more efficient, as compared with other related authentication schemes in GLOMONET. Two novel mutual authentication and key exchange protocols with anonymity are proposed for different roaming scenarios in the global mobility network. The new features in the proposed protocols include identity anonymity and one-time session key renewal. Identity anonymity protects mobile users privacy in the roaming network environment. One-time session key progression frequently renews the session key for mobile users and reduces the risk of using a compromised session key to communicate with visited networks. It has demonstrated that the computation complexity of the proposed protocols is similar to the existing ones, while the security has been significantly improved Seamless roaming over wireless networks is highly desirable to mobile users, and security such as authentication of mobile users is challenging. In this paper, we propose a privacy-preserving universal authentication protocol, called Priauth, which provides strong user anonymity against both eavesdroppers and foreign servers, session key establishment, and achieves efficiency. Most importantly, Priauth provides an efficient approach to tackle the problem of user revocation while supporting strong user untraceability. A secure roaming protocol allows a roaming user U to visit a foreign server V and establish a session key in an authenticated way such that U authenticates V and at the same time convinces V that it is a legitimate subscriber of some server H, called the home server of U. The conventional approach requires the involvement of all the three parties. In this paper, we propose a new approach which requires only two parties, U and V, to get involved. We propose two protocols: one provides better efficiency and supports user anonymity to an extent comparable to that provided by current mobile systems; and the other one achieves strong user anonymity that protects U's identity against both eavesdroppers and foreign servers and is currently the strongest notion of user anonymity defined for secure roaming. Both protocols are universal in the sense that the same protocol and signaling flows are used regardless of the domain (home or foreign) that U is visiting. This helps reducing the system complexity in practice. We also propose a practical user revocation mechanism, which is one of the most challenging problems for two-party roaming supporting strong user anonymity. Our solutions can be applied in various kinds of roaming networks such as cellular networks and interconnected wireless local area networks. Wireless network is susceptible to security attacks because its openness of transmission media. Wireless network security is somewhat more concentrated and complex than that of wired network. Authentication is the most essential procedure to ensure that the service is properly used. But its limited resource, such as weak power supplies and limited bandwidth, must be taken into account in the design of security schemes. In this paper, we present a new and efficient wireless authentication protocol providing user anonymity. Our scheme is based on the hash function and smart cards, and mobile users only do symmetric encryption and decryption. In our protocol, it takes only one round of message exchange between the mobile user and the visited network, and one round of message exchange between the visited network and the corresponding home network. The most significant feature is one-time use of key between mobile user and visited network. Finally, the performance of our scheme is analyzed.