变更协议VANETs的化名

Adetundji Adigun, B. A. Bensaber, Ismaïl Biskri
{"title":"变更协议VANETs的化名","authors":"Adetundji Adigun, B. A. Bensaber, Ismaïl Biskri","doi":"10.1109/LCNW.2013.6758514","DOIUrl":null,"url":null,"abstract":"We propose in this paper a security protocol based on periodic change of pseudonyms. The idea is to avoid illegal traceability of vehicles during their communications and preserve their privacy and confidential information. Two different approaches are proposed. In the first approach, each vehicle asks the central authority a new communication pseudonym after a time t. While in the second approach, each vehicle generates itself after a time t, a new communication pseudonym. Our objective is to permit at least two vehicles to change their pseudonym in the same time interval. We evaluate in this work, the bandwidth used by considering the vehicles speed in each approach. The proposed protocol is based on equidistant distribution of the road side unit and uses the average of speed permitted on the road to evaluate lifetime t of the communication's pseudonyms and certificates. The exchange of information is based on asymmetric and symmetric cryptography scheme and it uses hash function. Our protocol provides authentication, non-repudiation and privacy.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"353 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Protocol of change pseudonyms for VANETs\",\"authors\":\"Adetundji Adigun, B. A. Bensaber, Ismaïl Biskri\",\"doi\":\"10.1109/LCNW.2013.6758514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose in this paper a security protocol based on periodic change of pseudonyms. The idea is to avoid illegal traceability of vehicles during their communications and preserve their privacy and confidential information. Two different approaches are proposed. In the first approach, each vehicle asks the central authority a new communication pseudonym after a time t. While in the second approach, each vehicle generates itself after a time t, a new communication pseudonym. Our objective is to permit at least two vehicles to change their pseudonym in the same time interval. We evaluate in this work, the bandwidth used by considering the vehicles speed in each approach. The proposed protocol is based on equidistant distribution of the road side unit and uses the average of speed permitted on the road to evaluate lifetime t of the communication's pseudonyms and certificates. The exchange of information is based on asymmetric and symmetric cryptography scheme and it uses hash function. Our protocol provides authentication, non-repudiation and privacy.\",\"PeriodicalId\":290924,\"journal\":{\"name\":\"38th Annual IEEE Conference on Local Computer Networks - Workshops\",\"volume\":\"353 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"38th Annual IEEE Conference on Local Computer Networks - Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCNW.2013.6758514\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"38th Annual IEEE Conference on Local Computer Networks - Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCNW.2013.6758514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

本文提出了一种基于假名周期性变化的安全协议。这个想法是为了避免车辆在通信过程中被非法追踪,并保护他们的隐私和机密信息。提出了两种不同的方法。在第一种方法中,每辆车在时间t之后向中央机构请求一个新的通信假名。而在第二种方法中,每辆车在时间t之后生成一个新的通信假名。我们的目标是允许至少两个车辆在同一时间间隔内更改其假名。在这项工作中,我们通过考虑车辆的速度来评估每种方法所使用的带宽。该协议基于道路侧单元的等距分布,并使用道路上允许的平均速度来评估通信的假名和证书的寿命t。信息交换基于非对称和对称密码方案,并使用哈希函数。我们的协议提供身份验证、不可否认性和隐私性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Protocol of change pseudonyms for VANETs
We propose in this paper a security protocol based on periodic change of pseudonyms. The idea is to avoid illegal traceability of vehicles during their communications and preserve their privacy and confidential information. Two different approaches are proposed. In the first approach, each vehicle asks the central authority a new communication pseudonym after a time t. While in the second approach, each vehicle generates itself after a time t, a new communication pseudonym. Our objective is to permit at least two vehicles to change their pseudonym in the same time interval. We evaluate in this work, the bandwidth used by considering the vehicles speed in each approach. The proposed protocol is based on equidistant distribution of the road side unit and uses the average of speed permitted on the road to evaluate lifetime t of the communication's pseudonyms and certificates. The exchange of information is based on asymmetric and symmetric cryptography scheme and it uses hash function. Our protocol provides authentication, non-repudiation and privacy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信