IMPLEMENTATION OF BLOM’S KEY PREDISTRIBUTION SCHEME BY USING ELLIPTIC CURVE CRYPTOGRAPHY

Cryptography, along with its various methods is used to serve the security communication purpose. Cryptography is said to be secure if the encryption key is hard to break by the attacker. Initially, Blom’s Key pre-distribution uses an integer finite field which makes this scheme easy to be intervened by attackers and criminal activists. Hence, this study suggests implementing the Elliptic Curve Cryptography to better enhance the security of the original Blom’s. In this proposed scheme, points generated from the elliptic curve will be appointed as public identifiers to be used in the original scheme. The private key and session key of each user are generated using the addition law mathematical operation with public identifiers assigned. Two users who intend to communicate with each other will obtain a common session key. Overall, the modification of Blom’s Key pre-distribution scheme will be presented in this study.

PUF-Based Mutual-Authenticated Key Distribution for Dynamic Sensor Networks

Because of the movements of sensor nodes and unknown mobility pattern, how to ensure two communicating (static or mobile) nodes authenticate and share a pairwise key is important. In this paper, we propose a mutual-authenticated key distribution scheme based on physical unclonable functions (PUFs) for dynamic sensor networks. Compared with traditional key predistribution schemes, the proposal reduces the storage overhead and the key exposure risks and thereby improves the resilience against node capture attacks. Mutual authentication is provided by the PUF challenge-response mechanism. However, the PUF response is not transmitted in plain forms so as to resist the modelling attacks, which is vulnerable in some existing PUF-based schemes. We demonstrate the proposed scheme to improve the secure connectivity and other performances by analysis and experiments.

Efficient Resource Allocation in Hybrid Wireless Networks Increase the Capacity

In many wireless sensor network (WSN) the Mobile sinks(MSs) are very essential applications for efficient data gathering, restricted sensor reprogramming, and for distinguishing and revoking compromised sensors. The sensor network that formulate use of the existing 2-tier security structure, elevate a new protection challenge i.e an attacker can easily create a replicated node and can gain control of the data in the network. This project describes a polynomial pool based approach hybrid three-tier general framework that permits the use of any pairwise key predistribution scheme as its basic component. In this technique we implement a special kind of sensor node, which is called as polynomial pool. This sensor node not the part of actual communication. Polynomial pool checks all key of that intruder node and if key matches it allowed that node into network otherwise throwaway from the network. In this project we implemented a new technique with an algorithm named GNDA Good Node Detection Algorithm Based Approach technique with Wireless Sensor Networks. As we all know that, secured files are easily hacked by attacked by they are using several software. In my project the main aim is to avoid this kind of attackers & also increase the capacity by sending by files. Propose a Hybrid Distributed Three-hop Data Routing protocol (HDTR). HDTR protocol improves the Network efficiency and reduces the Overhead. This will also identify the good neighbor node to transfer the data.

KEY PREALLOCATION PROTOCOL BASED ON A SECRET SHARING SCHEME

The symmetric encryption session key generation protocol based on the Shamir secret sharing scheme and the Blom key predistribution scheme is proposed. Predistribution of key materials through secure channels is used. Key calculation is based on symmetric polynomials from three variables. Key calculation is based on threshold scheme (3,4). The basic protocol for two participants was considered. A scheme for an arbitrary number of users has been summarized.