[Paper Review] A Topological Approach to Secure Message Dissemination in Vehicular Networks

Jieqiong Chen, Guoqiang Mao+2 more|arXiv (Cornell University)|Mar 22, 2018

Vehicular Ad Hoc Networks (VANETs)31 references3 citations

TL;DR

This paper proposes a topology-aware decision framework for secure message dissemination in vehicular networks, using network structure to detect and mitigate tampering by insider malicious vehicles. The optimal algorithm leverages prior knowledge of malicious vehicle ratio to maximize correct decision probability, while a heuristic variant operates without this knowledge, both significantly outperforming topology-agnostic methods by improving message integrity and resilience to collusion attacks.

ABSTRACT

Secure message dissemination is an important issue in vehicular networks, especially considering the vulnerability of vehicle to vehicle message dissemination to malicious attacks. Traditional security mechanisms, largely based on message encryption and key management, can only guarantee secure message exchanges between known source and destination pairs. In vehicular networks however, every vehicle may learn its surrounding environment and contributes as a source, while in the meantime act as a destination or a relay of information from other vehicles, message exchanges often occur between "stranger" vehicles. For secure message dissemination in vehicular networks against insider attackers, who may tamper the content of the disseminated messages, ensuring the consistency and integrity of the transmitted messages becomes a major concern that traditional message encryption and key management based approaches fall short to provide. In this paper, by incorporating the underlying network topology information, we propose an optimal decision algorithm that is able to maximize the chance of making a correct decision on the message content, assuming the prior knowledge of the percentage of malicious vehicles in the network. Furthermore, a novel heuristic decision algorithm is proposed that can make decisions without the aforementioned knowledge of the percentage of malicious vehicles. Simulations are conducted to compare the security performance achieved by our proposed decision algorithms with that achieved by existing ones that do not consider or only partially consider the topological information, to verify the effectiveness of the algorithms. Our results show that by incorporating the network topology information, the security performance can be much improved. This work shed light on the optimum algorithm design for secure message dissemination.

Motivation & Objective

• Address the challenge of securing message dissemination in vehicular networks against insider malicious vehicles that tamper with message content.
• Overcome limitations of traditional encryption and key management in handling unknown, fast-moving vehicles and message conflicts from multiple sources.
• Improve decision accuracy in message integrity verification by incorporating underlying network topology information to detect inconsistencies.
• Design practical decision algorithms that are robust to dynamic network topologies and varying levels of malicious activity.
• Provide a framework that balances response time and decision accuracy through configurable waiting time periods for message collection.

Proposed method

• Formalize message consistency checking as a topological inference problem, modeling message paths and shared nodes to detect correlated false messages.
• Propose an optimum decision algorithm that uses Bayesian inference to compute the most likely correct message, based on network topology and known percentage of malicious vehicles.
• Develop a heuristic decision algorithm that relies solely on topological structure and message frequency, eliminating the need for prior knowledge of malicious vehicle ratio.
• Model message dissemination as a probabilistic process over time, with the destination vehicle waiting for a configurable period T before making a decision.
• Incorporate message correlation through shared nodes in message paths, enabling detection of multiple tampered copies originating from the same malicious source.
• Use simulation to compare performance against non-topology-aware algorithms, evaluating metrics like success probability and response time trade-offs.

Experimental results

Research questions

• RQ1 How can network topology be leveraged to improve the accuracy of message integrity decisions in the presence of insider malicious vehicles?
• RQ2 What is the optimal decision strategy for a vehicle to maximize the probability of correctly identifying a true message when multiple conflicting messages are received?
• RQ3 Can a practical heuristic decision algorithm be designed that performs nearly as well as the optimal algorithm without requiring prior knowledge of the malicious vehicle ratio?
• RQ4 How does the waiting time period T affect the trade-off between decision accuracy and response time in message consistency checking?
• RQ5 To what extent does incorporating topological correlation reduce the success rate of collusion attacks by malicious vehicles?

Key findings

• The proposed optimum decision algorithm achieves significantly higher message integrity success probability than topology-agnostic methods, especially when the percentage of malicious vehicles is known.
• The heuristic decision algorithm achieves security performance within 5% of the optimum algorithm when the malicious vehicle ratio is low, demonstrating strong practical viability.
• Security performance degrades with increasing malicious vehicle ratio, but drops sharply beyond a threshold (e.g., P_succ ≈ 0 when malicious ratio exceeds critical level), indicating a hard limit on resilience.
• Increasing the waiting time T improves decision accuracy up to a threshold (T_th ≈ 100ms for optimum, 150ms for heuristic), after which marginal gains diminish, indicating diminishing returns.
• Lower vehicular density requires longer waiting times to achieve equivalent decision accuracy, highlighting the importance of traffic density in setting T.
• Incorporating topological correlation enables detection of multiple false messages originating from the same malicious vehicle, significantly improving resilience to coordinated tampering.