Answers are grounded in this paper and cite their sources.
Securing vehicle-to-everything communication requires cryptography light enough for real-time beaconing, and the vehicular networking literature has largely settled on elliptic-curve signatures as the lightweight choice over RSA. We show that this preference inverts under realistic operating conditions. Because a safety beacon is signed once but verified by every vehicle within radio range, verification rather than signing dominates the per-beacon cost, and RSA-2048 verifies twice as fast as ECDSA-P256 while signing an order of magnitude more slowly. The two cost functions therefore cross at a specific neighbour count. We develop ALACRITY, a lightweight protocol combining authenticated encryption, per-vehicle digital signatures, epoch-based group-key rotation and replay protection, and evaluate it across 225 independent simulation runs on a real urban road network. The crossover is observed between 7.2 and 15.3 in-range neighbours, consistent with a fitted value of 8.5. Traffic density in this region proves bistable: across 35 runs at the transition, none settled inside the crossover band; the network is either free-flowing or congested. Selecting the signature scheme from each vehicle’s local neighbour count reduces per-beacon cost by up to 19.5% where the two regimes coexist, a gain confirmed by direct multi-receiver measurement and robust to neighbour-count estimation error over a short window.
No takes yet. Share an insight, caveat, or question.
Ankarboina et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: