Match!

One-pass key establishment for anonymous wireless roaming

Published on Jun 25, 2010 in WCNIS (Wireless Communications, Networking and Information Security)
· DOI :10.1109/WCINS.2010.5541836
Yuan Wang2
Estimated H-index: 2
(USTC: University of Science and Technology of China),
Duncan S. Wong1
Estimated H-index: 1
(CityU: City University of Hong Kong),
Liusheng Huang26
Estimated H-index: 26
(USTC: University of Science and Technology of China)
Abstract
In recent years, privacy protection for a roaming user has become an increasingly demanding requirement for wireless communications. A secure wireless roaming protocol should not only establish a secure session key between a roaming user and a foreign server, but also provide privacy protection so to keep user identity from being exposed (user anonymity) and user movement from being tracked (user untraceability). In this paper, we propose the first one-pass anonymous key establishment protocol for wireless roaming which requires only the roaming user and the foreign server to get involved. No eavesdropper can get the user's real identity after the first temporary ID for the user is established. In each new session, this temporary ID is updated so that eavesdroppers cannot associate those temporary IDs to any particular user, nor telling if two roaming sessions are corresponding to the same user or not. While most of the existing anonymous roaming protocols require at least three message flows, our protocol requires only one and can still provide implicit authentication.
  • References (22)
  • Citations (3)
📖 Papers frequently viewed together
48 Citations
2005
3 Authors (Guomin Yang, ..., Xiaotie Deng)
9 Citations
2004
2 Authors (T. Komori, T. Saito)
3 Citations
78% of Scinapse members use related papers. After signing in, all features are FREE.
References22
Newest
#1Guomin Yang (NUS: National University of Singapore)H-Index: 24
#2Qiong Huang (CityU: City University of Hong Kong)H-Index: 16
Last. Xiaotie Deng (CityU: City University of Hong Kong)H-Index: 40
view all 4 authors...
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 effi...
85 CitationsSource
Jul 9, 2009 in NCA (Network Computing and Applications)
#1Xiaokang Xiong (CityU: City University of Hong Kong)H-Index: 2
#2Duncan S. Wong (CityU: City University of Hong Kong)H-Index: 42
Last. Xiaotie Deng (CityU: City University of Hong Kong)H-Index: 40
view all 3 authors...
Since the introduction of bilinear pairing to public key cryptography in 2001, pairing has been considered as one of the most expensive public key operations in terms of both computational complexity and memory requirement. Recently some work has been done on improving the computation time of pairing on resource-constrained wireless sensors. However, little has been focused on reducing the memory consumption. In this paper, we propose three new algorithms for speeding up the computation and redu...
18 CitationsSource
#1Haojin Zhu (UW: University of Waterloo)H-Index: 36
#2Xiaodong Lin (UOIT: University of Ontario Institute of Technology)H-Index: 46
Last. Xuemin Shen (UW: University of Waterloo)H-Index: 85
view all 5 authors...
Wireless metropolitan area sharing networks (WMSNs) are wide-area wireless networks with nodes owned and managed by independent wireless Internet service providers (WISPs). To support seamless roaming in emerging WMSNs, in this paper, we propose a localized and distributed authentication and billing architecture that aims at enabling efficient and privacy-preserving mutual authentication between mobile users (MUs) and WISPs. User anonymity and identity privacy can be protected, even in the prese...
43 CitationsSource
#1Haojin Zhu (UW: University of Waterloo)H-Index: 36
#2Xiaodong Lin (UW: University of Waterloo)H-Index: 46
Last. Xuemin Shen (UW: University of Waterloo)H-Index: 85
view all 5 authors...
The future metropolitan-area wireless mesh networks (WMNs) are expected to contain compromise-prone mesh access points (MAPs) with a high frequency of inter-domain roaming/handoff events. This paper introduces a novel secure localized authentication and billing (SLAB) scheme, which aims to address both security guarantee and performance in terms of system compromise resilience capability, interdomain handoff authentication latency, and workload of the roaming broker (RB). With extensive analysis...
74 CitationsSource
#1M. Choudary Gorantla (QUT: Queensland University of Technology)H-Index: 11
#2Colin Boyd (QUT: Queensland University of Technology)H-Index: 38
Last. Juan Manuel González Nieto (QUT: Queensland University of Technology)H-Index: 23
view all 3 authors...
One-pass authenticated key establishment (AKE) protocols are arguably better suited to the ID-based environment than their two-pass counterparts. However, there is no ID-based one-pass AKE protocol proposed in the literature with a proof of security in an appropriate model. This paper addresses the current gap by proposing a new ID-based one-pass AKE protocol and proving it secure in a formal model. The security of the new protocol is treated under a model adapted from a formal security model fo...
26 Citations
#1Guomin Yang (CityU: City University of Hong Kong)H-Index: 24
#2Duncan S. Wong (CityU: City University of Hong Kong)H-Index: 42
Last. Xiaotie Deng (CityU: City University of Hong Kong)H-Index: 40
view all 3 authors...
In a secure roaming scenario, a user U travels to a foreign network and communicates with a foreign server V securely so that no one other than U and V can obtain the messages exchanged between them. U may also want to travel anonymously so that no one including V can find out its identity or trace its whereabouts except its home server H. There have been many key establishment protocols proposed for secure roaming. A typical application of these protocols is the mobile roaming service which may...
17 CitationsSource
#1Guomin Yang (CityU: City University of Hong Kong)H-Index: 24
#2Duncan S. Wong (CityU: City University of Hong Kong)H-Index: 42
Last. Xiaotie Deng (CityU: City University of Hong Kong)H-Index: 40
view all 3 authors...
User privacy is a notable security issue in wireless communications. It concerns about user identities from being exposed and user movements and whereabouts from being tracked. The concern of user privacy is particularly signified in systems which support roaming when users are able to hop across networks administered by different operators. In this paper, we propose a novel construction approach of anonymous and authenticated key exchange protocols for a roaming user and a visiting server to es...
48 CitationsSource
#1Takeshi Okamoto (University of Tsukuba)H-Index: 10
#2Raylin Tso (University of Tsukuba)H-Index: 11
Last. Eiji Okamoto (University of Tsukuba)H-Index: 22
view all 3 authors...
Cryptography is the ancient science of encrypting messages so that only the sender and receiver can recover them. To achieve this goal, an agreed key between the sender and receiver is required. In asymmetric cryptosytems, so far, only a few ID-based key agreement protocols are one-way and most of them can only provide authentication for only one entity to the other. In this paper, two ID-based one-way key agreement protocols are proposed. The advantage of our protocols is that the authenticatio...
21 CitationsSource
#1Guomin Yang (CityU: City University of Hong Kong)H-Index: 24
#2Duncan S. Wong (CityU: City University of Hong Kong)H-Index: 42
Last. Xiaotie Deng (CityU: City University of Hong Kong)H-Index: 40
view all 3 authors...
The Canetti-Krawczyk (CK) model uses resuable modular components to construct indistinguishability-based key exchange protocols. The reusability of modular protocol components makes it easier to construct and prove new protocols when compared with other provably secure approaches. In this paper, we build an efficient anonymous and authenticated key exchange protocol for roaming by using the modular approach under the CK-model. Our protocol requires only four message flows and uses only standard ...
11 CitationsSource
This paper analyzes the authentication and key agreement protocol adopted by Universal Mobile Telecommunication System (UMTS), an emerging standard for third-generation (3G) wireless communications. The protocol, known as 3GPP AKA, is based on the security framework in GSM and provides significant enhancement to address and correct real and perceived weaknesses in GSM and other wireless communication systems. In this paper, we first show that the 3GPP AKA protocol is vulnerable to a variant of t...
197 CitationsSource
Cited By3
Newest
#1Jun Hua KuH-Index: 1
#2Zhi Hua Cai (China University of Geosciences)H-Index: 1
Last. Bing ZhengH-Index: 2
view all 4 authors...
The article proposed one-pass authenticated key establishment protocol from optimal eta pairings in random oracle for Wireless Sensor Networks. Security of the protocol relies on Computational Diffie-Hellman Problem on Optimal Eta Pairings. In one-pass key establishment protocol, the initiator computes a session key and a re1ated message. The key token is to be sent to the intended receiver using receiver's public key and sender secret key. From the received key token the receiver compute the se...
1 CitationsSource
#1Johannes BarnickelH-Index: 4
#2Ulrike MeyerH-Index: 12
#1Yuan Wang (USTC: University of Science and Technology of China)H-Index: 2
#2Duncan S. Wong (USTC: University of Science and Technology of China)H-Index: 1
Last. Liusheng Huang (USTC: University of Science and Technology of China)H-Index: 26
view all 3 authors...
A Key Establishment Protocol for Anonymous Wireless Roaming (KEP-AWR) allows a wireless user such as a Wi-Fi/WiMAX enabled laptop or smartphone to establish a session key with a foreign server and also roam from one foreign network to another in an anonymous way such that besides the involving foreign server and the user's home server, no one can find out who the user is. Most existing KEP-AWR protocols involve all the three parties, namely, the roaming user, the foreign server and the home serv...
2 CitationsSource