Efficient Secure Aggregation in VANETs Maxim Raya, Adel Aziz, and Jean-Pierre Hubaux Laboratory for computer Communications and Applications (LCA) EPFL.

Slides:



Advertisements
Similar presentations
11/2/2013 2:02:38 AM 5864_ER_FED 1 Importing Certificates into Lotus Notes R6.
Advertisements

Ou Liang, Ahmet Sekercioglu and Nallasamy Mani
GSA Pizza Talk - EPFL - Capillary routing with FEC by E. Gabrielyan 1 Capillary Multi-Path Routing for reliable Real-Time Streaming with FEC.
1 UNIT I (Contd..) High-Speed LANs. 2 Introduction Fast Ethernet and Gigabit Ethernet Fast Ethernet and Gigabit Ethernet Fibre Channel Fibre Channel High-speed.
Bellwork If you roll a die, what is the probability that you roll a 2 or an odd number? P(2 or odd) 2. Is this an example of mutually exclusive, overlapping,
1 Security for Ad Hoc Network Routing. 2 Ad Hoc Networks Properties Mobile Wireless communication Medium to high bandwidth High variability of connection.
ISA 662 IKE Key management for IPSEC Prof. Ravi Sandhu.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
Reconsidering Reliable Transport Protocol in Heterogeneous Wireless Networks Wang Yang Tsinghua University 1.
Security Issues In Mobile IP
Transportation-aware Routing in Delay Tolerant Networks (DTNs) Asia Future Internet 2008 Taekyoung Kwon Seoul National University.
Interconnection: Switching and Bridging CS 4251: Computer Networking II Nick Feamster Fall 2008.
Proactive Traffic Merging Strategies for Sensor-Enabled Cars
1 A Static-Node Assisted Adaptive Routing Protocol in Vehicular Networks Yong Ding, Chen Wang, Li Xiao {dingyong, wangchen, Department.
On Scheduling Vehicle-Roadside Data Access Yang Zhang Jing Zhao and Guohong Cao The Pennsylvania State University.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
1 Data Link Protocols By Erik Reeber. 2 Goals Use SPIN to model-check successively more complex protocols Using the protocols in Tannenbaums 3 rd Edition.
ZMQS ZMQS
Università degli Studi di Firenze 08 July 2004 COST th MCM - Budapest, Hungary 1 Cross-layer design for Multiple access techniques in wireless communications.
Gareth Ellis Senior Solutions Consultant Session 5a Key and PIN Management.
Juan-Antonio CorderoPhilippe JacquetEmmanuel Baccelli Orlando, FL -- March 29 th, 2012 Impact of Jitter-based Techniques on Flooding over Wireless Ad hoc.
ATM Firewall Routers with Black Lists Hwajung LEE The George Washington University School of Engineering and Applied Science Electrical Engineering and.
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.
Protecting Location Privacy: Optimal Strategy against Localization Attacks Reza Shokri, George Theodorakopoulos, Carmela Troncoso, Jean-Pierre Hubaux,
IONA Technologies Position Paper Constraints and Capabilities for Web Services
Introduction to MS-Aloha R. Scopigno, Networking Lab – 1.
YO-YO Leader Election Lijie Wang
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
An Interleaved Hop-by-Hop Authentication Scheme for Filtering of Injected False Data in Sensor Networks Presenter: Dinesh Reddy Gudibandi.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialBCMSN BCMSN Module 1 Lesson 1 Network Requirements.
Addition 1’s to 20.
25 seconds left…...
Week 1.
We will resume in: 25 Minutes.
© 2007 Levente Buttyán and Jean-Pierre Hubaux Security and Cooperation in Wireless Networks Chapter 11: Wireless operators in.
Securing Critical Unattended Systems with Identity Based Cryptography A Case Study Johannes Blömer, Peter Günther University of Paderborn Volker Krummel.
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
CSLI 5350G - Pervasive and Mobile Computing Week 6 - Paper Presentation “Exploiting Beacons for Scalable Broadcast Data Dissemination in VANETs” Name:
 Introduction  Benefits of VANET  Different types of attacks and threats  Requirements and challenges  Security Architecture  Vehicular PKI.
Securing Vehicular Communications Author : Maxim Raya, Panos Papadimitratos, and Jean-Pierre Hubaux From : IEEE Wireless Communications Magazine, Special.
GrooveSim: A Topography- Accurate Simulator for Geographic Routing in Vehicular Networks 簡緯民 P
1 Key Management for Vehicular Networks Maxim Raya and Jean-Pierre Hubaux Secure Vehicular Communications Workshop EPFL - 19/05/2015.
A Mobile Infrastructure Based VANET Routing Protocol in the Urban Environment School of Electronics Engineering and Computer Science, PKU, Beijing, China.
Mini-Project 2007 On Location Privacy in Vehicular Mix-Networks Julien Freudiger IC-29 Self-Organised Wireless and Sensor Networks Tutors: Maxim Raya Márk.
Mini-Project 2006 Secure positioning in vehicular networks based on map sharing with radars Mini-Project IC-29 Self-Organized Wireless and Sensor Networks.
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
VIRTUAL ROUTER Kien A. Hua Data Systems Lab School of EECS University of Central Florida.
MASY: Management of Secret keYs in Mobile Federated Wireless Sensor Networks Jef Maerien IBBT DistriNet Research Group Department of Computer Science Katholieke.
1 Objective and Secure Reputation-Based Incentive Scheme for Ad-Hoc Networks Dapeng Oliver Wu Electrical and Computer Engineering University of Florida.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Group-based Source Authentication in VANETs You Lu, Biao Zhou, Fei Jia, Mario Gerla UCLA {youlu, zhb, feijia,
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks
An Improved Vehicular Ad Hoc Routing Protocol for City Environments Moez Jerbi, Sidi-Mohammed Senouci, and Rabah Meraihi France Telecom R&D, Core Network.
Weichao Wang, Bharat Bhargava Youngjoo, Shin
Black-Burst-Based Multihop Broadcast Protocols for Vehicular Networks Gökhan Korkmaz, Eylem Ekici, and Füsun Özgüner Member, IEEE IEEE TVT 2007.
VANETs. Agenda System Model → What is VANETs? → Why VANETs? Threats Proposed Protocol → AOSA → SPCP → PARROTS Evaluation → Entropy → Anonymity Set → Tracking.
Mobile Networks and Applications (January 2007) Presented by J.H. Su ( 蘇至浩 ) 2016/3/21 OPLab, IM, NTU 1 Joint Design of Routing and Medium Access Control.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
 Attacks and threats  Security challenge & Solution  Communication Infrastructure  The CA hierarchy  Vehicular Public Key  Certificates.
VANET.
Privacy Preservation and Protection Scheme over ALARM on Geographical routing B. Muthusenthil, S. Murugavalli Results The PPS is geographical routing protocol,
Presentation transcript:

Efficient Secure Aggregation in VANETs Maxim Raya, Adel Aziz, and Jean-Pierre Hubaux Laboratory for computer Communications and Applications (LCA) EPFL

2 Outline Motivation Attacker model Secure group formation Secure aggregation mechanisms Simulation results Conclusion

3 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? 1.Can we make it work in VANETs? 2.And can we make it secure? The answer is in this presentation and it is: YES

4 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

5 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

6 The secret of efficient aggregation: groups Information is relayed between groups, not individual vehicles

7 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 vehicles neighbors are Group formation step-by-step: 1.Dissect the map into small area cells, each defining a group 2.Load map dissection function/dissected maps into vehicles 3.Cells (groups) overlap to ensure handover 4.One option for leader election: group leader = vehicle closest to center (with lowest ID if many), elected for a given duration 5.A vehicle checks its GPS position to determine its cell (group)

8 Group formation

9 Cell Overlap TX range = 300 m Cell size = 400 m Leader Not to scale

10 Group formation I am in cell X

11 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

12 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 groups combined message => the group agrees on the content Three types of combined signatures: m = message, S = Signature, C = Certificate

13 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

14 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: 1.The leader sends a key request to the CA (Certificate Authority) 2.The CA generates an asymmetric group key pair and unique IDs for members (for non-repudiation) 3.Vehicles sign messages with the new group key and include their ID

15 Simulation results ns-2 simulator Rice scenario generator EPFL VANET patch (available at 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 2400 m Scenario Source Destination

16 Effect of density on channel usage

17 Effect of density on message delay

18 Effect of speed on channel usage

19 Effect of speed on message delay

20 Efficiency vs. Security (correctness level) Destination aggregation Source aggregation

21 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 and

22 SEVECOM (SEcure VEhicular COMmunication) Objectives: Identification of threats and Specification of a security architecture

23 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 SubmissionFebruary 1, 2007 Acceptance Notification May 15, 2007 Final Manuscript Due to PublisherJuly 1, 2007 Publication Date3rd Quarter