CAESAR: A criticality-aware ECDSA signature verification scheme with Markov model

Chao Chen, Sang Woo Lee, T. Watson, C. Maple, Yi Lu
{"title":"CAESAR: A criticality-aware ECDSA signature verification scheme with Markov model","authors":"Chao Chen, Sang Woo Lee, T. Watson, C. Maple, Yi Lu","doi":"10.1109/VNC.2017.8275638","DOIUrl":null,"url":null,"abstract":"Intelligent transport systems (ITS) facilitate road traffic by periodically exchanging messages with neighbouring vehicles, road side units (RSUs) and ITS stations. For security reasons these messages will be encapsulated with security credentials to form secured messages (SMs) and will be inoperative until the authentication completes. This creates a challenge in a dynamic and dense road network where many SMs are awaiting authentication. To address this problem, we propose CAESAR, a criticality-aware Elliptic Curve Digital Signature Algorithm (ECDSA) signature verification scheme that utilizes multi-level priority queues (MLPQs) and Markov model to dispatch and schedule SMs. Simulation results verify the accuracy of CAESAR and the enhancements in terms of several safety awareness metrics compared with the existing schemes.","PeriodicalId":101592,"journal":{"name":"2017 IEEE Vehicular Networking Conference (VNC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Vehicular Networking Conference (VNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VNC.2017.8275638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Intelligent transport systems (ITS) facilitate road traffic by periodically exchanging messages with neighbouring vehicles, road side units (RSUs) and ITS stations. For security reasons these messages will be encapsulated with security credentials to form secured messages (SMs) and will be inoperative until the authentication completes. This creates a challenge in a dynamic and dense road network where many SMs are awaiting authentication. To address this problem, we propose CAESAR, a criticality-aware Elliptic Curve Digital Signature Algorithm (ECDSA) signature verification scheme that utilizes multi-level priority queues (MLPQs) and Markov model to dispatch and schedule SMs. Simulation results verify the accuracy of CAESAR and the enhancements in terms of several safety awareness metrics compared with the existing schemes.
CAESAR:一个基于马尔可夫模型的临界感知ECDSA签名验证方案
智能交通系统通过定期与邻近车辆、路旁车辆和智能交通系统站交换信息,促进道路交通。出于安全原因,这些消息将与安全凭据封装在一起,形成安全消息(SMs),并且在身份验证完成之前将不起作用。这在动态和密集的道路网络中造成了挑战,因为许多SMs正在等待身份验证。为了解决这个问题,我们提出了一种临界感知的椭圆曲线数字签名算法(ECDSA)签名验证方案CAESAR,该方案利用多级优先级队列(MLPQs)和马尔可夫模型来调度SMs。仿真结果验证了该方案的准确性,并在多个安全意识指标方面与现有方案进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信