当前位置:主页 > 科技论文 > 软件论文 >

基于双线性对的车联网批量匿名认证方案研究

发布时间:2018-06-11 13:36

  本文选题:双线性对 + 匿名认证 ; 参考:《通信学报》2017年06期


【摘要】:为解决当前车联网中匿名认证的效率问题,利用椭圆曲线上的双线性对的性质,提出一种批量匿名认证方案。通过路侧单元节点(RSU)与车辆共同生成签名,有效减轻了VANET认证中心的负担进而提高认证效率,并且增加了攻击者提取密钥的难度,并在随机预言模型中给出其安全性证明。分析表明,该方案能够满足多种安全需求,计算开销明显降低,认证效率得到有效提高。因此,该方案在计算性能受限的物联网(Io T,Internet of things)环境中,有着重要的理论意义与应用价值。
[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.
【作者单位】: 河南理工大学计算机科学与技术学院;
【基金】:国家自然科学基金资助项目(No.61300124,No.61300216) 河南省科技攻关计划基金资助项目(No.132102210123)~~
【分类号】:TP309;U495

【相似文献】

相关硕士学位论文 前1条

1 黎水凡;面向VANET的条件匿名认证方案研究[D];湖南科技大学;2016年



本文编号:2005451

资料下载
论文发表

本文链接:https://www.wllwen.com/kejilunwen/ruanjiangongchenglunwen/2005451.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户ff935***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com