一種可證安全的車聯(lián)網(wǎng)無(wú)證書聚合簽名改進(jìn)方案
doi: 10.11999/JEIT190184
-
1.
青海大學(xué)計(jì)算機(jī)技術(shù)與應(yīng)用系 西寧 810016
-
2.
武漢大學(xué)計(jì)算機(jī)學(xué)院 武漢 430072
An Improved Provable Secure Certificateless Aggregation Signature Scheme for Vehicular Ad Hoc NETworks
-
1.
Department of Computer Technology and Application, Qinghai University, Xining 810016, China
-
2.
Computer School, Wuhan University, Wuhan 430072, China
-
摘要:
車聯(lián)網(wǎng)(VANETs)是組織車－X(X：車、路、行人及互聯(lián)網(wǎng)等)之間的無(wú)線通信和信息交換的大型網(wǎng)絡(luò)，是智慧城市重要組成部分。其消息認(rèn)證算法的安全與效率對(duì)車聯(lián)網(wǎng)至關(guān)重要。該文分析王大星等人的VANETs消息認(rèn)證方案的安全不足，并提出一種改進(jìn)的可證安全的無(wú)證書聚合簽名方案。該文方案利用橢圓曲線密碼構(gòu)建了一個(gè)改進(jìn)的安全無(wú)證書聚合認(rèn)證方案。該方案降低了密碼運(yùn)算過(guò)程中的復(fù)雜性，同時(shí)實(shí)現(xiàn)條件隱私保護(hù)功能。嚴(yán)格安全分析證明該文方案滿足VANETs的安全需求。性能分析表明該文方案相比王大星等人方案，較大幅度地降低了消息簽名、單一驗(yàn)證以及聚合驗(yàn)證算法的計(jì)算開(kāi)銷，同時(shí)也減少了通信開(kāi)銷。
-
關(guān)鍵詞:
- 車聯(lián)網(wǎng) /
- 聚合簽名 /
- 無(wú)證書體制 /
- 橢圓曲線密碼 /
- 條件隱私保護(hù)
Abstract:Vehicular Ad hoc NETworks (VANETs) which is an important part of smart cities are large networks that organize wireless communication and information exchange between vehicles and X (X: cars, roads, pedestrians, and the Internet). The security and efficiency of the message authentication algorithm are crucial to the VANETs. After analyzing the security shortage of Wang Daxing et al VANETs message authentication scheme, an improved provable secure certificateless aggregation signature scheme for VANETs is proposed. The scheme constructs a secure certificateless aggregation authentication scheme by using Elliptic Curve Cryptography (ECC) and reduces the complexity of the cryptographic operation process, while achieving user’s conditional privacy protection. Rigid security analysis proves that the scheme satisfies the security requirements of VANETs. The performance analysis shows the proposed scheme considerably reduces the computational cost of message signature, single verification and aggregation verification algorithm, and reduces the communication cost when compared with Wang schemes.
-
表 1 密碼運(yùn)算的執(zhí)行時(shí)間(
${\rm{ms}} $ )運(yùn)算操作名稱 縮寫 執(zhí)行時(shí)間 雙線性對(duì) 雙線性對(duì)運(yùn)算，$e$ ${T_{\rmq7j3ldu95} }$ 6.4164 乘法運(yùn)算，$x \cdot P$ ${T_{\rm{dm}}}$ 2.6439 加法運(yùn)算，$P + Q$ ${T_{\rm{da}} }$ 0.0146 橢圓曲線 乘法運(yùn)算，$x \cdot Q$ ${T_{\rm{em}}}$ 0.7358 加法運(yùn)算，$P + Q$ ${T_{\rm{ea}}}$ 0.0040 單向Hash運(yùn)算 ${T_{\rm{h}} }$ 0.0002 
下載: 導(dǎo)出CSV
表 2 計(jì)算開(kāi)銷比較(ms)
簽名算法 驗(yàn)證算法 聚合驗(yàn)證算法 Wang方案 $ 4{T_{\rm{dm}} } +2{T_{\rm{da}}} + {T_{\rm{h}}} \approx 10.605 $ $3{T_{\rmq7j3ldu95}} + 3{T_{\rm{dm}}} + {T_{\rm{da}}} + 2{T_{\rm{h}}} \approx 27.1959 $ $ 3{T_{\rmq7j3ldu95}} + 3n{T_{\rm{dm}}} + \left( {3n - 2} \right){T_{\rm{da}}} + 2n{T_{\rm{h}}} \approx 7.9759n + 19.22$ Zhong方案 $ 4{T_{\rm{dm}} } + 2{T_{\rm{da}}} + 2{T_{\rm{h}}} \approx 10.6052 $ $ 3{T_{\rmq7j3ldu95}} + 2{T_{\rm{dm}}} + {T_{\rm{da}}} + 2{T_{\rm{h}}} \approx 24.5376$ $ 3{T_{\rmq7j3ldu95}} + 2n{T_{\rm{dm}}} + \left( {2n - 1} \right){T_{\rm{da}}} + 2n{T_{\rm{h}}} \approx 5.3174n + 19.2346$ 本文方案 $ {T_{\rm{em}}} + 2{T_{\rm{h}}} \approx 0.7362 $ $ 4{T_{\rm{em}}} + 3{T_{\rm{ea}}} + 3{T_{\rm{h}}} \approx 2.9558 $ $\left( {2n + 2} \right){T_{\rm{em}}} + 3n{T_{\rm{ea}}} + 3n{T_{\rm{h}}} \approx 1.4842n + 1.4716 $
下載: 導(dǎo)出CSV
表 3 通信開(kāi)銷比較
方案 消息 通信開(kāi)銷(Byte) Wang方案 $\begin{array}{l} \left\{ {m_i},{\delta _i} = ({U_i},{V_i}),\right.\\ \left.{P_i},{F_i} = (F{1_i},F{2_i})\right\} \end{array}$ 576 Zhong方案 $\left\{ \begin{array}{l}{m_i},{{\mathop{\rm PID}\nolimits} _i},{{\mathop{\rm vpk}\nolimits} _i},\\{t_i},{\sigma _i} = \left( {{R_i},{T_i}} \right)\end{array} \right\}$ 724 本文方案 $\begin{array}{l}\{ {m_i},{\delta _i} = ({U_i},{v_i}),\\{P_i},{F_i} = ({{\rm ID}} _i^*,{T_i})\} \end{array}$ 140
下載: 導(dǎo)出CSV
-
劉哲, 劉建偉, 伍前紅, 等. 車載網(wǎng)絡(luò)中安全有效分布式的假名生成[J]. 通信學(xué)報(bào), 2015, 36(11): 33–40. doi: 10.11959/j.issn.1000-436x.2015253LIU Zhe, LIU Jianwei, WU Qianhong, et al. Secure and efficient distributed pseudonym generation in VANET[J]. Journal on Communications, 2015, 36(11): 33–40. doi: 10.11959/j.issn.1000-436x.2015253 ZHANG Hui. Insecurity of a certificateless aggregate signature scheme[J]. Security and Communication Networks, 2016, 9(11): 1547–1552. doi: 10.1002/sec.1447 HA J. An efficient and robust anonymous authentication scheme in global mobility networks[J]. International Journal of Security and Its Applications, 2015, 9(10): 297–312. doi: 10.14257/ijsia.2015.9.10.27 SHEN Limin, MA Jianfeng, LIU Ximeng, et al. A provably secure aggregate signature scheme for healthcare wireless sensor networks[J]. Journal of Medical Systems, 2016, 40(11): No. 244. doi: 10.1007/s10916-016-0613-3 IWASAKI T, YANAI N, INAMURA M, et al. Tightly-secure identity-based structured aggregate signature scheme under the computational Diffie-Hellman assumption[C]. The 30th IEEE International Conference on Advanced Information Networking and Applications, Crans-Montana, Australia, 2016: 669–676. doi: 10.1109/AINA.2016.99. HORNG S J, TZENG S F, HUANG P H, et al. An efficient certificateless aggregate signature with conditional privacy-preserving for vehicular sensor networks[J]. Information Sciences, 2015, 317: 48–66. doi: 10.1016/j.ins.2015.04.033 宋成, 張明月, 彭維平, 等. 基于非線性對(duì)的車聯(lián)網(wǎng)無(wú)證書批量匿名認(rèn)證方案研究[J]. 通信學(xué)報(bào), 2017, 38(11): 35–43. doi: 10.11959/j.issn.1000-436x.2017227SONG Cheng, ZHANG Mingyue, PENG Weiping, et al. Research on pairing-free certificateless batch anonymous authentication scheme for VANET[J]. Journal on Communications, 2017, 38(11): 35–43. doi: 10.11959/j.issn.1000-436x.2017227 王大星, 滕濟(jì)凱. 車載網(wǎng)中可證安全的無(wú)證書聚合簽名算法[J]. 電子與信息學(xué)報(bào), 2018, 40(1): 11–17. doi: 10.11999/JEIT170340WANG Daxing and TENG Jikai. Probably secure cetificateless aggregate signature algorithm for vehicular ad hoc network[J]. Journal of Electronics &Information Technology, 2018, 40(1): 11–17. doi: 10.11999/JEIT170340 BAYAT M, BARMSHOORY M, RAHIMI M, et al. A secure authentication scheme for VANETs with batch verification[J]. Wireless Networks, 2014, 21(5): 1733–1743. doi: 10.1007/s11276-014-0881-0 CHEN L, CHENG Z, and SMART N P. Identity-based key agreement protocols from pairings[J]. International Journal of Information Security, 2007, 6(4): 213–241. doi: 10.1007/s10207-006-0011-9 ZHANG Chenxi, LU Rongxing, LIN Xiaodong, et al. An efficient identity-based batch verification scheme for vehicular sensor networks[C]. The 27th IEEE Conference on Computer Communications, Phoenix, USA, 2008: 246–250. doi: 10.1109/INFOCOM.2008.58. SHIM K A. CPAS: An efficient conditional privacy-preserving authentication scheme for vehicular sensor networks[J]. IEEE Transactions on Vehicular Technology, 2012, 61(4): 1874–1883. doi: 10.1109/TVT.2012.2186992 LEE C C and LAI Yanming. Toward a secure batch verification with group testing for VANET[J]. Wireless Networks, 2013, 19(6): 1441–1449. doi: 10.1007/s11276-013-0543-7 CHIM T W, YIU S M, HUI L C K, et al. SPECS: Secure and privacy enhancing communications schemes for VANETs[J]. Ad Hoc Networks, 2011, 9(2): 189–203. doi: 10.1016/j.adhoc.2010.05.005 吳黎兵, 謝永, 張宇波, 等. 面向車聯(lián)網(wǎng)高效安全的消息認(rèn)證方案[J]. 通信學(xué)報(bào), 2016, 37(11): 1–10. doi: 10.11959/j.issn.1000-436x.2016211WU Libing, XIE Yong, ZHANG Yubo, et al. Efficient and secure message authentication scheme for VANET[J]. Journal on Communications, 2016, 37(11): 1–10. doi: 10.11959/j.issn.1000-436x.2016211 LU Rongxing, LIN Xiaodong, ZHU Haojin, et al. ECPP: Efficient conditional privacy preservation protocol for secure vehicular communications[C]. The 27th Conference on Computer Communications, Phoenix, USA, 2008: 1229–1237. doi: 10.1109/INFOCOM.2008.179. ZHONG Hong, HAN Shunshun, CUI Jie, et al. Privacy-preserving authentication scheme with full aggregation in VANET[J]. Information Sciences, 2019, 476: 211–221. doi: 10.1016/j.ins.2018.10.021 JIA Xiaoying, HE Debiao, LIU Qin, et al. An efficient provably-secure certificateless signature scheme for internet-of-things deployment[J]. Ad Hoc Networks, 2018, 71: 78–87. doi: 10.1016/j.adhoc.2018.01.001 POINTCHEVAL D and STERN J. Security proofs for signature schemes[C]. International Conference on the Theory and Applications of Cryptographic Techniques, Saragossa, Spain, 1996: 387–398. -
計(jì)量
- 文章訪問(wèn)數(shù): 3834
- HTML全文瀏覽量: 1191
- PDF下載量: 172
- 被引次數(shù): 0
下載:
