A mutual trust scheme for vehicular Ad-Hoc networks under sparse RSUs environment

W. Hsieh
{"title":"A mutual trust scheme for vehicular Ad-Hoc networks under sparse RSUs environment","authors":"W. Hsieh","doi":"10.1109/UMEDIA.2017.8074078","DOIUrl":null,"url":null,"abstract":"In this paper, based on the concept of chameleon hash function, we propose a secure mutual trust scheme for vehicular ad-hoc networks (VANETs). In the proposed scheme, the trusted authorizer (TA), holding two common secrets, will issue an identity to every entity that may be road side unit (RSU) or vehicle. An identity contains a public ID and a private key. The public ID is used to present an entity, and the private key is used to make mutual trust keys with other entity's public ID. A public ID can be verified to be a legal one, and the mutual trust key will be the evidence that a node owns the related public ID. At the starting time of a time slot or after finding malicious entities, TA will broadcast a new group key to all valid RSUs that will response the group key request from vehicles. Using the new group key, vehicles can change new parameters, public ID and private key to do mutual trust with other vehicles. The security analysis shows that the proposed scheme can revoke the right of malicious RSUs or vehicles, work well under malicious attacking and satisfy the requirement of a secure VANETs. As the result of functionality and performance comparison, the proposed mutual trust scheme is superior to the related works.","PeriodicalId":440018,"journal":{"name":"2017 10th International Conference on Ubi-media Computing and Workshops (Ubi-Media)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 10th International Conference on Ubi-media Computing and Workshops (Ubi-Media)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UMEDIA.2017.8074078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, based on the concept of chameleon hash function, we propose a secure mutual trust scheme for vehicular ad-hoc networks (VANETs). In the proposed scheme, the trusted authorizer (TA), holding two common secrets, will issue an identity to every entity that may be road side unit (RSU) or vehicle. An identity contains a public ID and a private key. The public ID is used to present an entity, and the private key is used to make mutual trust keys with other entity's public ID. A public ID can be verified to be a legal one, and the mutual trust key will be the evidence that a node owns the related public ID. At the starting time of a time slot or after finding malicious entities, TA will broadcast a new group key to all valid RSUs that will response the group key request from vehicles. Using the new group key, vehicles can change new parameters, public ID and private key to do mutual trust with other vehicles. The security analysis shows that the proposed scheme can revoke the right of malicious RSUs or vehicles, work well under malicious attacking and satisfy the requirement of a secure VANETs. As the result of functionality and performance comparison, the proposed mutual trust scheme is superior to the related works.
稀疏rsu环境下车载Ad-Hoc网络的相互信任方案
本文基于变色龙哈希函数的概念,提出了一种安全的车载自组织网络(vanet)相互信任方案。在该方案中,拥有两个共同秘密的可信授权者(TA)将向每个实体(可能是路侧单元(RSU)或车辆)颁发身份。标识包含一个公共ID和一个私钥。公共ID用于表示实体,私钥用于与其他实体的公共ID生成相互信任密钥。公共ID可以被验证为合法ID,而相互信任密钥将成为节点拥有相关公共ID的证据。在时间段的开始时间或发现恶意实体后,TA将向所有有效的rsu广播一个新的组密钥,这些rsu将响应来自车辆的组密钥请求。使用新的组密钥,车辆可以更改新的参数、公共ID和私钥,以实现与其他车辆的相互信任。安全性分析表明,该方案可以撤销恶意rsu或车辆的权限,能够很好地应对恶意攻击,满足安全车辆网络的要求。通过功能和性能的比较,本文所提出的相互信任方案优于现有的相关工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信