Beruflich Dokumente
Kultur Dokumente
Abstract
A Wireless Sensor Network (WSN) in general is a collection of small, low-cost, and low battery powered sensor nodes that
communicate with each other through wireless link under highly resource constrained hostile environment. Many message
authentication schemes have been developed, based on either symmetric-key cryptosystems or public-key cryptosystems. This is
one of the most effective ways to thwart unauthorized and corrupted traffic from being forwarded in wireless sensor networks
(WSNs) To provide this service, 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 node 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.
Keywords: Wireless Sensor Network, Symmetric-Key Cryptosystem, Public-Key Cryptosystem, Source Privacy, Hop
Message Authentication.
--------------------------------------------------------------------***----------------------------------------------------------------------
1. INTRODUCTION
A wireless sensor network (WSN) consists of a collection of these nodes that have the ability to sense, process data and
communicate with each other via a wireless connection. Wireless sensor networks (WSNs), the improvement in sensor
technology has made it possible to have extremely small, low powered sensing devices equipped with programmable computing,
multiple parameter sensing and wireless communication capability. Also, the low cost makes it possible to have a network of
hundreds or thousands of these sensors, thereby enhancing the reliability and accuracy of data and the area coverage. Wireless
sensor networks offer information about remote structures, wide-spread environmental changes, etc. Wireless sensor network
(WSN) is a network system comprised of spatially distributed devices using wireless sensor nodes to monitor physical or
environmental conditions, such as sound, temperature, and motion.
The individual nodes wireless sensor network (WSN) is a network system comprised of spatially distributed devices using
wireless sensor nodes to monitor physical or environmental conditions, such as sound, temperature, and motion. The individual
nodes are capable of sensing their environments, processing the information data locally, and sending data to one or more
collection points in a WSN Efficient data transmission is one of the most important issues for WSNs. Meanwhile, many WSNs are
deployed in harsh, neglected and often adversarial physical environments for certain applications, such as military domains and
sensing tasks with trustless surroundings. Secure and efficient data transmission is thus especially necessary and is demanded in
many such practical WSNs such as sound, temperature, and motion.
A MAC algorithm, sometimes called keyed (cryptographic) hash function (however cryptographic hash is only one of the possible
way to generate MACs) , accepts as input a secret key and an arbitrary length message to be authenticated, outputs a MAC
(sometimes knows as a tag). The MAC value protects both the message data integrity as well as its authenticity, by allowing
verifiers (who also possess the secret key) to detect any changes to the message content. Message integrity guarantees that
message has not been changed. Message authentication guarantees that the sender of the message is authentic.
Message authentication is one of the most effective ways to thwart unauthorized and corrupted message from being forwarded in
networks to save precious energy. For this reason, many authentication schemes have been developed to provide message
_______________________________________________________________________________________
Special Issue | June-2014, Available @http://www.ijretm.com| Paper id - IJRETM-2014-SP-041 1
International Journal of Research in Engineering Technology and Management ISSN 2347 - 7539
authenticity and integrity verification for wireless sensor networks (WSNS) [1]-[5]. These schemes can largely divide into two
categories: public key based approaches and symmetric key based approaches.
To solve the scalability problem, a secret polynomial based message authentication scheme was introduced in [3]. The idea of this
scheme is similar to a threshold secret sharing, where the threshold is determined by the degree of the polynomial. This approach
offers information-theoretic security of the shared secret key when the number of messages transmitted is less than the threshold.
The intermediate nodes verify the authenticity of the message through a polynomial evaluation. However, when the number of
messages transmitted is larger than the threshold, the polynomial can be fully recovered and the system is completely broken.
1.2.5 Efficiency
The scheme should be efficient in terms of both computational and communication overhead.
2. LITERATURE SURVEY
2.1 Symmetric Key and Hash Based Authentication
F. Ye, H. Lou, S. Lu, and L. Zhang, Statistical en-route filtering of injected false data in sensor networks, in IEEE INFOCOM,
March 2004 and S. Zhu, S. Setia, S. Jajodia, and P. Ning, An interleaved hop-by-hop authentication scheme for filtering false
_______________________________________________________________________________________
Special Issue | June-2014, Available @http://www.ijretm.com| Paper id - IJRETM-2014-SP-041 2
International Journal of Research in Engineering Technology and Management ISSN 2347 - 7539
3. EXISTING SYSTEM
Symmetric key and hash based authentication schemes were proposed for WSNs.
Disadvantages
It requires initial time synchronization, which is not easy to be implemented in large scale WSNs.
It also introduces delay in message authentication, and the delay increases as the network scales up.
4. PROPOSED SYSTEM
Source anonymous message authentication code (SAMAC).
Message authentication code (MAC).
Hop by hop message authentication.
Compromised node detection.
Source privacy.
Key server management.
_______________________________________________________________________________________
Special Issue | June-2014, Available @http://www.ijretm.com| Paper id - IJRETM-2014-SP-041 3
International Journal of Research in Engineering Technology and Management ISSN 2347 - 7539
Step 6: We need to check the possible attacks those are active attack and passive attack.
6. RESULTS
First we have to select the existing file to select the path and initialize the nodes to all 17 nodes.
Later we have to select IP address and receiver then message will go to the receiver through router.
_______________________________________________________________________________________
Special Issue | June-2014, Available @http://www.ijretm.com| Paper id - IJRETM-2014-SP-041 4
International Journal of Research in Engineering Technology and Management ISSN 2347 - 7539
We need to check the possible attacks those are active attack and passive attack.
Inject the message by using active attacker, first select the file.
The opponent will try to analyze the data using Passive attacker.
7. CONCLUSIONS
Message authentication is an important concern in any network: without this unauthorized users could easily introduce invalid
data into the system. This service is usually provided through the deployment of a secure message authentication code (MAC).
In this paper, we first proposed a novel and efficient source anonymous message authentication scheme (SAMA) based on elliptic
curve cryptography (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 propose a hop-by-hop message authentication scheme based on the SAMA.
By providing Message authentication, Message integrity and hop by hop message authentication then source should be in high
privacy and network should be efficient.
8. REFERENCES
[1] F. Ye, H. Lou, S. Lu, and L. Zhang, Statistical en-route filtering of injected false data in sensor networks, in IEEE
INFOCOM, March 2004.
[2] S. Zhu, S. Setia, S. Jajodia, and P. Ning, An interleaved hop-by-hop authentication scheme for filtering false data in sensor
networks, in IEEE Symposium on Security and Privacy, 2004.
_______________________________________________________________________________________
Special Issue | June-2014, Available @http://www.ijretm.com| Paper id - IJRETM-2014-SP-041 6
International Journal of Research in Engineering Technology and Management ISSN 2347 - 7539
[3] C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, Perfectly-secure key distribution for dynamic
conferences, in Advances in Cryptology - Crypto92, ser. Lecture Notes in Computer Science Volume 740, 1992, pp. 471486.
[4] W. Zhang, N. Subramanian, and G. Wang, Lightweight and compromise-resilient message authentication in sensor
networks, in IEEE INFOCOM, Phoenix, AZ., April 15-17 2008.
[5] M. Albrecht, C. Gentry, S. Halevi, and J. Katz, Attacking cryptographic schemes based on perturbation polynomials,
Cryptology ePrint Archive, Report 2009/098, 2009, http://eprint.iacr.org
[6] H. Wang, S. Sheng, C. Tan, and Q. Li, Comparing symmetric-key and public-key based security schemes in sensor networks:
A case study of user access control, in IEEE ICDCS, Beijing, China, 2008, pp. 1118.
[7] D. Pointcheval and J. Stern, Security proofs for signature schemes, in Advances in Cryptology - EUROCRYPT, ser. Lecture
Notes in Computer Science Volume 1070, 1996, pp. 387398.
[8] D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM, vol. 24,
no. 2, pp. 8488, February 1981
[9]The dinning cryptographer problem: Unconditional sender and recipient untraceability, Journal of Cryptology, vol. 1, no. 1,
pp. 6575, 1988.
[10] A. Pfitzmann and M. Waidner, Networks without user observability design options. in Advances in Cryptology -
EUROCRYPT, ser. Lecture Notes in Computer Science Volume 219, 1985, pp. 245253.
_______________________________________________________________________________________
Special Issue | June-2014, Available @http://www.ijretm.com| Paper id - IJRETM-2014-SP-041 7