1 TinySec: A Link Layer Security Architecture for Wireless Sensor Networks Chris Karlof, Naveen Sastry, David Wagner Presented by Paul Ruggieri.

Slides:



Advertisements
Similar presentations
TinySec: Security for TinyOS C. Karlof, N. Sastry, D. Wagner November 20, 2002.
Advertisements

Chris Karlof and David Wagner
Jason Li Jeremy Fowers. Background Information Wireless sensor network characteristics General sensor network security mechanisms DoS attacks and defenses.
CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (3) Information Security.
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
A Distributed Security Framework for Heterogeneous Wireless Sensor Networks Presented by Drew Wichmann Paper by Himali Saxena, Chunyu Ai, Marco Valero,
Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
TinySec: Security for TinyOS Chris Karlof Naveen Sastry David Wagner January 15, 2003
TinySec: A Link Layer Security Architecture for Wireless Sensor Networks C. Karlof, N. Sastry, D. Wagner SPINS: Security Protocol for Sensor Networks A.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Security.
Exploring timing based side channel attacks against i CCMP Suman Jana, Sneha K. Kasera University of Utah Introduction
TinySec: A Link Layer Security Architecture for Wireless Sensor Networks Seetha Manickam.
Security Issues In Sensor Networks By Priya Palanivelu.
Secure Routing in Sensor Networks: Attacks and Countermeasures First IEEE International Workshop on Sensor Network Protocols and Applications 5/11/2003.
Wired Equivalent Privacy (WEP)
1 CS 577 “TinySec: A Link Layer Security Architecture for Wireless Sensor Networks” Chris Karlof, Naveen Sastry, David Wagner UC Berkeley Summary presented.
TinySec: A Link Layer Security Architecture for Wireless Sensor Networks Chris Karlof, Naveen Sastry, David Wagner SenSys 2004.
Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale Wireless and Network Security Lecture.
Privacy and Security in Embedded Sensor Networks Daniel Turner 11/18/08 CSE237a.
Encapsulation Security Payload Protocol Lan Vu. OUTLINE 1.Introduction and terms 2.ESP Overview 3.ESP Packet Format 4.ESP Fields 5.ESP Modes 6.ESP packet.
Security in Wireless Sensor Networks Perrig, Stankovic, Wagner Jason Buckingham CSCI 7143: Secure Sensor Networks August 31, 2004.
SPINS: Security Protocols for Sensor Networks Adrian Perrig, Robert Szewczyk, Victor Wen, David Culler, J.D. Tygar Research Topics in Security in the context.
TinySec: Link Layer Security Chris Karlof, Naveen Sastry, David Wagner University of California, Berkeley Presenter: Todd Fielder.
SPINS: Security Protocols for Sensor Networks Adrian Perrig, Robert Szewczyk, Victor Wen, David Culler, and J.D. Tygar – University of California, Berkeley.
SPINS: Security Protocols for Sensor Networks Adrian Perrig Robert Szewczyk Victor Wen David Culler Doug TygarUC Berkeley.
TinySec: Performance Characteristics Chris K :: Naveen S :: David W January 16, 2004.
Lecture 23 Symmetric Encryption
Key management in wireless sensor networks Kevin Wang.
Network Security. Contents Security Requirements and Attacks Confidentiality with Conventional Encryption Message Authentication and Hash Functions Public-Key.
Block Cipher Transmission Modes CSCI 5857: Encoding and Encryption.
KAIS T A lightweight secure protocol for wireless sensor networks 윤주범 ELSEVIER Mar
Modes of Operation. Topics  Overview of Modes of Operation  EBC, CBC, CFB, OFB, CTR  Notes and Remarks on each modes.
Security Considerations for IEEE Networks Karthikeyan Mahadevan.
1 TinySec: A Link Layer Security Architecture for Wireless Sensor Networks Hai Yan Computer Science & Engineering University of Connecticut.
TinySec: A Link Layer Security Architecture for Wireless Sensor Networks – Chris Karlof, Naveen Sastry & David Wagner Dr. Xiuzhen Cheng Department of Computer.
COEN 350 Mobile Security. Wireless Security Wireless offers additional challenges: Physical media can easily be sniffed. War Driving Legal? U.S. federal.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks.
Intercepting Mobile Communications: The Insecurity of Nikita Borisov Ian Goldberg David Wagner UC Berkeley Zero-Knowledge Sys UC Berkeley Presented.
Wireless LAN Security. Security Basics Three basic tools – Hash function. SHA-1, SHA-2, MD5… – Block Cipher. AES, RC4,… – Public key / Private key. RSA.
Secure routing in wireless sensor network: attacks and countermeasures Presenter: Haiou Xiang Author: Chris Karlof, David Wagner Appeared at the First.
Network Security David Lazăr.
Sensor Network Security: Survey Team Members Pardeep Kumar Md. Iftekhar Salam Ah. Galib Reza 110/28/2015.
Security on Sensor Networks Presented by Min-gyu Cho SPINS: Security Protocol for Sensor Networks TinySec: Security for TinyOS SPINS: Security Protocol.
IPsec IPsec (IP security) Security for transmission over IP networks –The Internet –Internal corporate IP networks –IP packets sent over public switched.
Shambhu Upadhyaya Security – AES-CCMP Shambhu Upadhyaya Wireless Network Security CSE 566 (Lecture 13)
Security in WSN Vinod Kulathumani West Virginia University.
Delay Aware, Reconfigurable Security for Embedded Systems Philip Brisk 2 Tammara Massey 1 Foad Dabiri 1 Majid Sarrafzadeh
Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures Chris Karlof and David Wagner (modified by Sarjana Singh)
TinySec: A Link Layer Security Architecture for Wireless Sensor Networks Chris Karlof :: Naveen Sastry :: David Wagner Presented by Roh, Yohan October.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
Chapter 7 – Confidentiality Using Symmetric Encryption.
TinySec : Link Layer Security Architecture for Wireless Sensor Networks Chris Karlof :: Naveen Sastry :: David Wagner Presented by Anil Karamchandani 10/01/2007.
TinySec: Performance Characteristics Chris K :: Naveen S :: David W January 16, 2004.
Computer Science 1 TinySeRSync: Secure and Resilient Time Synchronization in Wireless Sensor Networks Speaker: Sangwon Hyun Acknowledgement: Slides were.
Privacy and Integrity: “ Two Essences of Network Security” Presenter Prosanta Gope Advisor Tzonelih Hwang Quantum Information and Network Security Lab,
1 Wireless Threats 1 – Cracking WEP Cracking WEP in Chapter 5 of Wireless Maximum Security by Peikari, C. and Fogie, S.
Wireless Security Rick Anderson Pat Demko. Wireless Medium Open medium Broadcast in every direction Anyone within range can listen in No Privacy Weak.
TinySec: A Link Layer Security Architecture for Wireless Sensor Networks Seetha Manickam Modified by Sarjana Singh.
1 Routing security against Threat models CSCI 5931 Wireless & Sensor Networks CSCI 5931 Wireless & Sensor Networks Darshan Chipade.
Wired Equivalent Privacy (WEP) Chris Overcash. Contents What is WEP? What is WEP? How is it implemented? How is it implemented? Why is it insecure? Why.
MiniSec: A Secure Sensor Network Communication Architecture Carnegie Mellon UniversityUniversity of Maryland at College Park Mark Luk, Ghita Mezzour, Adrian.
TinySec: Security for TinyOS
Security Of Wireless Sensor Networks
Security of Wireless Sensor Networks
SPINS: Security Protocols for Sensor Networks
Outline A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J. D. Tygar. SPINS: Security protocols for sensor networks. In Proceedings of MOBICOM, 2001 Sensor.
Lecture 36.
Lecture 36.
Presentation transcript:

