Probabilistic validation of aggregated data in vehicular ad-hoc networks
Authors:
Open Access
- 29 September 2006
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 76-85
Abstract
Vehicular ad-hoc networks present great opportunity for information exchange and equal opportunity for abuse. Validating traffic information without imposing significant communication overheads is a hard problem. In this paper, we propose a solution for validating aggregated data. The main idea is to use random checks to probabilistically catch the attacker, and thereby discourage attacks in the network. Our solution relies on PKI based authentication and assumes a tamper-proof service in each car to carry out certain secure operations such as signing and timestamping. We try to keep the set of secure operations as small as possible, in accordance with the principle of economy of mechanism. We show that our solution provides security without significant communication overheads.Keywords
This publication has 10 references indexed in Scilit:
- The security of vehicular ad hoc networks2005
- Secure positioning of wireless devices with application to sensor networks2005
- BIND: A Fine-Grained Attestation Service for Secure Distributed Systems2005
- Detecting and correcting malicious data in VANETs2004
- TrafficViewACM SIGMOBILE Mobile Computing and Communications Review, 2004
- The sybil attack in sensor networks2004
- Packet leashes: a defense against wormhole attacks in wireless networks2004
- SIA2003
- Sampling algorithms2001
- The protection of information in computer systemsProceedings of the IEEE, 1975