This document proposes an efficient message authentication scheme for wireless sensor networks based on elliptic curve cryptography (ECC). It discusses the limitations of existing symmetric-key and polynomial-based authentication schemes, such as vulnerability to node compromise and threshold limitations. The proposed scheme generates a source anonymous message authentication code (SAMAC) using a modified ElGamal signature scheme on elliptic curves. This provides unconditional source anonymity, efficient hop-by-hop authentication without threshold limitations, and resilience against node compromise attacks. The scheme aims to authenticate messages with low computational and communication overhead suitable for resource-constrained wireless sensor networks.
An Encrypted MAC for the Authentication Process in WSNIJMTST Journal
Security infringement and energy consumption issues are vital in WSN (wireless sensor networks). Looking at the attacks like Denial-of-Sleep, Man-in-the-Middle, Correlation attack, etc, are affecting the transfer of any data. It might be the data loss or the modification where in the third party access the information to one self. This paper explains how to authenticate the data transfer using the encryption standards in MAC algorithm in a riskless technique.
An Encrypted MAC for the Authentication Process in WSNIJMTST Journal
Security infringement and energy consumption issues are vital in WSN (wireless sensor networks). Looking at the attacks like Denial-of-Sleep, Man-in-the-Middle, Correlation attack, etc, are affecting the transfer of any data. It might be the data loss or the modification where in the third party access the information to one self. This paper explains how to authenticate the data transfer using the encryption standards in MAC algorithm in a riskless technique.
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
Wireless sensor network promises ubiquitous data
collection and processing for variety of commercial, healthcare
and military applications. Practical realization of WSN
applications is possible only after assuring network security.
Cryptographic key distribution is an important phase in
network security which establishes initial trust in the network.
Security protocol implementation in WSN is limited by
resource constrained nature of sensor nodes. The key
distribution algorithm satisfying security requirements of
given WSN application should be implemented with minimum
communication and memory overhead. As a solution to this
problem, hierarchical key management technique is proposed
in this paper. Symmetric key pre-distribution technique with
less computational overhead and ID-based asymmetric key
(IBK) distribution technique with less communication
overhead are applied simultaneously in the network at
different levels. Resilience strength and resource overhead of
the proposed scheme is compared with both symmetric and
asymmetric techniques.
Random Key Pre-distribution Schemes using Multi-Path in Wireless Sensor Networksijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
SECURED TEXT MESSAGE TRANSMISSION IN A WIRELESS COMMUNICATION SYSTEM WITH THE...caijjournal
A broad variety of wireless data applications and services depend on security. This paper presents a
simulation-based study of a wireless communication system using a secured Vigenere cipher and the RSA
cryptographic algorithms on text message transmission. The system under consideration uses 1/2-rated
CRC channel coding and BPSK digital modulation over an Additive White Gaussian noise (AWGN)
channel. To address security concerns, a text message is encrypted at the transmitter with the Vigenere
cipher and RSA before being decrypted and compared for different levels of SNR at the receiver end. To
carry out the computer simulation, the Matlab 2016a programming language has been used. The
transmitted text message is successfully retrieved at the receiver end after the Vigenere cipher and the RSA
cryptographic algorithm are implemented. It is also anticipated that as noise power increases, the
effectiveness of a wireless communication system based on the Vigenere cipher and RSA security will
decrease.
A key management approach for wireless sensor networksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
Network coding combined with onion routing for anonymous and secure communica...IJCNCJournal
This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh
Network (WMN). We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN. An added superior feature provides higher level of security and privacy. Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial. The only routing information divulged to a relay node is about next hop. No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete
routing information,hence losing privacy and anonymity. We compare our scheme with other existing approach for several networks. The preliminary results show this work to provide superior security and anonymity at low overhead cost.
ANALYSIS OF THE SECURITY OF BB84 BY MODEL CHECKINGIJNSA Journal
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was noted that quantum computers could break public key cryptosystems based on number theory extensive studies have been undertaken on QKD. Based on quantum mechanics, QKD offers unconditionally secure communication. Now, the progress of research in this field allows the anticipation of QKD to be available outside of laboratories within the next few years. Efforts are made to improve the performance and reliability of the implemented technologies. But several challenges remain despite this big progress. The task of how to test the apparatuses of QKD For example did not yet receive enough attention. These devises become complex and demand a big verification effort. In this paper we are interested in an approach based on the technique of probabilistic model checking for studying quantum information. Precisely, we use the PRISM tool to analyze the security of BB84 protocol and we are focused on the specific security property
of eavesdropping detection. We show that this property is affected by the parameters of quantum channel and the power of eavesdropper.
Enhancing the Security in WSN using Three Tier Security ArchitectureAM Publications,India
Security is the main issue while setting up the WSN network for node communication. This report describes the efficient mechanism for achieving the security between node communications by creating three tier security architecture. This system implements three tier architecture with the use of two polynomial pools having sensor nodes, mobile sinks and some access points that are also sensor nodes, to get better security. Two pools are common mobile polynomial pool and common static polynomial pool. Mobile sinks and access point carries keys from common mobile polynomial pool were as, access points and sensor nodes carries keys from common static polynomial pool. Communication gets established from mobile sink to access point then from access point to sensor node that shows three tier architecture Authentication is the main aspect of the system, that is achieved by pairwise key predistribution methods and authentication of the nodes with the use of polynomial keys. Here, Mobile sink replication attack is implemented against the network. The malicious node, it is blocked. If it wants to communicate within the network then it needs to capture large no of keys from both the pools for authentication. But as the sufficient keys are not available with it, it cannot communicate with the other nodes in the network
An Efficient privacy preserving for Mobile and Pervasive Computinginventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
ATMC: Anonymity and Trust Management Scheme Applied to Clustered Wireless Sen...IDES Editor
Wireless Sensor Networks consists of sensor nodes
that are capable of sensing the information and maintaining
security. In this paper, an Anonymity and Trust Management
Scheme applied to Clustered Wireless Sensor Networks
(ATMC) is proposed which enhances the security level. It also
provides a stable path for communication. It is observed that
the performance of the network is better than existing schemes
through simulation
Hop- by- Hop Message Authentication and Wormhole Detection Mechanism in Wirel...Editor IJCATR
One of the most effective way to prevent unauthorized and corrupted message from being forward in wireless sensor
network. So to restrict these problems many authentication schemes have been developed based on symmetric key cryptosystem. But
there is high computational and communication overhead in addition to lack of scalability and resilience to node compromise attacks.
So to address these isuues polynomial based scheme[1] was introduced. But in these methods it having the threshold problem that
means to send the limited message only because to send larger number of message means the attacker can fully recover. So in my
existing system a scalable message authentication scheme based on elliptic curve cryptography. This scheme allows any node to
transmit an unlimited number of messages without suffering the threshold problem. But these method only detect the black hole and
grey hole attacks are dected but does not detect the worm hole attack. In my proposed system to detect the worm hole attack. Worm
hole attack is one of the harmful attack to which degrade the network performance. So, in the proposed system, one innovative
technique is introduced which is called an efficient wormhole detection mechanism in the wireless sensor networks. In this method,
considers the RTT between two successive nodes and those nodes‟ neighbor number which is needed to compare those values of other
successive nodes. The identification of wormhole attacks is based on the two faces. The first consideration is that the transmission time
between two wormhole attack affected nodes is considerable higher than that between two normal neighbor nodes. The second
detection mechanism is based on the fact that by introducing new links into the network, the adversary increases the number of
neighbors of the nodes within its radius. An experimental result shows that the proposed method achieves high network performance..
A Secure message exchange and anti-jamming mechanism in manetIJSRD
Secure neighbor discovery is the fundamental process in the MANET deployed in aggressive environment. It refers to the process that nodes exchange messages to discover and authenticate each other. It is defenseless to the jamming attack in which the adversary intentionally transmits signals to prevent neighboring nodes from exchanging messages. Existing anti-jamming communications depends on JR-SND. The JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on Random spread-code pre-distribution and Direct Sequence Spread Spectrum (DSSS). In Existing, they prevent the jamming and introduce the anti-jamming mechanism using DSSS introduce the secure message exchange mechanism and prevent the collisions during packet transmission. But in this we lack of introducing to detect the selfish and malicious nodes in the network. For this, in the Future Work we will enhance the work by detecting the selfish nodes using Watchdog and Neighbor Coverage-based Probabilistic Rebroadcast Protocol (NCPR).
Detection of Various Attacks using Zero Knowledge Protocol in Wireless Securityijceronline
The security mechanism are not used directly in wireless sensor networks compare to wired networks, there is no user control and insufficient energy resources. In wireless environment, proposing the scheme of detection of distributed sensor cloning attacks and Zero knowledge protocols (ZKP) are used to verifying authenticity of the sender sensor nodes. Cloning attack is concentrate on by attaching fingerprint which is unique that depends on the set of neighboring nodes and itself. Every message contains a finger print which sensor node sends.ZKP is used to avoid man in the middle attack and reply attacks from the important cryptographic information in wireless networks.
Efficient security approaches in mobile ad hoc networks a surveyeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
JPN1408 Hop-by-Hop Message Authentication and Source Privacy in Wireless Sen...chennaijp
Get the latest IEEE ns2 projects in JP INFOTECH; we are having following category wise projects like Industrial Informatics, Vehicular Technology, Networking, WSN and Manet.
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/ns2-projects/
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
Wireless sensor network promises ubiquitous data
collection and processing for variety of commercial, healthcare
and military applications. Practical realization of WSN
applications is possible only after assuring network security.
Cryptographic key distribution is an important phase in
network security which establishes initial trust in the network.
Security protocol implementation in WSN is limited by
resource constrained nature of sensor nodes. The key
distribution algorithm satisfying security requirements of
given WSN application should be implemented with minimum
communication and memory overhead. As a solution to this
problem, hierarchical key management technique is proposed
in this paper. Symmetric key pre-distribution technique with
less computational overhead and ID-based asymmetric key
(IBK) distribution technique with less communication
overhead are applied simultaneously in the network at
different levels. Resilience strength and resource overhead of
the proposed scheme is compared with both symmetric and
asymmetric techniques.
Random Key Pre-distribution Schemes using Multi-Path in Wireless Sensor Networksijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
SECURED TEXT MESSAGE TRANSMISSION IN A WIRELESS COMMUNICATION SYSTEM WITH THE...caijjournal
A broad variety of wireless data applications and services depend on security. This paper presents a
simulation-based study of a wireless communication system using a secured Vigenere cipher and the RSA
cryptographic algorithms on text message transmission. The system under consideration uses 1/2-rated
CRC channel coding and BPSK digital modulation over an Additive White Gaussian noise (AWGN)
channel. To address security concerns, a text message is encrypted at the transmitter with the Vigenere
cipher and RSA before being decrypted and compared for different levels of SNR at the receiver end. To
carry out the computer simulation, the Matlab 2016a programming language has been used. The
transmitted text message is successfully retrieved at the receiver end after the Vigenere cipher and the RSA
cryptographic algorithm are implemented. It is also anticipated that as noise power increases, the
effectiveness of a wireless communication system based on the Vigenere cipher and RSA security will
decrease.
A key management approach for wireless sensor networksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
Network coding combined with onion routing for anonymous and secure communica...IJCNCJournal
This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh
Network (WMN). We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN. An added superior feature provides higher level of security and privacy. Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial. The only routing information divulged to a relay node is about next hop. No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete
routing information,hence losing privacy and anonymity. We compare our scheme with other existing approach for several networks. The preliminary results show this work to provide superior security and anonymity at low overhead cost.
ANALYSIS OF THE SECURITY OF BB84 BY MODEL CHECKINGIJNSA Journal
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was noted that quantum computers could break public key cryptosystems based on number theory extensive studies have been undertaken on QKD. Based on quantum mechanics, QKD offers unconditionally secure communication. Now, the progress of research in this field allows the anticipation of QKD to be available outside of laboratories within the next few years. Efforts are made to improve the performance and reliability of the implemented technologies. But several challenges remain despite this big progress. The task of how to test the apparatuses of QKD For example did not yet receive enough attention. These devises become complex and demand a big verification effort. In this paper we are interested in an approach based on the technique of probabilistic model checking for studying quantum information. Precisely, we use the PRISM tool to analyze the security of BB84 protocol and we are focused on the specific security property
of eavesdropping detection. We show that this property is affected by the parameters of quantum channel and the power of eavesdropper.
Enhancing the Security in WSN using Three Tier Security ArchitectureAM Publications,India
Security is the main issue while setting up the WSN network for node communication. This report describes the efficient mechanism for achieving the security between node communications by creating three tier security architecture. This system implements three tier architecture with the use of two polynomial pools having sensor nodes, mobile sinks and some access points that are also sensor nodes, to get better security. Two pools are common mobile polynomial pool and common static polynomial pool. Mobile sinks and access point carries keys from common mobile polynomial pool were as, access points and sensor nodes carries keys from common static polynomial pool. Communication gets established from mobile sink to access point then from access point to sensor node that shows three tier architecture Authentication is the main aspect of the system, that is achieved by pairwise key predistribution methods and authentication of the nodes with the use of polynomial keys. Here, Mobile sink replication attack is implemented against the network. The malicious node, it is blocked. If it wants to communicate within the network then it needs to capture large no of keys from both the pools for authentication. But as the sufficient keys are not available with it, it cannot communicate with the other nodes in the network
An Efficient privacy preserving for Mobile and Pervasive Computinginventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
ATMC: Anonymity and Trust Management Scheme Applied to Clustered Wireless Sen...IDES Editor
Wireless Sensor Networks consists of sensor nodes
that are capable of sensing the information and maintaining
security. In this paper, an Anonymity and Trust Management
Scheme applied to Clustered Wireless Sensor Networks
(ATMC) is proposed which enhances the security level. It also
provides a stable path for communication. It is observed that
the performance of the network is better than existing schemes
through simulation
Hop- by- Hop Message Authentication and Wormhole Detection Mechanism in Wirel...Editor IJCATR
One of the most effective way to prevent unauthorized and corrupted message from being forward in wireless sensor
network. So to restrict these problems many authentication schemes have been developed based on symmetric key cryptosystem. But
there is high computational and communication overhead in addition to lack of scalability and resilience to node compromise attacks.
So to address these isuues polynomial based scheme[1] was introduced. But in these methods it having the threshold problem that
means to send the limited message only because to send larger number of message means the attacker can fully recover. So in my
existing system a scalable message authentication scheme based on elliptic curve cryptography. This scheme allows any node to
transmit an unlimited number of messages without suffering the threshold problem. But these method only detect the black hole and
grey hole attacks are dected but does not detect the worm hole attack. In my proposed system to detect the worm hole attack. Worm
hole attack is one of the harmful attack to which degrade the network performance. So, in the proposed system, one innovative
technique is introduced which is called an efficient wormhole detection mechanism in the wireless sensor networks. In this method,
considers the RTT between two successive nodes and those nodes‟ neighbor number which is needed to compare those values of other
successive nodes. The identification of wormhole attacks is based on the two faces. The first consideration is that the transmission time
between two wormhole attack affected nodes is considerable higher than that between two normal neighbor nodes. The second
detection mechanism is based on the fact that by introducing new links into the network, the adversary increases the number of
neighbors of the nodes within its radius. An experimental result shows that the proposed method achieves high network performance..
A Secure message exchange and anti-jamming mechanism in manetIJSRD
Secure neighbor discovery is the fundamental process in the MANET deployed in aggressive environment. It refers to the process that nodes exchange messages to discover and authenticate each other. It is defenseless to the jamming attack in which the adversary intentionally transmits signals to prevent neighboring nodes from exchanging messages. Existing anti-jamming communications depends on JR-SND. The JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on Random spread-code pre-distribution and Direct Sequence Spread Spectrum (DSSS). In Existing, they prevent the jamming and introduce the anti-jamming mechanism using DSSS introduce the secure message exchange mechanism and prevent the collisions during packet transmission. But in this we lack of introducing to detect the selfish and malicious nodes in the network. For this, in the Future Work we will enhance the work by detecting the selfish nodes using Watchdog and Neighbor Coverage-based Probabilistic Rebroadcast Protocol (NCPR).
Detection of Various Attacks using Zero Knowledge Protocol in Wireless Securityijceronline
The security mechanism are not used directly in wireless sensor networks compare to wired networks, there is no user control and insufficient energy resources. In wireless environment, proposing the scheme of detection of distributed sensor cloning attacks and Zero knowledge protocols (ZKP) are used to verifying authenticity of the sender sensor nodes. Cloning attack is concentrate on by attaching fingerprint which is unique that depends on the set of neighboring nodes and itself. Every message contains a finger print which sensor node sends.ZKP is used to avoid man in the middle attack and reply attacks from the important cryptographic information in wireless networks.
Efficient security approaches in mobile ad hoc networks a surveyeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
JPN1408 Hop-by-Hop Message Authentication and Source Privacy in Wireless Sen...chennaijp
Get the latest IEEE ns2 projects in JP INFOTECH; we are having following category wise projects like Industrial Informatics, Vehicular Technology, Networking, WSN and Manet.
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/ns2-projects/
Security in Wireless Sensor Networks Using BroadcastingIJMER
Wireless sensor networks as one of the growing technology in the coming decades has posed various unique challenges to researchers. A WSN typically consists of several base stations and thousands of sensor nodes, which are resource limited devices with low processing, energy, and storage capabilities.While the set of challenges in sensor networks are diverse, we focus on security of Wireless Sensor Network in this paper. As today’s world is growing more towards the Wireless technology, our aim must be towards providing the best security features to Wireless Sensor Network( WSN).We propose some of the security requirements for Wireless Sensor Network. Further, security being vital to the acceptance and use of sensor networks for many applications. We propose an efficient broadcast authentication scheme for wireless sensor networks in this paper.
A Key Management Approach For Wireless Sensor NetworksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
A Key Management Approach For Wireless Sensor NetworksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
Implementation of New Routing Protocol for Node Security in a Mobile Ad Hoc N...CSCJournals
A routing protocol plays important role to handle entire network for communication and determines the paths of packets. A node is a part of the defined network for transferring information in form of packets. If all packets transferred from source to destination successfully, it has been assumed that the routing protocol is good. But, an attacker turns this dealing as a speed breaker and turning point of a highway. So, prevention from attacks and secure packets, a new routing protocol is being introduced in this paper. The proposed routing protocol is called by SNAODV (Secure Node AODV). This paper is also tried to maximize throughput as compared with AODV and SAODV.
Data Transfer Security solution for Wireless Sensor NetworkEditor IJCATR
WSN is a wide growth area for specific resource limited application. Factor associated with technology like, the encryption
security, operating speed and power consumption for network. Here, we introduce a mechanism for secure transferring of data is WSN
and various security related issues. This energy-efficient encryption is a secure communication framework in which an algorithm is
used to encode the sensed data using like, RC5, AES and CAST Algorithm. The proposed scheme is most suitable for wireless sensor
networks that incorporate data centric routing protocols. An algorithm in sensor network is help to designers predict security
performance under a set of constraints for WSNs. This symmetric key function is used to guarantee secure communications between
in-network nodes and reliable operation cost. RC5 is good on the code point of view, but the key schedule consumes more resource
time for efficient security aspects.
However, the problem of authentication and pairwise key
establishment in sensor networks with MSs is still not solved
in the face of mobile sink replication attacks. For the basic
probabilistic [12] and q-composite [13] key predistribution
schemes, an attacker can easily obtain a large number of keys
by capturing a small fraction of the network sensor nodes,
making it possible for the attacker to take control of the
entire network by deploying a replicated mobile sink,
preloaded with some compromised keys to authenticate
and then initiate data communication with any sensor node.
Secure key exchange and encryption mechanism for group communication in wirel...graphhoc
Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active interfering. The lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. Nodes act both as hosts and routers and are interconnected by Multi- hop communication path for forwarding and receiving packets to/from other nodes. The objective of this paper is to propose a key exchange and encryption mechanism that aims to use the MAC address as an additional parameter as the message specific key[to encrypt]and forward data among the nodes. The nodes are organized in spanning tree fashion, as they avoid forming cycles and exchange of key occurs only with authenticated neighbors in ad hoc networks, where nodes join or leave the network dynamically.
Message Authentication And Source Privacy Using BAC Technique In Wireless Sen...theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Effective Key Management in Dynamic Wireless Sensor NetworksvishnuRajan20
Manikandan P
Tue, Aug 14, 4:50 PM (9 days ago)
to me
At Softroniics we provide job oriented training for freshers in IT sector. We are providing IEEE project guidance and Final year project guidance. We are Pioneers in all leading technologies like Android, Java, .NET, PHP, Python, Embedded Systems, Matlab, NS2, VLSI, Modelsim, Tanner, Xilinx etc. We are specializiling in technologies like Big Data, Cloud Computing, Internet Of Things (iOT), Data Mining, Networking, Information Security, Image Processing and many other. We are providing long term and short term internship also. We are also providing IEEE project support at Calicut, Thrissur and Palakkad. For more details contact 9037291113, 7907435072
AN ANTI-CLONE ATTACK KEY MANAGEMENT SCHEME FOR WIRELESS SENSOR NETWORKScsandit
Wireless Sensor Networks (WSNs) are subject to various kinds of attacks such as replaying of
messages, battery exhausting, and nodes compromising. While most of these attacks can be
dealt with through cryptographic security protocols provided by key management schemes,
there are always a few that manage to really cause problems. One such attack that is most
common and significant in WSNs is cloning attack. In clone attack, the intruder tries to capture
and compromise some nodes and inject them into several locations throughout the network in
order to conduct other types of attacks. Moreover, if this attack is not detected early, then these
replicated injected nodes will consume a large amount of the network resources. In this paper,
we analyze several key management schemes that can be used for checking integrity and
preventing cloning attacks. After analyzing the problems associated with these schemes, we
propose a model that allows us to distinguish between legitimate nodes and cloned nodes in
such sensor networks.
Key Establishment using Selective Repeat Automatic Repeat Request Mechanism f...ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
2.espk external agent authentication and session key establishment using publ...EditorJST
Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed and deployed in a un attend environment, these are vulnerable to numerous security threats. In this paper, describe the design and implementation of public-key-(PK)-based protocols that allow authentication and session key establishment between a sensor network and a third party. WSN have limitations on computational capacity, battery etc which provides scope for challenging problems. We fundamentally focused on the security issue of WSNs The proposed protocol is efficient and secure in compared to other public key based protocols in WSNs.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
1. Message authentication and security schemes based on
ECC in wireless sensor network
Abstract
Message authentication is one of the most efficient ways to prevent unauthorized and corrupted
messages from being forwarded in wireless sensor networks (WSNs). That's why, several message
authentication proposals have been developed, based on either symmetric-key cryptosystems or public-
key cryptosystems. Most of them, however, have the restrictions of high computational and
communication overhead in addition to lack of scalability and resilience to node compromise attacks.
Wireless Sensor Networks are being very popular day by day, however one of the main concern in WSN
is its limited resources. One have to look to the resources to generate Message Authentication Code
(MAC) keeping in mind the feasibility of method used for the sensor network at hand. This paper
investigates different cryptographic approaches such as symmetric key cryptography and asymmetric key
cryptography. To provide this service, a polynomial-based scheme was recently introduced, this scheme
and its extensions all have the weakness of a built-in threshold determined by the degree of the
polynomial. In this paper, we propose a scalable authentication scheme based optimal Modified
ElGamal signature (MES) scheme on elliptic curves cryptography
I. INTRODUCTION
Message authentication [1] performs a very important role in thwarting unauthorized and corrupted
messages from being delivered in networks to save the valuable sensor energy. Therefore, many
authentication schemes have been proposed in literature to offer message authenticity and integrity
verification for wireless sensor networks (WSNs) [ 4, 12, 13 ]. These approaches can largely be separated
into two categories: public-key based approaches and symmetric-key based approaches.
The symmetric-key [2] based approach necessitates composite key management, lacks of
scalability, and is not flexible to large numbers of node compromise attacks since the message sender and
the receiver have to share a secret key. The shared key is handled by the sender to produce a message
authentication code (MAC) for each transmitted message. However, for this process the authenticity and
integrity of the message can only be confirmed by the node with the shared secret key, which is usually
shared by a group of sensor nodes. An intruder can compromise the key by incarcerating a single sensor
2. node. In addition, this method is not useful in multicast networks. To solve the scalability problem, a
secret polynomial based message authentication scheme was introduced.[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. when
the number of messages transmitted is larger than the threshold, the polynomial can be fully
recovered and the system is completely broken. An alternative solution was proposed in to
thwart the intruder from recovering the polynomial by computing the coefficients of the
polynomial. The idea is to add a random noise, also called a perturbation factor, to the
polynomial so that the coefficients of the polynomial cannot be easily solved. The random noise
can be completely removed from the polynomial using error correcting code techniques.[5]
For the public-key based method, each message is transmitted along with the digital signature of
the message produced using the sender’s private key. Every intermediate forwarder and the final receiver
can authenticate the message using the sender’s public key [10], [11]. One of the restrictions of the public
key based method is the high computational overhead. The recent progress on elliptic curve
cryptography (ECC) shows that the public-key schemes can be more advantageous in terms of
computational complexity, memory usage, and security resilience, since public-key based
approaches have a simple and clean key management. In this project, an unconditionally secure
and efficient source anonymous message authentication (SAMA) scheme based on the optimal
Modified ElGamal signature (MES) scheme on elliptic curves. This MES scheme is secure
against adaptive chosen-message attacks in the random oracle model.[6]
MES scheme enables the intermediate nodes to authenticate the message so that all
corrupted message can be detected and dropped to conserve the sensor power. While achieving
compromise resiliency, flexible-time authentication and source identity protection this scheme
does not have the threshold problem. Both theoretical analysis and simulation results
demonstrate that the proposed scheme is more efficient than the polynomial-based algorithms
under comparable security levels.
The principal attraction of ECC, compared to RSA, is that it appears to offer equal
security for a far smaller key size, thereby reducing processing overhead. ECC is a method of
3. encoding data files so that only specific individuals can decode them. ECC based on
mathematics of elliptic curves and uses the location of points on an elliptic curve to encrypt and
decrypt information. The main advantage of ECC over RSA is particularly important in wireless
devices, where computing power, memory and battery life are limited. ECC is having good
potential for wireless sensor networks security due to its smaller key size and its high strength of
security. ECC is a public key cryptosystem.
1.1 GOAL
The following function provides hop by hop message authentication and source privacy
in wireless sensor networks.
• To develop a source anonymous message authentication code (SAMAC) on elliptic
curves that can provide unconditional source anonymity.
• It offers an efficient hop-by-hop message authentication mechanism for WSNs
without the threshold limitation.
• It provides network implementation criteria on source node privacy protection in
WSNs.
• To propose an efficient key management framework to ensure isolation of the
compromised nodes.
• It provides an extensive simulation results under ns-2 on multiple security levels.
MES scheme provides hop-by-hop node authentication without the threshold limitation,
and has performance better than the symmetric-key based schemes. The distributed nature of
algorithm makes the scheme suitable for decentralized networks.
1.2 PROBLEM DEFINITION
Message authentication is one of the most effective ways to thwart unauthorized and
corrupted messages from being forwarded in wireless sensor networks (WSNs). Most of them
have the limitations of high computational and communication overhead in addition to lack of
scalability and resilience to node compromise attacks. An intruder can compromise the key by
capturing a single sensor node. In addition, symmetric key based method does not work in
multicast networks. The intermediate node can verify the authenticity of message through
4. polynomial evaluation. In polynomial based scheme, when the number of messages transmitted
is larger than the threshold the adversary can fully recover the polynomial.
II. TERMINOLOGY AND PRELIMINARY
This section briefly describes the terminology and the cryptographic tools.
A. Thread Model and Assumptions
The wireless sensor networks are implicit to consist of a huge number of sensor nodes. It is assumed that
each sensor node recognizes its relative location in the sensor domain and is competent of communicating
with its neighboring nodes directly using geographic routing. The entire network is fully connected
through multi-hop communications. It is assumed that there is a security server (SS) that is liable for
generation, storage and distribution of the security parameters among the network. This server will by no
means be compromised. However, after deployment, the sensor nodes may be compromised and captured
by attackers. Once compromised, all data stored in the sensor nodes can be obtained by the attackers. The
compromised nodes can be reprogrammed and completely managed by the attackers.
However, the compromised nodes will be unable to produce new public keys that can be accepted by the
SS and other nodes. Two types of possible attacks launched by the adversaries are:
• Passive attacks: By passive attacks, the adversaries could snoop on messages transmitted in the
network and execute traffic analysis.
• Active attacks: Active attacks can only be commenced from the compromised sensor nodes. Once the
sensor nodes are compromised, the adversaries will gain all the data stored in the compromised nodes,
including the security parameters of the compromised nodes. The adversaries can alter the contents of the
messages, and introduce their own messages.
An authentication protocol should be resistant to node compromise by allowing secure key management.
The protocol may provide an integrated key-rotation mechanism or allow for key rotation by an external
module.
2.2 Design Goals
Our proposed authentication scheme aims at achieving the following goals:
Message authentication. The message receiver should be able to verify whether a received
message is sent by the node that is claimed, or by a node in a particular group. In other
5. words, the adversaries cannot pretend to be an innocent node and inject fake messages into
the network without being detected.
Message integrity. The message receiver should be able to verify whether the message has
been modified en-route by the adversaries. In other words, the adversaries cannot modify
the message content without being detected.
Hop-by-hop message authentication. Every forwarder on the routing path should be
able to verify the authenticity and integrity of the messages upon reception.
Identity and location privacy. The adversaries cannot determine the message sender’s ID
and location by analyzing the message contents or the local traffic.
Node compromise resilience. The scheme should be resilient to node compromise attacks.
No matter how many nodes are compromised, the remaining nodes can still be secure.
Efficiency. The scheme should be efficient in terms of both computational and
communication overhead.
2.3 Terminology
Privacy is sometimes referred to as anonymity. Communication anonymity in information management
has been discussed in a number of previous works [14][15][16][17][18][19]. It generally refers to the state
of being unidentifiable within a set of subjects. This set is called the AS. Sender anonymity means that a
particular message is not linkable to any sender, and no message is linkable to a particular sender.
We will start with the definition of the unconditionally secure SAMA.
Definition 1 (SAMA). A SAMA consists of the following two algorithms:
• Generate (m; Q1; Q2; .. . ; Qn ). Given a message m and the public keys Q1, Q2………. Qn
of the AS.S = {A1,A2,…….An}, the actual message sender At, 1< t < n, produces and anonymous
message S (m) using its own private key dt .
• Verify S(m). Given a message m and an nonymous message S (m), which includes the public
keys of all members in the AS, a verifier can determine whether S (m) is generated by a member
in the AS.
The security requirement for SAMA include:
• Sender ambiguity. The probability that a verifier successfully determine the real sender of the
anonymous message is exactly 1/n, where n is the total number of member in the AS.
6. • Unforgeability. An anonymous message scheme is unforgeable if no adversary, given the public
keys of all members of the AS and the anonymous messages m1,m2.......mn adaptively chosen by
the adversary, can produce in polynomial time a new valid anonymous message with non –
negligible probability.
In this paper, the user ID and the user public key will be used interchangeably without making and
distinctions.
II.4 Modified ElGamal Signature Scheme
Definition 2 (MES). The modified ElGamal signature scheme [8] consists of the following three
algorithms:
Key generation algorithm. Let be a large prime and g be a generator of ZZp*,. Boath p and g are
made public. For a random private key ZZp, the public key y is computed from y =gx
mod p.
Signature algorithm. The MES can also have many variants [20],[21]. For the purpose of efficiency,
we will describe the variant, called optimal scheme. To sign a message m, one chooses a random k ZZp-
1,then computes the exponentiation r=gk
mod p and solves s from :
S =rxh (m ,r) + k mod (p-1),
Where is a one-way hash function. The signature of message m is defined as the pair (r,s).
Verification algorithm. The verifier checks whether the signature equation gs
= ry rh(m,r)
mod p. If the
equality holds true, then the verifier Accepts the signature, and rejects otherwise.
III .RELATED WORK
Message authentication are used in different applications and security is one of the key characteristic of
all the applications for that, many authors proposed different kinds of security algorithms like symmetric
key algorithm and public key algorithm. Both passive and active attacks are discussed in that algorithms
and also recovery mechanisms are shown in simulation. The advantages and disadvantages of such
algorithms are discussed below.
3.1. STATISTICAL ENROUTE FILTERING
7. Statistical En-route Filtering (SEF) mechanism detects and drops false reports. SEF requires each sensing
report must be validated by multiple keyed message authentication codes (MACs), each generated
message by a node that detects the same event. As the report is forwarded, each node verifies the
correctness of the MACs probabilistically and drops those invalid MACs at earliest points. The sink
filters out remaining false reports that escape the enroute filtering. SEF exploits to determine the
truthfulness of each report through collective decision-making by multiple detecting nodes and collective
false-report-detection by multiple forwarding. The limitation it fails to detect malicious misbehaviors
with the presence of the following disadvantages like ambiguous collisions, receiver collisions, limited
transmission power, false misbehavior report, collision and partial dropping.
3.2.SECRET POLYNOMIAL MESSAGE AUTHENTICATION
A secret polynomial based message authentication scheme was introduced to prevent message form
adversaries. This scheme offers security with ideas similar to a threshold secret sharing, where the
threshold is determined by the degree of the polynomial. If the number of messages transmitted is below
the threshold, then the intermediate node to verify the authenticity of the message through polynomial
evaluation. When the number of messages transmitted is larger than the threshold, the polynomial be fully
recovered by adversary and the system is broken completely. To increase the threshold for the intruder to
reconstruct the secret polynomial, a random noise, also called a perturbation factor, was added to the
polynomial to prevent the adversary from computing the coefficient of the polynomial.
IV.PROPOSED WORK
4.1 PROPOSED SYSTEM
In the proposed system an unconditionally secure and efficient source anonymous message
authentication scheme was introduced. The main idea is that for each message 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 this scheme, the entire SAMA generation requires only three steps, which link all non-
senders and the message sender to the SAMA alike. In addition, design enables the SAMA to be
verified through a single equation without individually verifying the signatures.
SYSTEM MODEL
8. Fig.3.1. System Architecture
The figure 3.1 gives the overall architecture of a system in which the user enters the
network and request for the service. The wireless sensor network consists of a large number of
sensor nodes. Sensor node knows its relative location in the sensor domain and is capable of
communicating with its neighboring nodes directly using geographic routing.
The whole network is fully connected through multi-hop communications. An inquiry
node register the information, after registration the registration node will continue the login
process. Security server is responsible for generation and storage and distribution of security
parameters among the network. This server will never be compromised. After deployment the
sensor nodes may be captured and compromised by attackers.
The compromised node will not be able to create new public keys. For each message m
to be released, the message sender, or the sending node, generates a source anonymous message
authenticator for the message m using its own private key.
9. This is the improved form of SAMA it generates a source anonymous message authenticator for the
message. The generation is based on MES scheme on elliptic curves. SAMA generation requires three
steps, which link all non-senders and the message sender to the SAMA. SAMA is verified through a
single equation without individually verifying the signatures.
4.2 Proposed MES Scheme on Elliptic Curves
The design of the proposed SAMA relies on the ElGamal signature scheme. Signature schemes
can achieve at different levels of security. Security against existential forgery under adaptive-
chosen message attacks is the maximum level of security.
The appropriate selection of an AS plays a key role in message source privacy, since the actual
message source node will be hidden in the AS. The Techniques used to prevent the adversaries
from tracking the message source through the AS analysis in combination with local traffic
analysis. Before a message is transmitted, the message source node selects an AS from the public
key list in the SS as its choice. This set should include itself, together with some other nodes.
When an adversary receives a message, find the direction of the previous hop, or even the real
node of the previous hop. The adversary is unable to distinguish whether the previous node is the
actual source node or simply a forwarder node if the adversary is unable to monitor the traffic of
the previous hop. Therefore, the selection of the AS should create sufficient diversity so that it is
infeasible for the adversary to find the message source based on the selection of the AS itself.
SAMA techniques does not have the threshold problem. Unlimited number of messages are
authenticated. SAMA is a secure and efficient mechanism. Generates a source anonymous
message authenticator for the message m. The message generation is based on the MES
scheme on elliptic curves. An elliptic curve E is defined by an equation of the form:
E : y²=x³ +ax + b mod p;
1. Considering a base point elliptic curve.
2. Assuming the private key of sender node.
3. Calculate public key of sender.
4. The message is to be hashed and left bit of hash functions are converting into binary
format.
10. 5. Finding the signature of message.
B. Modified ElGamal Signature Scheme
Authentication generation algorithm:
Sender node is send the message to be transmitted to receiver node. (SAMA):
A SAMA consists of the following these steps:
1. Receiver node receiving the hashed message.
2. Left most bit of the hash is taken in decimal format.
3. If it receives same key means allow to transform and access that message.
4.3 Key Management and Compromised Node Detection
SS responsibilities include public-key storage and distribution in the WSNs .SS will never be
compromised. After deployment, the sensor node may be captured and compromised by the
attackers. Once compromised, all information stored in the sensor node will be accessible to the
attackers. The compromised node will not be able to create new public keys that can be accepted
by the SS. For efficiency, each public key will have a short identity. The length of the identity is
based on the scale of the WSNs
Advantages
• Message authentication: The message receiver should be able to verify whether a received
message is sent by the node that is claimed or by a node in a particular group. In other words, the
adversaries cannot pretend to be an innocent node and inject fake messages into the network
without being detected.
• Message integrity: The message receiver should be able to verify whether the message has been
modified en-route by the adversaries. In other words, the adversaries cannot modify the message
content without being detected.
• Hop-by-hop message authentication: Every forwarder on the routing path should be able to
verify the authenticity and integrity of the messages upon reception.
• Identity and location privacy: The adversaries cannot determine the message sender’s ID and
location by analyzing the message contents or the local traffic.
11. • Node compromise resilience: The scheme should be resilient to node compromise attacks. No
matter how many nodes are compromised, the remaining nodes can still be secure.
• Efficiency: The scheme should be efficient in terms of both computational and communication
overhead.
V. SYSTEM IMPLEMENTATION
5.1MODULES
The System can be designed using the following modules,
• Node Deployment.
• Source Anonymous Message Authentication (SAMA).
• Modified EIGamal Signature (MES).
• Compromised Node Detection.
5.1.1 NODE DEPLOYMENT
An inquiry node register the information, after registration the registration node will
continue the login process.
Fig 7.1.1 Node Deployment
Inquiry node Registration
Process
Registered
Node
Login
12. 5.1.2 SOURCE ANONYMOUS MESSAGE AUTHENTICATION
For each message m to be released, the message sender, or the sending node, generates a
source anonymous message authenticator for the message m using its own private key.
msg msg msg
msg
Fig 7.1.2 Source Anonymous Message Authentication
5.1.3 MODIFIED ELGAMAL SIGNATURE
The optimal Modified ElGamal signature (MES) scheme on elliptic curves generate
signature dynamically then it provide intermediate nodes to authenticate the message so that all
corrupted message can be detected.
Fig 7.1.3 Modified Elgamal Signature
5.1.4 COMPROMISED NODE DETECTION
Sensor information will be delivered to a sink node, which can be co-located with the
Security Server (SS).when a message is received by the sink node, the message source is hidden
in an Ambiguity Set (AS).when a bad or meaningless message is received by the sink node, the
Source
Neighbor
Neighbor
Neighbor
Destination
Sender Neighbor Neighbor
Information
received
Destination
Verification
Process
13. source node is viewed as compromised. The compromised node will not be able to create new
public keys that can be accepted by the SS
Compromised node
Sign generate
.
Fig 7.1.4 Compromised Node Detection
5.2 MES SCHEME ON ELLIPTIC CURVES
Let p > 3 is an odd prime. An elliptic curve E is defined by an equation of the form: E: y2 = x3 +
ax + b mod p,[7]
Signature generation algorithm
The MES can also have many variants. For the purpose of efficiency, describe the
variant, called optimal scheme.
1. Choose a random k such that 0<k<p-1 and
gcd(k,p-1)=1.
2. Compute r ≡ gk
(mod p).
Sender Neighbor Neighbor
Information
received
Destination
Verification
Process
Attackers
14. 3. Compute S≡ (H(m)-xr)k-1
(mod p-1).
4. If s=0 start over again.
Then the pair(r,s) is the digital signature of m.
The signer repeats these steps for every signature.
Authentication generation algorithm
Suppose m is a message to be transmitted. To generate an efficient SAMA for message
m, Alice performs the following steps:
A signature (r,s) of a message m is verified as follows.
1. 0<r<p and 0<s<p-1.
2. gH(m)
≡ yr
rs
(mod p).
VI. PERFORMANCE EVALUATION
A. Simulation model and parameters
TABLE 1 TABLE 2
PROCESS TIME FOR EXISTING SCHEME PROCESS TIME FOR PROPOSED SCHEME
To evaluate the performance of proposed system, compare it with some existing techniques using
NS-2 Simulator. The bivariate polynomial based scheme is a symmetric key based implementation,
Proposed approach
n=1 n=10
Gen Verify Gen Verify
L=24 0.24 0.53 4.24 2.39
L=32 0.34 0.80 5.99 3.32
L=40 0.46 1.05 8.03 4.44
L=64 1.18 1.77 20.53 11.03
15. while proposed scheme is based on ECC. Assume that the key size to be l for symmetric key
cryptosystem, the key size for proposed should be 2l which is much shorter than the traditional public
key cryptosystem. The simulation parameters are helpful in simulating the proposed system. Table 1
shows the process time for existing scheme and Table 2 shows the process time for proposed scheme.
B. Performance Metrics
Figure 4.1 Packet Delivery Ratio Figure 4.2 Network Overhead
The ECC scheme is compared against polynomial based and it has provided the positive
results. Packet delivery ratio (PDR): PDR defines the ratio of the number of packets received by the
destination node to the number of packets sent by the source node. Routing overhead (RO): RO
defines the ratio of the amount of routing-related transmissions [Route REQuest (RREQ), Route
REPly (RREP), Route ERRor (RERR), ACK, S-ACK, and MRA]. Delay: Delay is the interarrival
time of 1st and 2nd packet to that of total data packets delivered.
C. Results
Enhanced message authentication scheme is evaluated by comparing it with other existing algorithms
using the NS-2 Simulator. Fig 4.1 shows Packet Delivery Ratio of the proposed method over other
existing methods
16. VII. CONCLUSION
Message authentication has always been a major threat to the security in wireless sensor
Networks. A Novel and efficient source anonymous message authentication scheme based on ECC 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. SAMA based on ECC compared it
against other popular mechanisms in different scenarios through simulations and TelosB.
Simulations results indicate that it greatly increases the effort of an attacker, but it requires proper
models for every application. Proposed scheme is more efficient than the bivariate polynomial-based
scheme in terms of computational overhead, energy consumption, delivery ratio, message delay, and
memory consumption.
VIII. REFERENCES
1. Jian Li Yun Li Jian Ren Jie Wu, ―Hop-by-Hop Message Authentication and Source Privacy in Wireless
Sensor Networks , IEEE Transactions On Parallel And Distributed Systems, pp 1-10, 2013‖
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
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 - Crypto’92, ser. Lecture Notes in
Computer Science Volume 740, 1992, pp. 471–486.
4. 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‖
5. M. Albrecht, C. Gentry, S. Halevi, and J. Katz, “Attacking cryptographic schemes based on
”perturbation polynomials”,” Cryptology ePrint Archive, Report 2009/098, 2009.
6. 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. 387–398.
7. D. Pointcheval and J. Stern, “Security arguments for digital signatures and blind signatures,” Journal
of Cryptology, vol. 13, no. 3, pp. 361–396, 2000.
8. D. Pointcheval and J. Stern, “Security Arguments for Digital Sig- natures and Blind Signatures,” J.
Cryptology, vol. 13, no. 3, pp. 361- 396, 2000.
17. 9. R. Rivest, A. Shamir, and L. Adleman, ―A method for obtaining digital signatures and public-key
cryptosystems, Communications. of the Assoc. of Comp. Mach., vol. 21, no. 2, pp. 120–126, 1978.‖
10. T. A. ElGamal, ―A public-key cryptosystem and a signature scheme based on discrete logarithms,‖
IEEE Transactions on Information Theory, vol. 31, no. 4, pp. 469–472, 1985.
11. 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. 11–18.
12. A. Perrig, R. Canetti, J. Tygar, and D. Song, “Efficient authentication and signing of multicast streams
over lossy channels,” in IEEE Symposium on Security and Privacy, May 2000.
13. 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.
14. D. Chaum, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” Comm.
ACM, vol. 24, no. 2, pp. 84-88, Feb. 1981.
15. D. Chaum, “The Dinning Cryptographer Problem: Unconditional Sender and Recipient
Untraceability,” J. Cryptology, vol. 1, no. 1, pp. 65-75, 1988.
16. A. Pfitzmann and M. Hansen, “Anonymity, Unlinkability, Unobservability, Pseudonymity,
and Identity Management a Proposal for Terminology,” http://dud.inf.tu-dresden.de/
literatur/Anon_Terminology_v0.31.pdf, Feb. 2008.
17. A. Pfitzmann and M. Waidner, “Networks without User Observ- ability—Design Options.,” Proc.
Advances in Cryptology (EURO- CRYPT), vol. 219, pp. 245-253, 1985.
18. M. Reiter and A. Rubin, “Crowds: Anonymity for Web Trans- action,” ACM Trans. Information
and System Security, vol. 1, no. 1, pp. 66-92, 1998.
19. M. Waidner, “Unconditional Sender and Recipient Untraceability in Spite of Active Attacks,”
Proc. Advances in Cryptology (EURO- CRYPT), pp. 302-319, 1989.
20. D. Pointcheval and J. Stern, “Security Arguments for Digital Sig- natures and Blind Signatures,” J.
Cryptology, vol. 13, no. 3, pp. 361- 396, 2000.
21. L. Harn and Y. Xu, “Design of Generalized ElGamal Type Digital Signature Schemes Based on
Discrete Logarithm,” Electronics Let- ters, vol. 30, no. 24, pp. 2025-2026, 1994.