1 TinySec: A Link Layer Security Architecture for Wireless Sensor Networks Chris Karlof, Naveen Sastry, David Wagner Presented by Paul Ruggieri

2 Introduction What is TinySec? Link-layer security architecture for wireless sensor networks Link-layer security architecture for wireless sensor networks Why do we need TinySec? Sensor Networks need a way to communicate securely Sensor Networks need a way to communicate securely Wireless inherently insecure due to it’s broadcast nature Wireless inherently insecure due to it’s broadcast nature Existing secure protocols are too bloated for wireless sensor networks Existing secure protocols are too bloated for wireless sensor networks Sensor networks have limited computational resources, battery life and communication capabilities

3 Contributions TinySec is the first fully-implemented link-layer security protocol for wireless sensor networks TinySec is implemented in official TinyOS release TinySec is implemented in official TinyOS release Tradeoffs between performance, transparency and security are discussed The authors try to balance this tradeoff for the application (wireless sensor networks) The authors try to balance this tradeoff for the application (wireless sensor networks) Bandwidth, latency and power consumption are analyzed for TinySec It is feasible to implement this in software It is feasible to implement this in software TinySec is a basis for higher level security protocols

4 Sensor Networks Heterogeneous system of sensor with general-purpose computing elements Most networks will consist of hundreds or thousands of sensors Generally used to collection some information about an environment

