Anonymous handover authentication protocol for mobile wireless networks with conditional privacy preservation  被引量:7

Anonymous handover authentication protocol for mobile wireless networks with conditional privacy preservation

在线阅读下载全文

作  者:Debiao HE Ding WANG Qi XIE Kefei CHEN 

机构地区:[1]State Key Laboratory of Software Engineering, Computer School, Wuhan University, Wuhan 430072, China [2]State Key Laboratory of Cryptology, Beijing 100878, China [3]School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China [4]Hangzhou Key Laboratory of Cryptography and Network Security, Hangzhou Normal University, Hangzhou 311121, China

出  处:《Science China(Information Sciences)》2017年第5期109-125,共17页中国科学(信息科学)(英文版)

基  金:supported by National Natural Science Foundation of China (Grant Nos. 61572379, 61501333, U1536204);National High Technology Research and Development Program of China (863 Program) (Grant No. 2015AA016004);Open Foundation of the State Key Laboratory of Cryptology, and Natural Science Foundation of Hubei Province (Grant No. 2015CFB257);Wang D was supported by National Natural Science Foundation of China (Grant No. 61472016);Xie Q was supported by Natural Science Foundation of Zhejiang Province (Grant No. LZ12F02005);National Basic Research Program of China (973 Program) (Grant No. 2013CB834205);National Natural Science Foundation of China (Grant Nos. 61133014, 61472114)

摘  要:With the development of the wireless communication technology and the popularity of mobile devices, the mobile wireless network(MWN) has been widely used in our daily life. Through the access point(AP), users could access the Internet anytime and anywhere using their mobile devices. Therefore, MWNs can bring much convenience to us. Due to the limitation of AP's coverage, the seamless handover frequently occurs in practical applications. How to guarantee the user's privacy and security and identify the real identity when he/she brings harm to the system becomes very challenging. To achieve such goals, many anonymous handover authentication(AHA) protocols have been proposed in the last several years. However, most of them have high computation costs because mobile nodes need to carry out the bilinear pairing operations or the hash-to-point operations. Besides, most of them cannot satisfy some critical requirements, such as non-traceability and perfect forward secrecy. In this paper, we first outline the security requirements of AHA protocols, and then propose a new AHA protocol to eliminate weaknesses existing in previous AHA protocols. Based on the hardness of two famous mathematical problems, we demonstrate that the proposed AHA protocol is secure against different kinds of attacks and can meet a variety of security requirements. It can be seen from the details of implementations that the proposed AHA protocol also has much less computation cost than three latest AHA protocols.With the development of the wireless communication technology and the popularity of mobile devices, the mobile wireless network(MWN) has been widely used in our daily life. Through the access point(AP), users could access the Internet anytime and anywhere using their mobile devices. Therefore, MWNs can bring much convenience to us. Due to the limitation of AP's coverage, the seamless handover frequently occurs in practical applications. How to guarantee the user's privacy and security and identify the real identity when he/she brings harm to the system becomes very challenging. To achieve such goals, many anonymous handover authentication(AHA) protocols have been proposed in the last several years. However, most of them have high computation costs because mobile nodes need to carry out the bilinear pairing operations or the hash-to-point operations. Besides, most of them cannot satisfy some critical requirements, such as non-traceability and perfect forward secrecy. In this paper, we first outline the security requirements of AHA protocols, and then propose a new AHA protocol to eliminate weaknesses existing in previous AHA protocols. Based on the hardness of two famous mathematical problems, we demonstrate that the proposed AHA protocol is secure against different kinds of attacks and can meet a variety of security requirements. It can be seen from the details of implementations that the proposed AHA protocol also has much less computation cost than three latest AHA protocols.

关 键 词:mobile wireless network handover authentication ANONYMITY conditional privacy preservation provable security 

分 类 号:TN929.5[电子电信—通信与信息系统]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象