面向车联网高效安全的消息认证方案

doi:10.11959/j.issn.1000-436x.2016211

摘要/Abstract

摘要：

提出一种新型高效的基于身份的消息认证方案，该方案采用椭圆曲线密码构建了轻量级的安全认证协议，无需双线性对运算，降低了签名与认证过程的运算复杂性，同时提供了条件隐私保护的功能，安全分析验证了该方案可以满足VANET的安全需求。性能分析表明，与最近的相关方案相比，该方案不仅减少了签名与验证的计算开销，同时也降低了通信开销。

关键词: 车联网, 认证方案, 椭圆曲线密码, 效率, 条件隐私保护

Abstract:

A new efficient identity-based message authentication scheme for VANET was proposed. The proposed scheme decreased the complexity of cryptographic operations on signature by using elliptic curve cryptosystem (ECC) to construct authentication protocol without bilinear pairing and provided the function of conditional privacy-preserving. Security analysis demonstrated that the proposed scheme satisfies all security and privacy requirements for VANET. Per-formance analysis show that compared with the most recent proposed schemes the proposed scheme decreases the com-putation cost and communication cost.

Key words: VANET, authentication scheme, ECC, efficiency, conditional privacy preserving

吴黎兵,谢永,张宇波. 面向车联网高效安全的消息认证方案[J]. 通信学报, 2016, 37(11): 1-10.

Li-bing WU,Yong XIE,Yu-bo ZHANG. Efficient and secure message authentication scheme for VANET[J]. Journal on Communications, 2016, 37(11): 1-10.

图/表 9

图1

图2

表1

表2

图3

表3

表4

通信开销比较"

方案	消息组成	增加的通信开销/byte
文献[14]方案	${M_{i}, I D_{i}^{1}, I D_{i}^{2}, δ_{i}}$	276
文献[4]方案	${M_{i}, A I D_{i}^{1}, A I D_{i}^{2}, T_{i}, δ_{i}}$	280
本文方案	${M_{i}, P I D_{i}, T_{i}, R_{i}, U_{i}, δ_{i}}$	124

表4

图4

图5

参考文献 25