5 Representative Hardware Mica2 Several cubic inches Several cubic inches 8 MHz 8-bit Atmel CPU 8 MHz 8-bit Atmel CPU 128 kB instruction memory 128 kB instruction memory 4 kB RAM (data) 4 kB RAM (data) 512 kB flash memory 512 kB flash memory 19.2 kbps radio with a range of ~100 meters 19.2 kbps radio with a range of ~100 meters Operates for ~ 2 weeks at full power Operates for ~ 2 weeks at full power Run TinyOS Run TinyOS

6 Mica2 Hardware

7 Security Risks & Threat Models Broadcast medium Adversaries can listen to data, intercept data, inject data and alter transmitted data Adversaries can listen to data, intercept data, inject data and alter transmitted data What TinySec does Guarantee message authenticity, integrity and confidentiality Guarantee message authenticity, integrity and confidentiality What TinySec doesn’t protect against Resource consumption attacks Resource consumption attacks Physical tamper resistance Physical tamper resistance Node capture attacks Node capture attacks

8 Link-Layer vs End-to-End End-to-end security Typical approach in wired networks Typical approach in wired networks Packets are encrypted by the sender and decrypted by the receiver Packets are encrypted by the sender and decrypted by the receiver Nodes relaying the message don’t decrypt the message, relay as-is Nodes relaying the message don’t decrypt the message, relay as-is Transport layer Transport layer Link-layer security Each physical transmission of the packet gets encoded and decoded Each physical transmission of the packet gets encoded and decoded Data link layer Data link layer

9 Why Link-Layer Security? Sensor networks typically have a many-to-one architecture All sensors transmit their readings to the base station All sensors transmit their readings to the base station Ideally duplicate messages (from different sensors) will be dropped Ideally duplicate messages (from different sensors) will be dropped Link-layer architecture needed Link-layer architecture needed Link-layer architecture detects “bad” packets immediately Saves resources Saves resources

10 Design Goals: Security Access Control Unauthorized parties should not be able to participate Unauthorized parties should not be able to participate Solution: MAC code Solution: MAC code Message Integrity If a message is modified in transit, it needs to be detected If a message is modified in transit, it needs to be detected Solution: MAC code Solution: MAC code Message Confidentiality Information needs to be kept private from unauthorized parties Information needs to be kept private from unauthorized parties Solution: Encryption Solution: Encryption

11 Design Goals: Security (Omission) Replay Protection An unauthorized party resends a legitimate packet which it overheard at a later time An unauthorized party resends a legitimate packet which it overheard at a later time Typical defense: associate counter with each message Typical defense: associate counter with each message Problem: state needs to be kept for this and we don’t have the resources for this Problem: state needs to be kept for this and we don’t have the resources for this Solution: Let a higher level protocol deal with this if it is a problem Solution: Let a higher level protocol deal with this if it is a problem

12 Design Goals: Performance Overhead Increase in message length Increase in message length Decrease throughput Increase latency Increase power consumption Increase in computation (encryption) Increase in computation (encryption) Increase power consumption 8 bytes is ~25% of packet size Traditional security protocols use 8-16 bytes at least Traditional security protocols use 8-16 bytes at least

13 Design Goals: Ease of Use Higher level security protocols will rely on TinySec Transparency TinySec should be transparent to the application developer when in use TinySec should be transparent to the application developer when in usePortability TinySec should support different CPU and radio hardware TinySec should support different CPU and radio hardware Any necessary porting should be as painless as possible Any necessary porting should be as painless as possible

14 Security Primitives: MAC Message Authentication Code (MACs) Solution to message authenticity and integrity Solution to message authenticity and integrity Cryptographically secure CRC Cryptographically secure CRC Sender and Receiver share a private key Sender and Receiver share a private key Sender computes MAC over message using private key and includes it in the packet Sender computes MAC over message using private key and includes it in the packet Receiver does the same, if MAC computed is different from MAC in the message, receiver rejects the message Receiver does the same, if MAC computed is different from MAC in the message, receiver rejects the message

