Presentation is loading. Please wait.

Presentation is loading. Please wait.

Integrating HaSAFSS into R.E.D for Node Replication Detection in Wireless Sensor Networks Shajith Ravi School of EECS - OSU CS519 - Advanced Network Security.

Similar presentations


Presentation on theme: "Integrating HaSAFSS into R.E.D for Node Replication Detection in Wireless Sensor Networks Shajith Ravi School of EECS - OSU CS519 - Advanced Network Security."— Presentation transcript:

1 Integrating HaSAFSS into R.E.D for Node Replication Detection in Wireless Sensor Networks Shajith Ravi School of EECS - OSU CS519 - Advanced Network Security

2 Source Papers A Randomized, Efficient, and Distributed Protocol for the Detection of Node Replication Attacks in Wireless Sensor Networks Mauro Conti, Roberto Di Pietro, Luigi V. Mancini and Alessandro Mei Hash-Based Sequential Aggregate and Forward Secure Signature for Unattended Wireless Sensor Networks Attila Altay Yavuz, Peng Ning

3 Objective RED claims to have best routing protocol; energy, memory and computationally efficient RED is based on a general PKC system e.g. ECDSA, RSA. HaSAFSS claims to be faster than standard PKCs, with just 3 hash operations for a signature generation/verification system. Objective : Integrate HaSAFSS into RED

4 Wireless Sensor Network (WSN) What are WSNs? Unattended? Applications Drawbacks Existing Protocols

5

6 Node Replication Attack: an attacker captures a node, clone it and distributes the cloned nodes in the network area. Cloned nodes could be used by the attacker to subvert the data aggregation or the decision making if based on some voting mechanism.

7 RED Protocol ID-based PKC Time synchronized Two Steps : – Random Value – Detection Phase

8 Pseudocode

9 Seed Random value is the seed. Broadcasted using centralized or distributed mechanism.

10 Detection Phase Each node broadcasts its claim (ID and location). Each node that hears a claim sends (with probability p) this claim to a set of g ≥ 1 pseudo-randomly selected network locations. – The pseudo random function takes as an input: ID, rand, g. – Every node in the path (from claiming node to the witness destination) forwards the message to its neighbor nearest to the destination.

11 Part 1

12 Verification to Revocation

13 HaSAFSS Four algorithms: – Key Generation – Forward-secure and aggregate signature generation – Time Trapdoor Release – Signature Verfication

14 Key Generation

15 Time Trapdoor Release Synchronous mode – the TTP can release the time trapdoor keys based on a pre-determined data delivery schedule periodically, without requiring an interaction with the receivers. Asynchronous mode – the TTP releases the time trapdoor key if and only if it is requested by a sufficient number of valid receivers.

16 Signature Generation

17 Signature Verification

18 Part 2 - Verification(Sym HaSAFSS)

19 Future Work Find a way to integrate Sym-HaSAFSS in order to replace a crypto system eg:ECDSA in RED Compare and Contrast performance analysis of original algorithm and modified algorithm

20 Thank You ! Questions?


Download ppt "Integrating HaSAFSS into R.E.D for Node Replication Detection in Wireless Sensor Networks Shajith Ravi School of EECS - OSU CS519 - Advanced Network Security."

Similar presentations


Ads by Google