[1]	KAKKASAGERI M S , MANVI S S . Information management in vehicular ad hoc networks: a review[J]. Journal of Network and Computer Applications, 2014,39(1):334-350.
[2]	BITAM S , MELLOUK A , ZEADALLY S . VANET-cloud: a generic cloud computing model for vehicular ad hoc networks[J]. IEEE Wireless Communications, 2015,22(1):96-102.
[3]	IEEE. IEEE standard for WAVE security services for applications and management messages[S]. IEEE. 2013:1-289.
[4]	BAYAT M , BARMSHOORY M , RAHIMI M , et al. A secure authenti-cation scheme for VANETs with batch verification[J]. Wireless Net-works, 2015,21(5):1733-1743.
[5]	CHIM T , YIU S , HUI L , et al. SPECS: secure and privacy enhancing communications schemes for VANETs[J]. Ad Hoc Networks, 2011,9(2):189-203.
[6]	HUANG J L , YEH L Y , CHIEN H Y . ABAKA: an anonymous batch authenticated and key agreement scheme for value-added services in vehicular ad hoc networks[J]. IEEE Transactions on Vehicular Tech-nology, 2011,60(1):248-262.
[7]	RAYA M , HUBAUX J P . The security of vehicular ad hoc net-works[C]// The 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks. 2005:11-21.
[8]	FREUDIGER J , RAYA M , FE′LEGYHA Z , et al. Mix-zones for loca-tion privacy in vehicular networks[C]// ACM Workshop on Wireless Networking for Intelligent Transportation Systems. 2007.
[9]	ZHANG C , LIN X , LU R , et al. RAISE: an efficient RSU-aided mes-sage authentication scheme in vehicular communication networks[C]// ICC'08, 2008:1451-1457.
[10]	LU R , LIN X , ZHU H , et al. ECPP: efficient conditional privacy preservation protocol for secure vehicular communications[J]. IEEE INFOCOM Proceedings, 2008:1229-1237.
[11]	ZHANG C , LU R , LIN X , et al. An efficient identity-based batch verification scheme for vehicular sensor networks[J]. Proceedings IEEE INFOCOM'08, 2008:246-250.
[12]	SHIM K . An efficient conditional privacy-preserving authentication scheme for vehicular sensor networks[J]. IEEE Transactions on Ve-hicular Technology, 2012,61(4):1874-1883.
[13]	LIU J K , YUEN T H , AU M H , et al. Improvements on an authentica-tion scheme for vehicular sensor networks[J]. Expert Systems with Applications, 2014,41(5):2559-2564.
[14]	LEE C C , LAI Y M . Toward a secure batch verification with group testing for VANET[J]. Wireless Networks, 2013,19(6):1441-1449.
[15]	ZHANG J , XU M , LIU L . On the security of a secure batch verifica-tion with group testing for VANET[J]. International Journal of Net-work Security, 2014,16(5):355-362.
[16]	SHIM K . An ID-based aggregate signature scheme with constant pairng computations[J]. Journal of Systems and Software, 2010,83(10):1873-1880.
[17]	李晋国，林亚平，李睿，等．车载自组织网络中基于椭圆曲线零知识证明的匿名安全认证机制[J]. 通信学报, 2013,34(5):52-61. LI J G , LIN Y P , LI R , et al. Secure anonymous authentication scheme based on elliptic curve and zero-knowledge proof in VANET[J]. Jour-nal on Communications, 2013,34(5):52-61.
[18]	HORNG S J , TZENG S F , PAN Y , et al. B-SPECS+: batch verifica-tion for secure pseudonymous authentication iv VANET[J]. IEEE Transactions on Information Forensics and Security, 2013,8(11):1860-1875.
[19]	MILLER V S . Use of elliptic curves in cryptography[C]// CRYPTO'85 Proceedings. 1985:417-426.
[20]	SCHNORR C P . Efficient identification and signatures for smart cards[M]// Advances in Cryptology — EUROCRYPT '89. Springer Berlin Heidelberg. 1989:688-689.
[21]	KOBLITZ N . Elliptic curve cryptosystem[J]. Journal of Mathematics of Computation, 1987,48(1):203-209.
[22]	YUAN Y , LI D , TIAN L , et al. Certificateless signature scheme with-out random oracles[C]// Information Security and Assurance. Springer Berlin Heidelberg, 2009:31-40.
[23]	POINTCHEVAL D , STERN J . Security proofs for signature schemes[C]// EUROCRYPT'96. 1996:387-398.
[24]	MIRACL library on Certivox.com[EB/OL]. .
[25]	谢永，吴黎兵，何炎祥，等．无间隙的车联网协助下载方法[J]. 通信学报, 2016,37(1):180-190. XIE Y , WU L B , HE Y X , et al. Non-intermittent cooperative downloading approach for VANET[J]. Journal on Communications, 2016,37(1):180-190.

性能	文献[14]方案	文献[4]方案	本文方案
可认证性	√	√	√
匿名性	√	√	√
条件追踪	×	√	√
抗伪造攻击	√	√	√
抗篡改攻击	√	√	√
抗重放攻击	×	√	√
说明：√表示满足要求，×表示不满足要求。

	运算操作名称	缩写	执行时间/ms
	双线性对运算， e(P, Q)	T _b	6.416 4
	标量乘法运算， x·P	T _bm	2.643 9
双线性对
	小因子乘法运算， λ_i·P	T _bsm	0.826 6
	加法运算， P+Q	T _ba	0.014 6
	标量乘法运算， x·P	T _em	0.735 8
椭圆曲线	小因子乘法运算， λ_iP	T_esm	0.042 8
	加法运算，S+T	T _ea	0.004 0
	MapToPoint散列函数运算	T _H	1.327 7
	单向散列函数运算	T _h	0.000 2

方案	签名过程	单一认证	批量认证
文献[14]方案	T _bm+1 T_ba+2 T_H+1 T_h≈13.245 ms	3 T_b+1 T_bm+1 T_H+1 T_h≈23.220 ms	3 T_b+n T_bm+3(n?1)T_ba+n T_H+n T_h≈ (4.015n+19.205) ms
文献[4]方案	5 T_bm+1 T_ba+1 T_H+2 T_h≈14.562 ms	3 T_b+1 T_bm+1 T_H+1 T_h≈23.220 ms	3 T_b+n T_bsm+3(n?1)T_ba+n T_H+n T_h≈ (2.198n+19.205) ms
本文方案	3 T_em+4 T_h≈2.262 ms	3 T_em+3 T_ea+3 T_h≈ 2.274 ms	(n+3)T_em +n T_esm+(2n+1)T_ea+3n T_h≈ (0.805n+2.265) ms