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

Chao Chen, Sang Woo Lee, Tim Watson, Carsten Maple, Yi Lu

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.
BibTeX
@inproceedings{chen2017caesar,
  author = {Chao Chen and Sang Woo Lee and Tim Watson and Carsten Maple and Yi Lu},
  title = {{CAESAR: A criticality-aware ECDSA signature verification scheme with Markov model}},
  booktitle = {VNC},
  year = {2017},
  doi = {10.1109/vnc.2017.8275638},
}

Loading related content...

Figure