Proof of concept of a security based on lifetime of communication's pseudonyms for the VANETs

Adetundji Adigun, B. A. Bensaber, Ismaïl Biskri
{"title":"Proof of concept of a security based on lifetime of communication's pseudonyms for the VANETs","authors":"Adetundji Adigun, B. A. Bensaber, Ismaïl Biskri","doi":"10.1145/2386958.2386975","DOIUrl":null,"url":null,"abstract":"To make Vehicular Ad Hoc Network (VANET) applications useful to the users, the security problem must be solved. Recent researches have suggested the use of a set of anonymous keys certified by the issuing CA (Central authority) to preserve privacy, authentication, and confidentiality of the communicating entities. But how to determine the right time for the vehicles to exchange their communication pseudonyms and what would be the impacts on the network resources such as time processing and memory. In this paper, we propose a protocol that preserves authentication, non repudiation, and location privacy and helps vehicles to exchange their pseudonyms at roughly the same time. It is based on calculating the Euclidean distance and the average of the speed permitted on the path to evaluate the lifetime of the communication's pseudonyms. The exchange of the information is based on asymmetric and symmetric cryptography scheme and it uses hash function. The protocol permits to determine the expiration time of pseudonyms and how to make the distribution of all the road side units along the road in order to establish a good communication between them and the vehicles.","PeriodicalId":254708,"journal":{"name":"Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the second ACM international symposium on Design and analysis of intelligent vehicular networks and applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2386958.2386975","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

To make Vehicular Ad Hoc Network (VANET) applications useful to the users, the security problem must be solved. Recent researches have suggested the use of a set of anonymous keys certified by the issuing CA (Central authority) to preserve privacy, authentication, and confidentiality of the communicating entities. But how to determine the right time for the vehicles to exchange their communication pseudonyms and what would be the impacts on the network resources such as time processing and memory. In this paper, we propose a protocol that preserves authentication, non repudiation, and location privacy and helps vehicles to exchange their pseudonyms at roughly the same time. It is based on calculating the Euclidean distance and the average of the speed permitted on the path to evaluate the lifetime of the communication's pseudonyms. The exchange of the information is based on asymmetric and symmetric cryptography scheme and it uses hash function. The protocol permits to determine the expiration time of pseudonyms and how to make the distribution of all the road side units along the road in order to establish a good communication between them and the vehicles.
基于vanet的通信假名生命周期的安全概念证明
为了使车载自组织网络(VANET)应用对用户有用,必须解决安全问题。最近的研究建议使用一组由颁发CA(中央机构)认证的匿名密钥来保护通信实体的隐私、身份验证和机密性。但是,如何确定车辆交换通信假名的正确时间,以及对时间处理和内存等网络资源的影响。在本文中,我们提出了一种协议,该协议保留了身份验证、不可否认性和位置隐私,并帮助车辆在大致相同的时间交换假名。它基于计算欧几里得距离和路径上允许的平均速度来评估通信假名的寿命。信息交换基于非对称和对称密码方案,并使用哈希函数。该协议允许确定假名的到期时间,以及如何使所有路侧单位沿着道路进行分配,以便它们与车辆之间建立良好的通信。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信