本文選題：雙線性對(duì) + 匿名認(rèn)證　； 參考：《通信學(xué)報(bào)》2017年06期

【摘要】：為解決當(dāng)前車聯(lián)網(wǎng)中匿名認(rèn)證的效率問(wèn)題,利用橢圓曲線上的雙線性對(duì)的性質(zhì),提出一種批量匿名認(rèn)證方案。通過(guò)路側(cè)單元節(jié)點(diǎn)(RSU)與車輛共同生成簽名,有效減輕了VANET認(rèn)證中心的負(fù)擔(dān)進(jìn)而提高認(rèn)證效率,并且增加了攻擊者提取密鑰的難度,并在隨機(jī)預(yù)言模型中給出其安全性證明。分析表明,該方案能夠滿足多種安全需求,計(jì)算開(kāi)銷明顯降低,認(rèn)證效率得到有效提高。因此,該方案在計(jì)算性能受限的物聯(lián)網(wǎng)(Io T,Internet of things)環(huán)境中,有著重要的理論意義與應(yīng)用價(jià)值。
[Abstract]:In order to solve the efficiency problem of anonymous authentication in vehicle networking, a batch anonymous authentication scheme is proposed by using the properties of bilinear pairs on elliptic curves. The signature is generated by the road side unit node (RSUU) and the vehicle, which can effectively reduce the burden of VANET authentication center and improve the authentication efficiency. It also makes it more difficult for the attacker to extract the key, and the security proof is given in the random prophecy model. The analysis shows that the proposed scheme can meet various security requirements, reduce computing overhead and improve the efficiency of authentication. Therefore, this scheme has important theoretical significance and application value in the Internet of things (IOT) environment with limited computing performance.
【作者單位】： 河南理工大學(xué)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(No.61300124,No.61300216) 河南省科技攻關(guān)計(jì)劃基金資助項(xiàng)目(No.132102210123)~~
【分類號(hào)】：TP309;U495

【相似文獻(xiàn)】

相關(guān)碩士學(xué)位論文 前1條

1 黎水凡;面向VANET的條件匿名認(rèn)證方案研究[D];湖南科技大學(xué);2016年

，

本文編號(hào)：2005451