Sie sind auf Seite 1von 6

Hop-by-Hop SRS

ABSTRACT
Message authentication is one of the most effective ways to thwart unauthorized and corrupted

messages from being forwarded in wireless sensor networks (WSNs). For this reason, many

message authentication schemes have been developed, based on either symmetric-key

cryptosystems or public-key cryptosystems. Most of them, however, have the limitations of high

computational and communication overhead in addition to lack of scalability and resilience to

node compromise attacks. To address these issues, a polynomial-based scheme was recently

introduced. However, this scheme and its extensions all have the weakness of a built-in threshold

determined by the degree of the polynomial: when the number of messages transmitted is larger

than this threshold, the adversary can fully recover the polynomial.

In this paper, we propose a scalable authentication scheme based on elliptic curve cryptography

(ECC). While enabling intermediate nodes authentication, our proposed scheme allows any node

to transmit an unlimited number of messages without suffering the threshold problem. In

addition, our scheme can also provide message source privacy. Both theoretical analysis and

simulation results demonstrate that our proposed scheme is more efficient than the polynomial-

based approach in terms of computational and communication overhead under comparable

security levels while providing message source privacy.

EXISTING SYSTEM:
 The public-key based approach, each message is transmitted along with the digital

signature of the message generated using the sender’s private key. Every intermediate

forwarder and the final receiver can authenticate the message using the sender’s public

key. One of the limitations of the public-key based scheme is the high computational

overhead.

 Computational complexity, memory usage, and security resilience, since public-key

based approaches have a simple and clean key management.

DISADVANTAGES OF EXISTING SYSTEM:

 High computational and communication overhead.

 Lack of scalability and resilience to node compromise attacks.

 Polynomial-based scheme have the weakness of a built-in threshold determined by the

degree of the polynomial.

PROPOSED SYSTEM:
 We propose an unconditionally secure and efficient SAMA. The main idea is that for

each message m to be released, the message sender, or the sending node, generates a

source anonymous message authenticator for the message m.

 The generation is based on the MES scheme on elliptic curves. For a ring signature, each

ring member is required to compute a forgery signature for all other members in the AS.

 In our scheme, the entire SAMA generation requires only three steps, which link all non-

senders and the message sender to the SAMA alike. In addition, our design enables the

SAMA to be verified through a single equation without individually verifying the

signatures.
ADVANTAGES OF PROPOSED SYSTEM:

 A novel and efficient SAMA based on ECC. While ensuring message sender privacy,

SAMA can be applied to any message to provide message content authenticity.

 To provide hop-by-hop message authentication without the weakness of the built- in

threshold of the polynomial-based scheme, we then proposed a hop-by-hop message

authentication scheme based on the SAMA.

 When applied to WSNs with fixed sink nodes, we also discussed possible techniques for

compromised node identification


HARDWARE & SOFTWARE REQUIREMENTS:

HARDWARE REQUIREMENT:

 Processor - Pentium –IV

 Speed - 1.1 GHz

 RAM - 256 MB (min)

 Hard Disk - 20 GB

 Floppy Drive - 1.44 MB

 Key Board - Standard Windows Keyboard

 Mouse - Two or Three Button Mouse

 Monitor - SVGA

SOFTWARE REQUIREMENTS:

 Operating System : Windows XP

 Front End : Microsoft Visual Studio .NET 2008

 Document : MS-Office 2007

Das könnte Ihnen auch gefallen