15 Security Primitives: IV Initialization Vectors (IVs) Encryption mechanism Encryption mechanism Side input to encryption algorithm Side input to encryption algorithm Helps to achieve Semantic Security Helps to achieve Semantic Security Adversaries should have no better than a 50% chance at guessing any yes/no question about a message IV adds variation to Encryption IV adds variation to Encryption Important when encrypted messages vary little IV is publicly included as part of message IV is publicly included as part of message Tradeoff on IV length of overhead vs resource usage Tradeoff on IV length of overhead vs resource usage

16 TinySec Design TinySec-AE Authentication & Encryption Authentication & Encryption MAC computed over encrypted data and the packet header MAC computed over encrypted data and the packet header Ensures data received is from a trusted node Ensures data received is from a trusted node Prevents adversaries from seeing data Prevents adversaries from seeing dataTinySec-Auth Authentication Only Authentication Only Only ensure data received is from a trusted node Only ensure data received is from a trusted node Good when data does not need to be private Good when data does not need to be private

17 TinySec Encryption Encryption Scheme Cipher block chaining (CBC) Cipher block chaining (CBC) IV format 8 byte IV 8 byte IV Want to minimize overhead while getting enough security Want to minimize overhead while getting enough security Part of IV is a counter Part of IV is a counter More on this later… More on this later…

18 Encryption Algorithm Options Stream ciphers Faster than block ciphers (good!) Faster than block ciphers (good!) If we ever use the same IV, it is highly likely both messages can be decrypted (bad!) If we ever use the same IV, it is highly likely both messages can be decrypted (bad!) We have limited resources to vary the IV Must use a block cipher algorithm Block ciphers Keyed pseudorandom permutation over bit strings Keyed pseudorandom permutation over bit strings Operates on blocks of data (message broken up into blocks) Operates on blocks of data (message broken up into blocks)

19 More on Block Ciphers Good MAC algorithms use block cipher-s Two bird with one stone (save code space) Two bird with one stone (save code space) Mode of operation Counter (CTR) Counter (CTR) Similar to stream ciphers – reject Cipher block chaining (CBC) Cipher block chaining (CBC) Can be made to work with IVs that may repeat XOR encryption of message length with first plaintext block XOR encryption of message length with first plaintext block Examples include: DES, AES, RC5, Skipjack DES, AES, RC5, Skipjack Skipjack chosen due to licensing issues and practicality of software implementation Skipjack chosen due to licensing issues and practicality of software implementation

20 Packet Format IV TinyOS Packet Format TinySec-Auth Packet Format TinySec-AE Packet Format 36 Bytes 37 Bytes 41 Bytes

21 Packet Format Explained Destination, AM and length sent unencrypted Used for early rejection of messages Used for early rejection of messages Only data is encrypted (TinySec-AE) Only data is encrypted (TinySec-AE) Take 2 bytes for CRC and put them toward 4 bytes used for MAC (+2 bytes) MAC computed over entire packet (data + header) MAC computed over entire packet (data + header) Group field dropped (-1 byte) Differentiates between multiple sensor networks Differentiates between multiple sensor networks MAC does this for us MAC does this for us TinySec-AE additional fields (+4 bytes) src – source address src – source address ctr – counter ctr – counter These add variability to the IV These add variability to the IV

22 Security Analysis Message Integrity and Authenticity Based on MAC length (4 bytes for TinySec) Based on MAC length (4 bytes for TinySec) 1 in 2^32 chance to guess it 1 in 2^32 chance to guess it Adversary must send 2^32 packets to correctly fake a message Adversary must send 2^32 packets to correctly fake a message This is not OK for regular networks, given our data rate, this is ok This is not OK for regular networks, given our data rate, this is ok It would take 20 months to send this many packets at 19.2kb/s (What if hardware improves significantly?) (How will TinySec keep up?) (Authors argue that the trend is not in this direction)

23 Security Analysis Message Confidentiality Security based on IV length, assuming no reuse Security based on IV length, assuming no reuse 8 byte counter or 16 byte random would be sufficient However, we have an 8 byte total IV However, we have an 8 byte total IV 2 Destination, 1 AM, 1 Length, 2 Source and 2 Counter Try to maximize packets each node can send before global reuse of an IV Each node can send 2^16 packets before IV reuse Each node can send 2^16 packets before IV reuse Assume same destination, AM and length At 1 packet per minute -> reuse will not occur for 45 days (Again, what if this changes?) IV reuse only problem when using same private key IV reuse only problem when using same private key

24 Keying Mechanisms How do we distribute private keys to trusted nodes? Keys preconfigured Network-wide 1 key for all nodes in the network 1 key for all nodes in the networkPer-link Each pair of nodes that communicate share a key Each pair of nodes that communicate share a keyPer-group Each set of nodes that communicate share a key Each set of nodes that communicate share a key (Slightly off topic, but relevant to making the system work)

25 Implementation TinySec implemented for TinyOS Runs on Mica, Mica2, and Mica2Dot Runs on Mica, Mica2, and Mica2Dot 3000 lines of nesC code TinySec uses 728 bytes of RAM and 7146 bytes of program space (Good!) (Good!) Needed to modify the TinyOS scheduler to be a priority FIFO queue (2 priorities) Cryptographic operations highest priority Cryptographic operations highest priority

26 Implementation TinySec is independent of the encryption algorithm used Both RC5 and SkipJack implemented Both RC5 and SkipJack implemented Upper two bits of length field hijacked to determine mode of operation Enabling TinySec is as simple as defining an environment variable in your makefile For testing, network-wide key used

27 Evaluation Cost of TinySec? Larger packets – more overhead Larger packets – more overhead Decrease throughput Increase Latency Increase power consumption This occurs regardless of implementation Encryption algorithm (MAC and encryption) Encryption algorithm (MAC and encryption) Increase power consumption This can be vary depending on implementation Hardware support could remove this cost Hardware support could remove this cost

28 Evaluation – Cipher Costs Cipher algorithm Affects computation time Affects computation time Thus affects power consumption overhead Thus affects power consumption overhead Must complete in time for data to be ready for the radio Must complete in time for data to be ready for the radio

29 Evaluation –Energy Cost

30 Evaluation –Energy Cost Sampled current drawn for sending 24 bytes of data Power draw at the beginning is cryptographic operations + sending start symbol TinyOS – mAH TinySec-Auth – mAH (+3%) TinySec-AE – mAH (+10%) Most of excess power draw comes from radio use of additional overhead (not CPU draw) Helps support argument that we can do this in software Helps support argument that we can do this in software

31 Evaluation - Throughput

32 Evaluation - Throughput Computed how many packets could be sent in 30 seconds Varied the number of senders 24 bytes of data sent 24 bytes of data sent TinySec-Auth almost identical to TinyOS TinySec-AE is ~6% lower with more than 5 senders Payloads later varied to equate packet size Shows that added throughput comes totally from additional packet size (Obvious, but good to show) Shows that added throughput comes totally from additional packet size (Obvious, but good to show)

33 Evaluation - Latency

34 Evaluation - Latency 36 nodes setup in 6 x 7.75 ft grid Network diameter is 10 hops Message path: Base station, node, landmark, node, base Base station, node, landmark, node, base Minimum hop count = 4 Minimum hop count = 4 For each route length, route 200 packets Average transmission times per hop count Additional latency attributed to additional overhead

35 Conclusions TinySec addresses an area which was previously unimplemented Link-layer security for wireless sensor networks Link-layer security for wireless sensor networks Very easy for developers to take advantage of Performance and resource hit is not bad TinySec-Auth very close to TinyOS TinySec-Auth very close to TinyOS TinySec-AE performs well TinySec-AE performs well

36 Comments (Good explanation) (Authors thoroughly evaluated the system) (System proved to satisfy the authors’ goals) (Covers a gap in wireless networking) (Many other projects seem to be using TinySec)

37 Acknowledgements Slide 6 - mica2 picture Slide 6 - mica2 picture _fall/rhoyo.ppt _fall/rhoyo.ppt Slide 6 - mica2 picture Slide 6 - mica2 picture Slide 20 – Packet format pictures Slide 20 – Packet format pictures Original Paper Slide 28 – Table 3 Slide 28 – Table 3 Slide 29 – Figure 2 Slide 29 – Figure 2 Slide 31 – Figure 3 Slide 31 – Figure 3 Slide 33 – Figure 4 Slide 33 – Figure 4