230 likes | 359 Views
This presentation discusses the crucial topic of efficient and secure aggregation in vehicular ad hoc networks (VANETs). With growing security concerns in vehicular communications, our approach focuses on efficient group formation and aggregation mechanisms that safeguard against false information dissemination. We propose three innovative solutions: combined signatures, overlapping groups, and dynamic group key creation. Our simulation results demonstrate that these strategies not only enhance channel efficiency and lower message delivery delay but also improve data correctness. Join us to explore the balance between efficiency and security in VANETs.
E N D
Efficient Secure Aggregation in VANETs Maxim Raya, Adel Aziz, and Jean-Pierre Hubaux Laboratory for computer Communications and Applications (LCA) EPFL
Outline • Motivation • Attacker model • Secure group formation • Secure aggregation mechanisms • Simulation results • Conclusion
Why efficient secure aggregation? • VANET security is indispensable but expensive • De facto security: limited flooding of signed messages • Since many vehicles broadcast the same event, why not try aggregation? • Can we make it work in VANETs? • And can we make it secure? • The answer is in this presentation and it is: YES
How to make aggregation efficient and secure? • Requirements: • Channel efficiency • Low delay • Data correctness • Non-repudiation • We propose 3 solutions: • Combined signatures • Overlapping groups • Dynamic group key creation
Who is the attacker? • Major threat: false information dissemination • Assumption: Any group of more than 2 vehicles should contain a majority of honest nodes under normal density conditions
The secret of efficient aggregation: groups Information is relayed between groups, not individual vehicles
How to make a group? • Preset groups: efficient but not flexible • On-the-fly groups: flexible but not efficient • Location-based groups: efficient and flexible • The keyword is where and not who a vehicle’s neighbors are • Group formation step-by-step: • Dissect the map into small area cells, each defining a group • Load map dissection function/dissected maps into vehicles • Cells (groups) overlap to ensure handover • One option for leader election: group leader = vehicle closest to center (with lowest ID if many), elected for a given duration • A vehicle checks its GPS position to determine its cell (group)
Group formation Cell Leader Overlap TX range = 300 m Not to scale Cell size = 400 m
Group formation I am in cell X
SVGP (Secure VANET Group Protocol) • Goal: establishment of a symmetric group key • Secure groups protect the network from outsiders only • Concept: group leader transports group key to members • Subsequent messages include only a HMAC • On leave, nothing needs to be done • Vehicles at boundaries receive messages from 2 groups
Aggregation mechanism 1:Combined signatures • Concept: a group of vehicles reporting the same event combine their signatures • Advantages: • Overhead is grouped in one message => better channel efficiency • A group’s combined message => the group agrees on the content • Three types of combined signatures: m = message, S = Signature, C = Certificate
Aggregation mechanism 2: Overlapping groups • Concept: vehicles in the intersections of groups make a bridge for data • Group keys and messages are distributed using SVGP • The good: • Cheap symmetric crypto • The bad: • Need for position verification • Need for honest majority • Lack of non-repudiation
Aggregation mechanism 3:Dynamic Group Key Creation • Conciliates low overhead (symmetric crypto) with non-repudiation (digital signatures) • Dynamic group scenarios (e.g., platoon) • Step-by-step: • The leader sends a key request to the CA (Certificate Authority) • The CA generates an asymmetric group key pair and unique IDs for members (for non-repudiation) • Vehicles sign messages with the new group key and include their ID
Simulation results • ns-2 simulator • Rice scenario generator • EPFL VANET patch (available at http://ivc.epfl.ch) • Cell size: 400 meters • ECC with key size of 256 bits • 100 simulations • Simulated mechanism: concatenated signatures • Correctness level of messages: number of supporting signatures to consider a message correct. It is 4 in our simulations Scenario Source Destination 2400 m 2400 m
Efficiency vs. Security (correctness level) Destination aggregation Source aggregation
Conclusion • Objective: the tradeoff between efficiency and security • Efficient secure aggregation is a feasible answer: • Combined signatures • Overlapping groups • Dynamic group key creation • The advantages: • Better channel usage • Lower message delivery delay • Better data correctness and hence security • Visit http://ivc.epfl.ch and http://www.sevecom.org
SEVECOM (SEcure VEhicular COMmunication) Objectives: Identification of threats and Specification of a security architecture
CALL FOR PAPERS IEEE Journal on Selected Areas in Communications Vehicular Networks • Architecture of Vehicular networks • Vehicle-to-Vehicle • Vehicle-to-Roadside • Security and privacy • Cross-layer optimization techniques • Mobility and traffic models • Protocol design (low-power, multi-channel, etc.) • PHY, MAC, Network Layer (Routing protocols) • Channel Modeling • Cooperative aspects of vehicular communication • Scalability and Availability issues in Vehicular networks • Safety and commercial applications Manuscript Submission February 1, 2007 Acceptance Notification May 15, 2007 Final Manuscript Due to Publisher July 1, 2007 Publication Date 3rd Quarter 2007 http://www.jsac.ucsd.edu/Calls/vehnetwkcfp.htm