PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan 810011104707 810011104706 Department of Computer Science.

Slides:



Advertisements
Similar presentations
ACHIEVING NETWORK LEVEL PRIVACY IN WIRELESS SENSOR NETWORKS.
Advertisements

A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
IEEE INFOCOM 2004 MultiNet: Connecting to Multiple IEEE Networks Using a Single Wireless Card.
Efficient Public Key Infrastructure Implementation in Wireless Sensor Networks Wireless Communication and Sensor Computing, ICWCSC International.
Packet Leashes: Defense Against Wormhole Attacks Authors: Yih-Chun Hu (CMU), Adrian Perrig (CMU), David Johnson (Rice)
Defending Against Traffic Analysis Attacks in Wireless Sensor Networks Security Team
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.
On the Node Clone Detection inWireless Sensor Networks.
Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks.
A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation.
WARNINGBIRD: A Near Real-time Detection System for Suspicious URLs in Twitter Stream.
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.
Chapter 2 – X.25, Frame Relay & ATM. Switched Network Stations are not connected together necessarily by a single link Stations are typically far apart.
Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
Computer Networks Group Universität Paderborn TANDEM project meeting Protocols, oversimplification, and cooperation or: Putting wireless back into WSNs.
Secure routing in wireless sensor network: attacks and countermeasures Presenter: Haiou Xiang Author: Chris Karlof, David Wagner Appeared at the First.
Abstract Link error and malicious packet dropping are two sources for packet losses in multi-hop wireless ad hoc network. In this paper, while observing.
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.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
S& EDG: Scalable and Efficient Data Gathering Routing Protocol for Underwater Wireless Sensor Networks 1 Prepared by: Naveed Ilyas MS(EE), CIIT, Islamabad,
Department of Electronic Engineering City University of Hong Kong EE3900 Computer Networks Protocols and Architecture Slide 1 Use of Standard Protocols.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
1 Routing security against Threat models CSCI 5931 Wireless & Sensor Networks CSCI 5931 Wireless & Sensor Networks Darshan Chipade.
OSI ARCHITECTURE IN OSI, ACTUAL INFORMATION IS OVERHEADED BY PROTOCOL LAYERS IF ALL SEVEN LAYERS ARE OVERHEADED, THEN AS LITTLE AS 15% OF THE TRANSMITTED.
Energy-Efficient Protocol for Cooperative Networks.
ONLINE INTRUSION ALERT AGGREGATION WITH GENERATIVE DATA STREAM MODELING.
SECURITY. Security Threats, Policies, and Mechanisms There are four types of security threats to consider 1. Interception 2 Interruption 3. Modification.
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
TBAS: Enhancing Wi-Fi Authentication by Actively Eliciting Channel State Information Muye Liu, Avishek Mukherjee, Zhenghao Zhang, and Xiuwen Liu Florida.
Network Security Presented by: JAISURYA BANERJEA MBA, 2ND Semester.
The University of Adelaide, School of Computer Science
CS408/533 Computer Networks Text: William Stallings Data and Computer Communications, 6th edition Chapter 1 - Introduction.
Packet Leashes: Defense Against Wormhole Attacks
ABSTRACT   Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. Due to the.
What's the buzz about HORNET?
Wireless Sensor Network Architectures
Understanding the OSI Reference Model
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Net 435: Wireless sensor network (WSN)
Packetizing Error Detection
Efficient CRT-Based RSA Cryptosystems
Chapter 3: Open Systems Interconnection (OSI) Model
Wireless Communication Co-operative Communications
Packetizing Error Detection
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Communication operations
Wireless Communication Co-operative Communications
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
Zhenghao Zhang and Avishek Mukherjee Computer Science Department
Security Of Wireless Sensor Networks
Switching Techniques.
OSI Model The Seven Layers
Packetizing Error Detection
Security of Wireless Sensor Networks
Protocols.
Information Theoretical Analysis of Digital Watermarking
Circuit Switched Network
Computer Networks Protocols
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.
One-way Hash Function Network Security.
Secure Diffie-Hellman Algorithm
Key Exchange, Man-in-the-Middle Attack
Information Sciences and Systems Lab
Security in Wide Area Networks
Protocols.
Presentation transcript:

PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan Department of Computer Science

SECURE DATA TRANSMISSION IN NETWORK COMMUNICATION AGAINST ACTIVE ATTACKERS USING RC4 ALGORITHM

ABSTRACT Most of the existing work on key generation from wireless fading channels requires a direct wireless link between legitimate users so that they can obtain correlated observations from the common wireless link. This paper studies the key generation problem in the two-way relay channel, in which there is no direct channel between the key generating terminals. We propose an effective key generation scheme that achieves a substantially larger key rate than that of a direct channel mimic approach. Unlike existing schemes, there is no need for the key generating terminals to obtain correlated observations in our scheme. We also investigate the effects of an active attacker on the proposed key generation protocol. We characterize the optimal attacker’s strategy that minimizes the key rate of the proposed scheme. Furthermore, we establish the maximal attacker’s power under which our scheme can still achieve a nonzero key rate.

