1 / 10

Security in Sensor Networks

Security in Sensor Networks. By: Tracy Barger, David Friedman, and Stavan Parikh. MEMS – Microelctromechanical Systems. Swarms ??. Group Behavior Bees ! MEMS (Smart Dust). Applications Surveillance Smart House Grocery Shopping FedEx tracking on Steroids. Environment Constraints.

kert
Download Presentation

Security in Sensor Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Security in Sensor Networks By: Tracy Barger, David Friedman, and Stavan Parikh

  2. MEMS – Microelctromechanical Systems Swarms ?? • Group Behavior Bees ! • MEMS (Smart Dust) • Applications • Surveillance • Smart House • Grocery Shopping • FedEx tracking on Steroids

  3. Environment Constraints • Power • Processor: 8 bit • Memory: 15K • RAM: 512 bytes • Devices not individually addressable

  4. Trust Model • Base Station • Complete Trust • Requires Authentication • Motes • Trust Self • Broadcast Communication: Insecure • Need Encryption

  5. Key Distribution and Encryption • Use symmetric cipher • Keys pre-initialized in motes • Use J-secure scheme (NAI Paper) • n nodes, y groups • All nodes in a group have same key K1 K2 Note: If security is a priority, keys can be refreshed using a group key distribution scheme such as key graphs

  6. Group Size Tradeoffs 1 n s • What’s optimal group size? • s = group size • Tradeoff:security v. # communications v. memory • Small, one-hop -- Use s = 1

  7. Hash-based Authentication Generates Xn; Calculates key Chain: H(Xn) = X n-1… H(X1)= X0 M = E(Command || Xi) Mote decrypts M, Checks H(Xi) = Xi-1 Then stores Xi in place of Xi-1

  8. Conclusion • Examined current security techniques • Key Distribution • Authentication • Tradeoff between modifying existing and starting from scratch • May be more beneficial to create new protocols • Security will be defined by application

More Related