Authentication and consensus overhead in vehicular ad hoc networks

Petit, Johann; Mammeri, Zoubir

doi:10.1007/s11235-011-9589-y

Cited by 30 publications

(18 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We derive closed-form expressions to calculate the probability of agreement on a value, P AG , for the pessimistic decision criterion with analysing the two cases, Case I' and Case II'. Combining the expressions for calculating the probability of agreement on a value among processes when they meet the conditions for Case I' and Case II', the probability of agreement on a value among the 4 Initially, the view of all the nodes are incomplete, i.e., formally, the view of a node at the end of (r − 1) th round is incomplete whenever r = 1. processes is computed from Eq. 8.…”

Section: Propositionmentioning

confidence: 99%

“…Examples of the application of such protocols are in the area of cooperative systems including autonomous and semi-autonomous cooperative systems for improving traffic safety and fuel-efficiency of road vehicles, such as vehicle platooning, virtual traffic lights 1 and coordinated lane change [3]. In [4], consensus is used to enforce the security of safety critical applications and to avoid false warning injection attacks in road vehicles. Another set of similar applications are related to the coordination of unmanned aerial vehicles (UAVs), such as the use of consensus to provide reconfigurable control to UAVs in a flight formation [5], or adjust UAVs' trajectories in the presence of collision avoiding manoeuvres that cannot be foreseen [6].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Probabilistic Analysis of Disagreement in Synchronous Consensus Protocols

Fathollahnejad

Villani

Pathan

et al. 2014

2014 Tenth European Dependable Computing Conference

View full text Add to dashboard Cite

This paper presents a probabilistic analysis of disagreement for a family of simple synchronous consensus algorithms aimed at solving the 1-of-n selection problem in presence of unrestricted communication failures. In this problem, a set of n nodes are to select one common value among n proposed values. There are two possible outcomes of each node's selection process: decide to select a value or abort. We have disagreement if some nodes select the same value while other nodes decide to abort. Previous research has shown that it is impossible to guarantee agreement among the nodes subjected to an unbounded number of message losses. Our aim is to find decision algorithms for which the probability of disagreement is as low as possible. In this paper, we investigate two different decision criteria, one optimistic and one pessimistic. We assume two communication failure models, symmetric and asymmetric. For symmetric communication failures, we present the closed-form expressions for the probability of disagreement. For asymmetric failures, we analyse the algorithm using a probabilistic model checking tool. Our results show that the choice of decision criterion significantly influences the probability of disagreement for the 1-of-n selection algorithm. The optimistic decision criterion shows a lower probability of disagreement compare to the pessimistic one when the probability of message loss is less than 30% to 70%. On the other hand, the optimistic decision criterion has in general a higher maximum probability of disagreement compared to the pessimistic criterion.

show abstract

Section: Propositionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On Probabilistic Analysis of Disagreement in Synchronous Consensus Protocols

Fathollahnejad

Villani

Pathan

et al. 2014

2014 Tenth European Dependable Computing Conference

View full text Add to dashboard Cite

show abstract

“…In VANETs with traffic congestion, vehicles may receive thousands of BSMs from neighboring vehicles which make it impossible for vehicles to verify all messages [5,[10][11][12][13][14][15]. is is because the verification process for a message involves a timeconsuming cryptographic operation; for example, it could take at least 4.97 ms on average [16,17]. Due to the high density traffic, the BSM receiving rate is usually higher than the BSM verification rate.…”

Section: Introductionmentioning

confidence: 99%

Safety Message Verification Using History-Based Relative-Time Zone Priority Scheme

Banani

Thiemjarus

Gordon

2019

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

Safety message verification plays an important role in securing vehicular ad hoc networks (VANETs). As safety messages are broadcasted several times per second in a highly dense network, message arrival rate can easily exceed the verification rate of safety messages at a vehicle. As a result, an algorithm is needed for selecting and prioritizing relevant messages from received messages to increase the awareness of vehicles in the vicinity. This paper presents the history-based relative-time zone (HRTZ) priority scheme for selecting and verifying relevant received safety messages. HRTZ is an enhanced version of our previously proposed relative-time zone (RTZ) priority scheme. HRTZ achieves higher awareness of nearby vehicles and works in different road configurations. To increase awareness of neighboring vehicles, the average velocity of neighboring vehicles in the range of communication is used to determine the range of the danger zone and other zones. The messages are ranked based on the zone of transmitting vehicles, road configuration (with/without a barrier) and transmitting vehicle location and direction, and relative time between transmitting and receiving vehicles. Only the most up-to-date message from each vehicle is kept in the receiver’s buffer. As a result, each neighboring vehicle has only the most recent safety message in the buffer at any time. The simulation results show that HRTZ achieves a higher rate of verified messages with low delay for nearby vehicles and achieves higher awareness for vehicles in the vicinity, when compared to RTZ and other existing schemes.

show abstract

“…They claimed that their scheme is quite secure and practical for TMIS. Recently, an efficient group key management protocol [19] and an authentication and consensus overhead in vehicular ad hoc networks [20] have been proposed.…”

Section: Introductionmentioning

confidence: 99%

Security Issues of Chen et al.'s Dynamic ID-Based Authentication Scheme

Khan

Kumari

Wang

et al. 2014

2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing

View full text Add to dashboard Cite

Chen et al. proposed in 2012, a dynamic ID-based authentication scheme for Telecare Medical Information Systems. Chen et al. preferred simpler computations unlike previous schemes proposed for TMIS, so they designed a computational complexity-free protocol. But it entails many security concerns. Here we show that an adversary can cheat the lawful participants of the scheme, can compute the agreed upon session-key; which renders the communication between the participants as un-confidential. We further illustrate that in-spite of using dynamic identity during login phase their scheme does not provide user anonymity. We also demonstrate that their design invites password guessing attack, stolen verifier attack and has an incomplete password change phase.

show abstract

Authentication and consensus overhead in vehicular ad hoc networks

Cited by 30 publications

References 19 publications

On Probabilistic Analysis of Disagreement in Synchronous Consensus Protocols

On Probabilistic Analysis of Disagreement in Synchronous Consensus Protocols

Safety Message Verification Using History-Based Relative-Time Zone Priority Scheme

Security Issues of Chen et al.'s Dynamic ID-Based Authentication Scheme

Contact Info

Product

Resources

About