EXISTING SYSTEM In certain applications, however, two terminals might be far away from each other, and hence there is no direct channel between them. The two-way relay channel, in which two terminals are connected through a relay, is a basic setup that models this scenario. The key generation from the two ways relay channel problem was considered, which proposed several interesting schemes to circumvent the issue that there is no direct channel to provide the necessary common randomness. The basic idea of these schemes is to create a virtual direct link from which these two terminals can obtain channel estimates and then apply the approach. For example, in the amplify forward (AF) scheme discussed, Alice transmits a training sequence to the relay, which then sends a scaled version of the received noisy signal to Bob. From the received signal, Bob can obtain an estimate of the product of two channel gains: the one from Alice to the relay, and the one from the relay to Bob.

DISADVANTAGE Active node tries to send attack signals to interrupt the key generation process. It is very difficult to evaluate the key rate. No randomizes key generation. The key generation from the two ways relay channel problem was not considered

PROPOSED SYSTEM We propose a new scheme for the key generation in the two-way relay channel by adopting a scheme proposed in our recent work. Instead of trying to mimic a direct channel as done, in the proposed scheme, the two terminals involved do not need to obtain correlated estimates. Similarly, the relay and Bob can establish a pair-wise key using the channel linking them. The advantages of this approach are: 1) Eve does not obtain any information about the channel gains used for the key generation, hence our scheme obtains a much higher key rate; 2) It is very easy to evaluate the key rate of the proposed scheme; and 3) Our scheme can be easily extended to multiple antenna case, and the key rate scales linearly with the number of antennas. The second main contribution of the paper is to consider the active attacker scenario. In this paper, we assume that Eve’s goal is to send attack signals to minimize the key rate of the proposed scheme. The effects of an active attacker are twofold: 1) Eve can corrupt signals received by legitimate nodes, and hence reduce the correlations between the signals observed by legitimate users; and 2) By controlling the signals observed by the legitimate users, Eve has partial information about the observations used for the key generation. Both of these two effects will decrease the key rate.

ADVANTAGE It is very easy to evaluate the key rate. Characterizes the maximum attacker’s power. Reduce the correlations between the signals observed by legitimate users. Reduce the attack file rate.

SYSTEM SPECIFICATION HARDWARE SPECIFICATION: PROCESSOR: Intel(R) Pentium(R) Dual-Core Processing RAM:1GB RAM HARD DISK:20 GB SOFTWARE SPECIFICATION OPERATING SYSTEM:Windows XP,Windows2007 (32Bit Original) ENVIRONMENT: Visual Studio.NET 2005 or 2008 or 2010.NET FRAMEWORK :Version 2.0 or Version 3.0 or Version 4.0 LANGUAGE:C#.NET BACK END:MS-SQL-Server 2000

MODULE DESCRIPTION: This project contains four major module.those modules are follow 1.Energy based keying module. 2.Crypto module. 3.Packet transmission and reception module. 4.Performance analysis module.

ENERGY BASED KEYING MODULE The energy-based keying process involves the creation of dynamic keys. Contrary to other dynamic keying schemes, it does not exchange extra messages to establish keys. A sensor node computes keys based on its residual energy of the sensor. The key is then fed into the crypto module. CRYPTO MODULE The crypto module in EBEK employs a simple encoding process, which is essentially the process of permutation of the bits in the packet according to the dynamically created permutation code generated via RC4. The encoding is a simple encryption mechanism adopted for EBEK. However, EBEK ’ s flexible architecture allows for adoption of stronger encryption mechanisms.

PACKET TRANSMISSION AND RECEPTION MODULE The Packet transmission and reception module handles the process of sending or receiving of encoded packets along the path to the sink. And also get the acknowledgement from the receiver side to conform the delivery status of the node. PERFORMANCE ANALYSIS MODULE In this module we are going to consider the false injection and eavesdropping of messages from an outside malicious node. And also check a routing path is established from the sources in the event region to the sink. We assume that the path is fixed during the delivery of the data and the route setup is secure. So the sensor network is densely populated generate reports for the same event. This module will help to analyze the performance of the nodes.

DATA FLOW DIAGRAM: ENERGY-BASED ENCRYPTION AND KEYING USER SENDER RELAY RECEIVER AUTHETICATION UNMAE, PWD EBEK LEVEL: 0

SENDER Dynamic Key Generation Packet Encryption Performanc e Analysis Packet Send User File Size, Random Key Random Key, RC4 Encryption Key, Encrypted packet Key, File Size Uname, Pwd EBEK LEVEL: 1

RELAY Checking Key Packet Decryption Packet Send User Key Random Key, RC4 Decryption Message Uname, Pwd LEVEL: 2

LEVEL: 3 RECEIVE R User Message Uname, Pwd Receive Message

Authentication SECRET KEY GENERATION IN THE TWO-WAY RELAY CHANNEL WITH ACTIVE ATTACKERS Energy Based Keying Relay Receiver Packet Size Calculation Key Gen based on packet size Packet Send to relay Key Verify Decrypt the packet Send to Receiver Send Ack ARCHITECTURE DESIGN: