This document proposes a source anonymous message authentication scheme for wireless sensor networks that improves upon previous polynomial-based approaches. The proposed scheme uses elliptic curve cryptography to enable hop-by-hop message authentication without the threshold limitation of previous schemes, where the network is compromised once a certain number of messages are transmitted. It aims to provide message authentication, integrity, and source privacy while being efficient and resilient to node compromise attacks. Simulation results demonstrate the scheme has lower computational and communication overhead than polynomial-based approaches under comparable security levels.
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.
This document proposes a new message authentication scheme for wireless sensor networks using modified El-Gamal signature on elliptic curves. It aims to overcome the problems of existing symmetric-key and public-key based authentication schemes, such as key management overhead, threshold problems, and lack of scalability. The proposed scheme provides message authentication between sensor nodes in a hop-by-hop manner and is resilient to node compromise attacks. It uses efficient elliptic curve cryptography to generate digital signatures for authenticating messages sent between nodes with less computational overhead compared to existing public-key schemes. The document describes the detailed algorithms and advantages of the proposed source anonymous message authentication approach based on modified El-Gamal signature on elliptic curves.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
This document provides an overview of network layer attacks on cognitive radio networks and discusses potential solutions. It begins by introducing network security and the importance of securing the network layer. The paper then describes several common network layer attacks, including sinkhole attacks and Sybil attacks. For each attack, the document outlines the attack methodology and discusses existing detection techniques and potential countermeasures. Overall, the paper aims to survey current research on network layer threats, detection methods, and solutions to improve the security of cognitive radio networks.
Hop by hop message authentication chapter 1Selva Raj
This document discusses hop-by-hop message authentication in wireless sensor networks. It discusses how symmetric-key based approaches have key management and scalability issues and how public-key based approaches have high computational overhead. It then summarizes a proposed source anonymous message authentication scheme that provides hop-by-hop node authentication without threshold limitations and has better performance than symmetric-key based schemes. The scheme is based on optimal modified ElGamal signature and provides source anonymity, compromise resilience, and flexible time authentication.
This document summarizes a research paper that proposes a scalable authentication scheme for wireless sensor networks using elliptic curve cryptography. It discusses the need for secure and efficient data transmission in wireless sensor networks. It reviews existing symmetric key-based and public key-based message authentication schemes and identifies their limitations, such as lack of scalability, vulnerability to node compromise, and high computational overhead. The proposed scheme aims to provide message authentication, integrity, and hop-by-hop verification while being resilient to node compromise and efficient in terms of computation and communication.
SECURED TEXT MESSAGE TRANSMISSION IN A WIRELESS COMMUNICATION SYSTEM WITH THE...caijjournal
This document summarizes a research paper that studied secured text message transmission in a wireless communication system using the Vigenere cipher and RSA cryptographic algorithms. The system used CRC channel coding, BPSK modulation over an AWGN channel. A text message was encrypted with Vigenere cipher and RSA before transmission. At the receiver, the encrypted message was decrypted and compared at different SNR levels. The original text message was successfully retrieved at SNRs of 9dB or higher, showing the system performance degraded as SNR decreased. The study concluded the Vigenere cipher and RSA algorithms can securely transmit text messages over wireless channels.
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.
This document proposes a new message authentication scheme for wireless sensor networks using modified El-Gamal signature on elliptic curves. It aims to overcome the problems of existing symmetric-key and public-key based authentication schemes, such as key management overhead, threshold problems, and lack of scalability. The proposed scheme provides message authentication between sensor nodes in a hop-by-hop manner and is resilient to node compromise attacks. It uses efficient elliptic curve cryptography to generate digital signatures for authenticating messages sent between nodes with less computational overhead compared to existing public-key schemes. The document describes the detailed algorithms and advantages of the proposed source anonymous message authentication approach based on modified El-Gamal signature on elliptic curves.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
This document provides an overview of network layer attacks on cognitive radio networks and discusses potential solutions. It begins by introducing network security and the importance of securing the network layer. The paper then describes several common network layer attacks, including sinkhole attacks and Sybil attacks. For each attack, the document outlines the attack methodology and discusses existing detection techniques and potential countermeasures. Overall, the paper aims to survey current research on network layer threats, detection methods, and solutions to improve the security of cognitive radio networks.
Hop by hop message authentication chapter 1Selva Raj
This document discusses hop-by-hop message authentication in wireless sensor networks. It discusses how symmetric-key based approaches have key management and scalability issues and how public-key based approaches have high computational overhead. It then summarizes a proposed source anonymous message authentication scheme that provides hop-by-hop node authentication without threshold limitations and has better performance than symmetric-key based schemes. The scheme is based on optimal modified ElGamal signature and provides source anonymity, compromise resilience, and flexible time authentication.
This document summarizes a research paper that proposes a scalable authentication scheme for wireless sensor networks using elliptic curve cryptography. It discusses the need for secure and efficient data transmission in wireless sensor networks. It reviews existing symmetric key-based and public key-based message authentication schemes and identifies their limitations, such as lack of scalability, vulnerability to node compromise, and high computational overhead. The proposed scheme aims to provide message authentication, integrity, and hop-by-hop verification while being resilient to node compromise and efficient in terms of computation and communication.
SECURED TEXT MESSAGE TRANSMISSION IN A WIRELESS COMMUNICATION SYSTEM WITH THE...caijjournal
This document summarizes a research paper that studied secured text message transmission in a wireless communication system using the Vigenere cipher and RSA cryptographic algorithms. The system used CRC channel coding, BPSK modulation over an AWGN channel. A text message was encrypted with Vigenere cipher and RSA before transmission. At the receiver, the encrypted message was decrypted and compared at different SNR levels. The original text message was successfully retrieved at SNRs of 9dB or higher, showing the system performance degraded as SNR decreased. The study concluded the Vigenere cipher and RSA algorithms can securely transmit text messages over wireless channels.
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.
Survey on Hop-by-Hop Message Authentication and Source Privacy in WSN IRJET Journal
This document summarizes and reviews several existing approaches for message authentication and source privacy in wireless sensor networks (WSNs). It proposes a new flexible authentication scheme based on elliptic curve cryptography that allows nodes to transmit an unlimited number of messages without hitting the threshold limit of previous polynomial-based approaches. Through both theoretical analysis and simulation results, the proposed scheme is shown to be more efficient than polynomial-based methods in terms of computational and communication overhead under the same security levels, while also providing message source anonymity.
Performance analysis of transport layer basedhybrid covert channel detection ...IJNSA Journal
- The document discusses a performance analysis of a transport layer based hybrid covert channel detection engine. A hybrid covert channel combines two or more types of covert channels, such as a simple network covert channel in TCP and a subliminal channel in SSL.
- The authors designed a hybrid covert channel involving a subliminal channel in the Digital Signature Algorithm of SSL and a simple network covert channel manipulating TCP sequence numbers. They also designed a detection engine to analyze TCP packet headers and SSL signature components.
- The detection engine was tested on an experimental test bed with 5 nodes. Testing showed the detection rate varied between 70-97% while detection content was between 15-30%, depending on the number of covert channel invocations.
Detecting Misbehavior Nodes Using Secured Delay Tolerant NetworkIRJET Journal
This document proposes a method called Statistical-based Detection of Blackhole and Greyhole attackers (SDBG) to detect misbehaving nodes in delay tolerant networks. SDBG can detect both individual misbehaving nodes as well as nodes that are colluding together. It works by having each node record encounter data with other nodes, including the number of messages sent and received. Individual nodes that drop many messages can be detected based on having a low message forwarding ratio. Colluding nodes can be detected because they will have sent many messages to each other to fake good behavior. The method aims to accurately detect misbehaving nodes while keeping false positives low. Extensive simulations showed it can work well across different network conditions.
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
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
International Journal of Engineering and Science Invention (IJESI) inventionjournals
This document summarizes a research paper that proposes a scheme to protect the location privacy of source nodes in wireless sensor networks against hotspot-locating attacks. The scheme creates an irregularly shaped "cloud" of fake traffic around the real source node to camouflage its location. Cryptographic techniques are used to change packet appearances at each hop. This prevents packet correlation and makes the source node indistinguishable. Simulations show the scheme provides stronger privacy than routing-based schemes while requiring less energy than global-adversary schemes. The proposed neighbor discovery distance algorithm aims to find the minimum traffic path to efficiently transmit data without loss.
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.
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
Secure and Reliable Data Routing in Wireless Sensor Networkdbpublications
Wireless Sensor Networks (WSNs) are materializing as one of the dominant technologies of the future because of their large range of applications in military and civilian fields. Because of their operating behavior, they are often neglected and thus vulnerable to various types of attacks. For instance, an attacker could catch sensor nodes, getting all the information saved therein-sensor nodes are generally considered to not be temper-proof. Hence, an attacker may clone cached sensor nodes and use them in the network to conduct a variety of mischievous activities. As the decisions taken by a sensor network rely on the information gathered by the sensor nodes, if an adversary inhibits the necessary or confidential data from being forwarded to the BS/ target, this will cause the whole breakdown of the network or outcomes in the wrong judgment being made, possibly causing deliberate loss. There are many types of attacks such as compromised node, denial of service attack, black hole attack, etc. Hence there is a necessity to find all such attacks in WSN, and to safely route our sensitive information to the target. This paper represents the survey of some types of attacks and there detection techniques. Also the survey includes different techniques for secure and reliable data collection in Wireless Sensor Networks.
Ki-Tech Solutions IEEE PROJECTS DEVELOPMENTS WE OFFER IEEE PROJECTS MCA FINAL YEAR STUDENT PROJECTS, ENGINEERING PROJECTS AND TRAINING, PHP PROJECTS, JAVA AND J2EE PROJECTS, ASP.NET PROJECTS, NS2 PROJECTS, MATLAB PROJECTS AND IPT TRAINING IN RAJAPALAYAM, VIRUDHUNAGAR DISTRICTS, AND TAMILNADU. Mail to: kitechsolutions.in@gmail.com
Consensus Routing And Environmental Discrete Trust Based Secure AODV in MANETsIJCNCJournal
The Mobile Adhoc Network (MANET) is a wireless network model for infrastructure-less communication, and it provides numerous applications in different areas. The MANET is vulnerable to a Black-hole attack, and it affects routing functionality by dropping all the incoming packets purposefully. The Black-hole attackers pretend that it always has the best path to the destination node to mislead the source nodes. Trust is the critical factor for detecting and isolating the Black-hole attackers from the network. However, the harsh channel conditions make it difficult to differentiate the Black-hole routing activities and accurate trust measurement. Hence, incorporating the consensus-based trust evidence collection from the neighbouring nodes improves the accuracy of trust. For improving the accuracy of trust, this work suggests Consensus Routing and Environmental DIscrete Trust (CREDIT) Based Secure AODV. The CREDIT incorporates Discrete and Consensus trust information. The Discrete parameters represent the specific characteristics of the Black-hole attacks, such as routing behaviour, hop count deviation, and sequence number deviation. The direct trust accurately differentiates the Black-hole attackers using Discrete parameters, only when the nodes perform sufficient communication between the nodes. To solve such issues, the CREDIT includes the Consensus-based trust information. However, secure routing against the Black-hole attack is challenging due to incomplete preferences. The in-degree centrality and Importance degree measurement on the collected consensus-based trust from decisionmakers solve the incomplete preference issue as well as improves the accuracy of trust. The performance of the proposed scheme is evaluated using Network Simulator-2 (NS2). From the simulation results, it is proved that the detection accuracy and throughput of the proposed CREDIT are substantially high and the proposed CREDIT scheme outperforms the existing work.
Robust encryption algorithm based sht in wireless sensor networksijdpsjournal
In bound applications, the locations
of events reportable by a device network have to be compelled to stay
anonymous. That is, unauthorized observers should be unable to notice the origin of such events by
analyzing the network traffic. I analyze 2 forms of downsides: Communication overhead a
nd machine load
problem. During this paper, I gift a brand new framework for modeling, analyzing, and evaluating
obscurity in device networks. The novelty of the proposed framework is twofold: initial, it introduc
es the
notion of “interval indistinguishabi
lity” and provides a quantitative live to model obscurity in wireless
device networks; second, it maps supply obscurity to the applied mathematics downside I showed that
the
present approaches for coming up with statistically anonymous systems introduce co
rrelation in real
intervals whereas faux area unit unrelated. I show however mapping supply obscurity to consecutive
hypothesis testing with nuisance Parameters ends up in changing the matter of exposing non
-
public supply
data into checking out associate d
egree applicable knowledge transformation that removes or minimize the
impact of the nuisance data victimization sturdy cryptography algorithmic rule. By doing therefore,
I
remodel the matter of analyzing real valued sample points to binary codes, that ope
ns the door for
committal to writing theory to be incorporated into the study of anonymous networks. In existing wor
k,
unable to notice unauthorized observer in network traffic. However our work in the main supported
enhances their supply obscurity against
correlation check. the most goal of supply location privacy is to
cover the existence of real events.
A group key generation algorithm investigates group secret key generation problems for
different types of wireless networks, by exploiting physical layer characteristics of wireless channels. A
new group key generation strategy with low complexity is proposed, which combines the wellestablished
point-to-point pair wise key generation technique, the multisegment scheme, and the onetime
pad. In particular, this group key generation process is studied for three types of communication
networks: 1) A three-node network; 2) A multi node ring network; and 3) A multi node mesh network.
Three group key generation algorithms are developed for these communication networks, respectively.
The analysis8 shows that the first two algorithms yield optimal group key rates, whereas the third
algorithm achieves the optimal multiplexing gain. Next, for the first two types of networks, we address
the time allocation problem in the channel estimation step to maximize the group key rates. This nonconvex
max – min time allocation problem is first reformulated into a series of geometric programming,
and then, a single-condensation method based iterative algorithm is proposed. Numerical results are also
provided to validate the performance of the proposed key generation algorithms and the time allocation
algorithm.
An Efficient Secured And Inspection of Malicious Node Using Double Encryption...IRJET Journal
This document proposes a method called Statistical-based Detection of Black hole and Grey hole attackers (SDBG) to detect both individual and colluding attacks in delay tolerant networks (DTNs). SDBG works by having a trusted authority monitor nodes' behavior based on their encounter records, message records, and forwarding histories. It aims to improve detection accuracy and reduce the impact of false positives compared to existing detection methods. The methodology involves network and authority creation, route finding and data forwarding, and detecting colluding attacks based on monitoring nodes' interactions and messages. Simulation results show SDBG can effectively detect attacks with varying drop rates even under collusion with high accuracy and low false positives.
LSR PROTOCOL BASED ON NODES POTENTIALITY IN TRUST AND RESIDUAL ENERGY FOR WSNSIJNSA Journal
In Wireless Sensor Networks (WSNs), all the nodes selected for packet routing must be trustworthy, and at the same time energetic too. Smooth conservation of nodes energies and the trust levels, are an important issues in WSN because they directly affects the life span and reliability of the nodes as well as the entire network. The energy utilization at every node must be very smooth and at the same time, packets should be forwarded via trusted nodes only. In this paper, we propose an Energy Efficient Link State Routing Protocol (EELSRP) using the potential nodes selected by applying the fuzzy logic on the trust and residual energy levels. This routing protocol finds the best route by balancing the nodesresidual energies and trust levels, and protects the WSN against routing attacks by eliminating the untrusted nodes before the creation of route.
This document summarizes a research paper that proposes using the Rivest Cipher version 6 (RC6) algorithm to provide message authentication and source privacy in wireless sensor networks. It discusses challenges with existing symmetric and public key approaches to message authentication in wireless sensor networks due to their high computational overhead and lack of scalability. The proposed approach aims to achieve efficient hop-by-hop message authentication, identity privacy, and location privacy using RC6 encryption. It evaluates RC6 in terms of computational overhead, energy consumption, message delay, and memory consumption compared to other techniques.
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.
This document discusses message authentication and source privacy in wireless sensor networks using the RC6 algorithm. It begins by reviewing existing approaches to message authentication like symmetric-key and public-key cryptosystems, which have limitations related to overhead and scalability. The document then proposes using the RC6 algorithm to provide efficient hop-by-hop message authentication and source privacy in wireless sensor networks. It aims to authenticate messages at each forwarding node while also hiding the identity and location of the message sender. The document reviews related work on wireless sensor networks and the network simulator NS-2 before describing the proposed RC6-based approach and its goals of message authentication, source privacy, and efficiency.
This document summarizes a research paper on source anonymous message authentication in wireless sensor networks. It proposes a new authentication scheme called SAMA that is based on elliptic curve cryptography. SAMA allows nodes to transmit an unlimited number of messages without threshold problems. It generates a source anonymous authenticator for each message by hashing the message and using a private key to calculate a signature. Intermediate nodes can authenticate messages in a hop-by-hop manner by verifying signatures. The scheme is more efficient than previous polynomial-based approaches as it does not have threshold limitations and provides increased security and scalability.
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..
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/
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.
Survey on Hop-by-Hop Message Authentication and Source Privacy in WSN IRJET Journal
This document summarizes and reviews several existing approaches for message authentication and source privacy in wireless sensor networks (WSNs). It proposes a new flexible authentication scheme based on elliptic curve cryptography that allows nodes to transmit an unlimited number of messages without hitting the threshold limit of previous polynomial-based approaches. Through both theoretical analysis and simulation results, the proposed scheme is shown to be more efficient than polynomial-based methods in terms of computational and communication overhead under the same security levels, while also providing message source anonymity.
Performance analysis of transport layer basedhybrid covert channel detection ...IJNSA Journal
- The document discusses a performance analysis of a transport layer based hybrid covert channel detection engine. A hybrid covert channel combines two or more types of covert channels, such as a simple network covert channel in TCP and a subliminal channel in SSL.
- The authors designed a hybrid covert channel involving a subliminal channel in the Digital Signature Algorithm of SSL and a simple network covert channel manipulating TCP sequence numbers. They also designed a detection engine to analyze TCP packet headers and SSL signature components.
- The detection engine was tested on an experimental test bed with 5 nodes. Testing showed the detection rate varied between 70-97% while detection content was between 15-30%, depending on the number of covert channel invocations.
Detecting Misbehavior Nodes Using Secured Delay Tolerant NetworkIRJET Journal
This document proposes a method called Statistical-based Detection of Blackhole and Greyhole attackers (SDBG) to detect misbehaving nodes in delay tolerant networks. SDBG can detect both individual misbehaving nodes as well as nodes that are colluding together. It works by having each node record encounter data with other nodes, including the number of messages sent and received. Individual nodes that drop many messages can be detected based on having a low message forwarding ratio. Colluding nodes can be detected because they will have sent many messages to each other to fake good behavior. The method aims to accurately detect misbehaving nodes while keeping false positives low. Extensive simulations showed it can work well across different network conditions.
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
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
International Journal of Engineering and Science Invention (IJESI) inventionjournals
This document summarizes a research paper that proposes a scheme to protect the location privacy of source nodes in wireless sensor networks against hotspot-locating attacks. The scheme creates an irregularly shaped "cloud" of fake traffic around the real source node to camouflage its location. Cryptographic techniques are used to change packet appearances at each hop. This prevents packet correlation and makes the source node indistinguishable. Simulations show the scheme provides stronger privacy than routing-based schemes while requiring less energy than global-adversary schemes. The proposed neighbor discovery distance algorithm aims to find the minimum traffic path to efficiently transmit data without loss.
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.
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
Secure and Reliable Data Routing in Wireless Sensor Networkdbpublications
Wireless Sensor Networks (WSNs) are materializing as one of the dominant technologies of the future because of their large range of applications in military and civilian fields. Because of their operating behavior, they are often neglected and thus vulnerable to various types of attacks. For instance, an attacker could catch sensor nodes, getting all the information saved therein-sensor nodes are generally considered to not be temper-proof. Hence, an attacker may clone cached sensor nodes and use them in the network to conduct a variety of mischievous activities. As the decisions taken by a sensor network rely on the information gathered by the sensor nodes, if an adversary inhibits the necessary or confidential data from being forwarded to the BS/ target, this will cause the whole breakdown of the network or outcomes in the wrong judgment being made, possibly causing deliberate loss. There are many types of attacks such as compromised node, denial of service attack, black hole attack, etc. Hence there is a necessity to find all such attacks in WSN, and to safely route our sensitive information to the target. This paper represents the survey of some types of attacks and there detection techniques. Also the survey includes different techniques for secure and reliable data collection in Wireless Sensor Networks.
Ki-Tech Solutions IEEE PROJECTS DEVELOPMENTS WE OFFER IEEE PROJECTS MCA FINAL YEAR STUDENT PROJECTS, ENGINEERING PROJECTS AND TRAINING, PHP PROJECTS, JAVA AND J2EE PROJECTS, ASP.NET PROJECTS, NS2 PROJECTS, MATLAB PROJECTS AND IPT TRAINING IN RAJAPALAYAM, VIRUDHUNAGAR DISTRICTS, AND TAMILNADU. Mail to: kitechsolutions.in@gmail.com
Consensus Routing And Environmental Discrete Trust Based Secure AODV in MANETsIJCNCJournal
The Mobile Adhoc Network (MANET) is a wireless network model for infrastructure-less communication, and it provides numerous applications in different areas. The MANET is vulnerable to a Black-hole attack, and it affects routing functionality by dropping all the incoming packets purposefully. The Black-hole attackers pretend that it always has the best path to the destination node to mislead the source nodes. Trust is the critical factor for detecting and isolating the Black-hole attackers from the network. However, the harsh channel conditions make it difficult to differentiate the Black-hole routing activities and accurate trust measurement. Hence, incorporating the consensus-based trust evidence collection from the neighbouring nodes improves the accuracy of trust. For improving the accuracy of trust, this work suggests Consensus Routing and Environmental DIscrete Trust (CREDIT) Based Secure AODV. The CREDIT incorporates Discrete and Consensus trust information. The Discrete parameters represent the specific characteristics of the Black-hole attacks, such as routing behaviour, hop count deviation, and sequence number deviation. The direct trust accurately differentiates the Black-hole attackers using Discrete parameters, only when the nodes perform sufficient communication between the nodes. To solve such issues, the CREDIT includes the Consensus-based trust information. However, secure routing against the Black-hole attack is challenging due to incomplete preferences. The in-degree centrality and Importance degree measurement on the collected consensus-based trust from decisionmakers solve the incomplete preference issue as well as improves the accuracy of trust. The performance of the proposed scheme is evaluated using Network Simulator-2 (NS2). From the simulation results, it is proved that the detection accuracy and throughput of the proposed CREDIT are substantially high and the proposed CREDIT scheme outperforms the existing work.
Robust encryption algorithm based sht in wireless sensor networksijdpsjournal
In bound applications, the locations
of events reportable by a device network have to be compelled to stay
anonymous. That is, unauthorized observers should be unable to notice the origin of such events by
analyzing the network traffic. I analyze 2 forms of downsides: Communication overhead a
nd machine load
problem. During this paper, I gift a brand new framework for modeling, analyzing, and evaluating
obscurity in device networks. The novelty of the proposed framework is twofold: initial, it introduc
es the
notion of “interval indistinguishabi
lity” and provides a quantitative live to model obscurity in wireless
device networks; second, it maps supply obscurity to the applied mathematics downside I showed that
the
present approaches for coming up with statistically anonymous systems introduce co
rrelation in real
intervals whereas faux area unit unrelated. I show however mapping supply obscurity to consecutive
hypothesis testing with nuisance Parameters ends up in changing the matter of exposing non
-
public supply
data into checking out associate d
egree applicable knowledge transformation that removes or minimize the
impact of the nuisance data victimization sturdy cryptography algorithmic rule. By doing therefore,
I
remodel the matter of analyzing real valued sample points to binary codes, that ope
ns the door for
committal to writing theory to be incorporated into the study of anonymous networks. In existing wor
k,
unable to notice unauthorized observer in network traffic. However our work in the main supported
enhances their supply obscurity against
correlation check. the most goal of supply location privacy is to
cover the existence of real events.
A group key generation algorithm investigates group secret key generation problems for
different types of wireless networks, by exploiting physical layer characteristics of wireless channels. A
new group key generation strategy with low complexity is proposed, which combines the wellestablished
point-to-point pair wise key generation technique, the multisegment scheme, and the onetime
pad. In particular, this group key generation process is studied for three types of communication
networks: 1) A three-node network; 2) A multi node ring network; and 3) A multi node mesh network.
Three group key generation algorithms are developed for these communication networks, respectively.
The analysis8 shows that the first two algorithms yield optimal group key rates, whereas the third
algorithm achieves the optimal multiplexing gain. Next, for the first two types of networks, we address
the time allocation problem in the channel estimation step to maximize the group key rates. This nonconvex
max – min time allocation problem is first reformulated into a series of geometric programming,
and then, a single-condensation method based iterative algorithm is proposed. Numerical results are also
provided to validate the performance of the proposed key generation algorithms and the time allocation
algorithm.
An Efficient Secured And Inspection of Malicious Node Using Double Encryption...IRJET Journal
This document proposes a method called Statistical-based Detection of Black hole and Grey hole attackers (SDBG) to detect both individual and colluding attacks in delay tolerant networks (DTNs). SDBG works by having a trusted authority monitor nodes' behavior based on their encounter records, message records, and forwarding histories. It aims to improve detection accuracy and reduce the impact of false positives compared to existing detection methods. The methodology involves network and authority creation, route finding and data forwarding, and detecting colluding attacks based on monitoring nodes' interactions and messages. Simulation results show SDBG can effectively detect attacks with varying drop rates even under collusion with high accuracy and low false positives.
LSR PROTOCOL BASED ON NODES POTENTIALITY IN TRUST AND RESIDUAL ENERGY FOR WSNSIJNSA Journal
In Wireless Sensor Networks (WSNs), all the nodes selected for packet routing must be trustworthy, and at the same time energetic too. Smooth conservation of nodes energies and the trust levels, are an important issues in WSN because they directly affects the life span and reliability of the nodes as well as the entire network. The energy utilization at every node must be very smooth and at the same time, packets should be forwarded via trusted nodes only. In this paper, we propose an Energy Efficient Link State Routing Protocol (EELSRP) using the potential nodes selected by applying the fuzzy logic on the trust and residual energy levels. This routing protocol finds the best route by balancing the nodesresidual energies and trust levels, and protects the WSN against routing attacks by eliminating the untrusted nodes before the creation of route.
This document summarizes a research paper that proposes using the Rivest Cipher version 6 (RC6) algorithm to provide message authentication and source privacy in wireless sensor networks. It discusses challenges with existing symmetric and public key approaches to message authentication in wireless sensor networks due to their high computational overhead and lack of scalability. The proposed approach aims to achieve efficient hop-by-hop message authentication, identity privacy, and location privacy using RC6 encryption. It evaluates RC6 in terms of computational overhead, energy consumption, message delay, and memory consumption compared to other techniques.
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.
This document discusses message authentication and source privacy in wireless sensor networks using the RC6 algorithm. It begins by reviewing existing approaches to message authentication like symmetric-key and public-key cryptosystems, which have limitations related to overhead and scalability. The document then proposes using the RC6 algorithm to provide efficient hop-by-hop message authentication and source privacy in wireless sensor networks. It aims to authenticate messages at each forwarding node while also hiding the identity and location of the message sender. The document reviews related work on wireless sensor networks and the network simulator NS-2 before describing the proposed RC6-based approach and its goals of message authentication, source privacy, and efficiency.
This document summarizes a research paper on source anonymous message authentication in wireless sensor networks. It proposes a new authentication scheme called SAMA that is based on elliptic curve cryptography. SAMA allows nodes to transmit an unlimited number of messages without threshold problems. It generates a source anonymous authenticator for each message by hashing the message and using a private key to calculate a signature. Intermediate nodes can authenticate messages in a hop-by-hop manner by verifying signatures. The scheme is more efficient than previous polynomial-based approaches as it does not have threshold limitations and provides increased security and scalability.
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..
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/
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.
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.
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.
Security in Wireless Sensor Networks Using BroadcastingIJMER
This document summarizes an efficient broadcast authentication scheme for wireless sensor networks. It discusses how broadcast is an important communication method in WSNs due to the large number of sensor nodes. However, traditional MACs are not suitable for broadcast without modification because any receiver could impersonate the sender. The document proposes using a cryptographic hash function to construct a HORS (Hash to Obtain Random Subset) scheme involving key generation, signing and verification phases to authenticate broadcast messages while reducing storage requirements compared to previous schemes. This provides an efficient security mechanism for broadcast in WSNs.
A Survey of Source Authentication Schemes for Multicast transfer in Adhoc Net...ijsrd.com
An adhoc network is a collection of autonomous nodes with dynamically changing infrastructure. Multicast is a good mechanism for group communication. It can be used in the group oriented applications like video/audio conference, interactive group games, video on demand etc. The security problems obstruct the large deployment of the multicast communication model. Multicast data origin authentication is the main component in the security architecture. The authentication schemes should scalable and efficient against packet loss. In this article we discuss varies authentication scheme for multicast data origin with their advantage and disadvantage
containing byzantine failures with control zonesvishnuRajan20
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
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
A Novel Key Management Paradigm for Broadcasting to Remote Cooperative GroupsIJMER
A Mobile Ad Hoc Network(MANET) is a system made up of wireless mobile nodes. These
MANET nodes have wireless communication and networking characteristics. MANETs have been
proposed to serve as an effective networking system facilitating information exchange between mobile
devices even without fixed infrastructures. In MANETs, it is important to support group-oriented
applications, such as audio/video conference and one-to-many data dissemination in disaster or
battlefield rescue scenarios. In the above group oriented communication scenarios, the common problem
is to enable a sender to securely transmit secret messages to a remote cooperative group. A solution to
the above problem must meet several constraints. First, the sender must be remote and can be dynamic.
Second, the message transmission may cross various networks including open insecure networks before
reaching the intended recipients. Third, the data communication from the group members to the sender
may be limited. Also, the sender may wish to choose only a subset of the overall group as the intended
recipients. Furthermore, it is hard to resort to a fully trusted third party to secure the overall
communication. In contrast to the above constraints, mitigating features are that the group members are
cooperative and the secret communication among them is local and efficient. This paper exploits these
mitigating features to facilitate the remote access control of group-oriented communications without
relying on a fully trusted secret key generation center.
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
This document proposes a secure group key management technique for MANETs that uses a combination of broadcast encryption and cluster key agreement. It addresses challenges like restricted communication between group members and the sender, and the lack of a fully trusted third party key generation center. The technique assigns each cluster a public/shared key from a trusted third party. When a sender wants to broadcast to a subgroup, the message is encrypted with the subgroup's public key and broadcast. Non-intended members cannot decrypt the message. The technique provides an efficient way to add or remove members and a flexible rekeying strategy while maintaining security even if members collude. Simulation results using NS2 are presented.
An Efficient Security Way of Authentication and Pair wise Key Distribution wi...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Similar to Hop by-hop message authentication and source privacy in wire (20)
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...University of Maribor
Slides from talk presenting:
Aleš Zamuda: Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapter and Networking.
Presentation at IcETRAN 2024 session:
"Inter-Society Networking Panel GRSS/MTT-S/CIS
Panel Session: Promoting Connection and Cooperation"
IEEE Slovenia GRSS
IEEE Serbia and Montenegro MTT-S
IEEE Slovenia CIS
11TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTING ENGINEERING
3-6 June 2024, Niš, Serbia
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECTjpsjournal1
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
A review on techniques and modelling methodologies used for checking electrom...nooriasukmaningtyas
The proper function of the integrated circuit (IC) in an inhibiting electromagnetic environment has always been a serious concern throughout the decades of revolution in the world of electronics, from disjunct devices to today’s integrated circuit technology, where billions of transistors are combined on a single chip. The automotive industry and smart vehicles in particular, are confronting design issues such as being prone to electromagnetic interference (EMI). Electronic control devices calculate incorrect outputs because of EMI and sensors give misleading values which can prove fatal in case of automotives. In this paper, the authors have non exhaustively tried to review research work concerned with the investigation of EMI in ICs and prediction of this EMI using various modelling methodologies and measurement setups.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMSIJNSA Journal
The smart irrigation system represents an innovative approach to optimize water usage in agricultural and landscaping practices. The integration of cutting-edge technologies, including sensors, actuators, and data analysis, empowers this system to provide accurate monitoring and control of irrigation processes by leveraging real-time environmental conditions. The main objective of a smart irrigation system is to optimize water efficiency, minimize expenses, and foster the adoption of sustainable water management methods. This paper conducts a systematic risk assessment by exploring the key components/assets and their functionalities in the smart irrigation system. The crucial role of sensors in gathering data on soil moisture, weather patterns, and plant well-being is emphasized in this system. These sensors enable intelligent decision-making in irrigation scheduling and water distribution, leading to enhanced water efficiency and sustainable water management practices. Actuators enable automated control of irrigation devices, ensuring precise and targeted water delivery to plants. Additionally, the paper addresses the potential threat and vulnerabilities associated with smart irrigation systems. It discusses limitations of the system, such as power constraints and computational capabilities, and calculates the potential security risks. The paper suggests possible risk treatment methods for effective secure system operation. In conclusion, the paper emphasizes the significant benefits of implementing smart irrigation systems, including improved water conservation, increased crop yield, and reduced environmental impact. Additionally, based on the security analysis conducted, the paper recommends the implementation of countermeasures and security approaches to address vulnerabilities and ensure the integrity and reliability of the system. By incorporating these measures, smart irrigation technology can revolutionize water management practices in agriculture, promoting sustainability, resource efficiency, and safeguarding against potential security threats.
International Conference on NLP, Artificial Intelligence, Machine Learning an...gerogepatton
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Hop by-hop message authentication and source privacy in wire
1. 1
Hop-by-Hop Message Authentication and Source
Privacy in Wireless Sensor Networks
Jian Li Yun Li Jian Ren Jie Wu
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 cryptosys-
tems. Most of them, however, have the limitations of high com-
putational 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.
Index Terms—Hop-by-hop authentication, symmetric-key cryp-
tosystem, public-key cryptosystem, source privacy, simulation,
wireless sensor networks (WSNs), distributed algorithm, decen-
tralized control
I. INTRODUCTION
Message authentication plays a key role in thwarting unau-
thorized and corrupted messages from being forwarded in
networks to save the precious sensor energy. For this reason,
many authentication schemes have been proposed in literature
to provide message authenticity and integrity verification for
wireless sensor networks (WSNs) [1]–[5]. These schemes can
largely be divided into two categories: public-key based ap-
proaches and symmetric-key based approaches.
The symmetric-key based approach requires complex key
management, lacks of scalability, and is not resilient to large
numbers of node compromise attacks since the message sender
and the receiver have to share a secret key. The shared key
is used by the sender to generate a message authentication
code (MAC) for each transmitted message. However, for this
Jian Li and Jiaan Ren are with the Department of Electrical & Computer
Engineering, Michigan State University, East Lansing, MI 48824-1226. Email:
{lijian6, renjian}@egr.msu.edu.
Yun Li is with the SPD Department, Microsoft, Redmond, WA 98052. Email:
yunl@microsoft.com.
Jie Wu is with the Department of Computer & Information Sciences, Temple
University, Philadelphia, PA 19122. Email: jiewu@temple.edu
method, the authenticity and integrity of the message can only
be verified by the node with the shared secret key, which is
generally shared by a group of sensor nodes. An intruder can
compromise the key by capturing a single sensor node. In
addition, this method does not work in multicast networks.
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.
An alternative solution was proposed in [4] 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.
However, a recent study shows that the random noise can be
completely removed from the polynomial using error-correcting
code techniques [6].
For the public-key based approach, each message is transmit-
ted 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 [7], [8]. One of the limitations of the public-
key based scheme 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 [9].
In this paper, we propose an unconditionally secure and
efficient source anonymous message authentication (SAMA)
scheme based on the optimal modified ElGamal signa-
ture (MES) scheme on elliptic curves. This MES scheme is
secure against adaptive chosen-message attacks in the random
oracle model [10]. Our 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, our scheme does not have the
threshold problem. Both theoretical analysis and simulation
IEEE Transactions on Parallel and Distributed Systems,Volume:25,Issue:5,Issue Date : May.2014
2. 2
results demonstrate that our proposed scheme is more efficient
than the polynomial-based algorithms under comparable secu-
rity levels.
The major contributions of this paper are the following:
1) We develop a source anonymous message authentication
code (SAMAC) on elliptic curves that can provide un-
conditional source anonymity.
2) We offer an efficient hop-by-hop message authentication
mechanism for WSNs without the threshold limitation.
3) We devise network implementation criteria on source
node privacy protection in WSNs.
4) We propose an efficient key management framework to
ensure isolation of the compromised nodes.
5) We provide extensive simulation results under ns-2 and
TelosB on multiple security levels.
To the best of our knowledge, this is the first scheme that
provides hop-by-hop node authentication without the threshold
limitation, and has performance better than the symmetric-key
based schemes. The distributed nature of our algorithm makes
the scheme suitable for decentralized networks.
The rest of this paper is organized as follows: Section II
presents the terminology and the preliminary that will be used
in this paper. Section III discusses the related work, with a
focus on polynomial-based schemes. Section IV describes the
proposed source anonymous message authentication scheme on
elliptic curves. Section V discusses the ambiguity set (AS)
selection strategies for source privacy. Section VI describes key
management and compromised node detection. Performance
analysis and simulation results are provided in Section VII.
We conclude in Section VIII.
II. TERMINOLOGY AND PRELIMINARY
In this section, we will briefly describe the terminology and
the cryptographic tools that will be used in this paper.
A. Threat Model and Assumptions
The wireless sensor networks are assumed to consist of a
large number of sensor nodes. We assume that each 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. We assume there is a secu-
rity server (SS) that is responsible for generation, storage and
distribution of the security parameters among the network. This
server will never be compromised. However, after deployment,
the sensor nodes may be captured and compromised by attack-
ers. Once compromised, all information stored in the sensor
nodes can be accessed by the attackers. The compromised nodes
can be reprogrammed and fully controlled by the attackers.
However, the compromised nodes will not be able to create new
public keys that can be accepted by the SS and other nodes.
Based on the above assumptions, this paper considers two
types of attacks launched by the adversaries:
• Passive attacks: Through passive attacks, the adversaries
could eavesdrop on messages transmitted in the network
and perform traffic analysis.
• Active attacks: Active attacks can only be launched from
the compromised sensor nodes. Once the sensor nodes
are compromised, the adversaries will obtain all the in-
formation stored in the compromised nodes, including
the security parameters of the compromised nodes. The
adversaries can modify the contents of the messages, and
inject their own messages.
B. 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 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 de-
termine the message sender’s ID and location by analyzing
the message contents or the local traffic.
• Node compromise resilience: The scheme should be re-
silient 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.
C. Terminology
Privacy is sometimes referred to as anonymity. Communica-
tion anonymity in information management has been discussed
in a number of previous works [11]–[16]. It generally refers to
the state of being unidentifiable within a set of subjects. This
set is called the ambiguity set (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
source anonymous message authentication scheme (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 an anonymous message S(m) using its own
private key dt.
IEEE Transactions on Parallel and Distributed Systems,Volume:25,Issue:5,Issue Date : May.2014
3. 3
• Verify S(m): Given a message m and an anonymous
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 requirements for SAMA include:
• Sender ambiguity: The probability that a verifier success-
fully determines the real sender of the anonymous message
is exactly 1/n, where n is the total number of members in
the AS.
• Unforgeability: An anonymous message scheme is un-
forgeable 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 mes-
sage with non-negligible probability.
In this paper, the user ID and the user public key will be
used interchangeably without making any distinctions.
D. Modified ElGamal Signature Scheme (MES)
Definition 2 (MES). The modified ElGamal signature
scheme [17] consists of the following three algorithms:
Key generation algorithm: Let p be a large prime and g
be a generator of Z⇤
p. Both p and g are made public. For a
random private key x 2 Zp, the public key y is computed from
y = gx
mod p.
Signature algorithm: The MES can also have many vari-
ants [18], [19]. For the purpose of efficiency, we will describe
the variant, called optimal scheme. To sign a message m, one
chooses a random k 2 Z⇤
p 1, then computes the exponentiation
r = gk
mod p and solves s from:
s = rxh(m, r) + k mod (p 1), (1)
where h 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
= ryrh(m,r)
mod p. If the equality
holds true, then the verifier Accepts the signature, and Rejects
otherwise.
III. RELATED WORK
In [1], [2], symmetric key and hash based authentication
schemes were proposed for WSNs. In these schemes, each
symmetric authentication key is shared by a group of sensor
nodes. An intruder can compromise the key by capturing a
single sensor node. Therefore, these schemes are not resilient
to node compromise attacks. Another type of symmetric-key
scheme requires synchronization among nodes. These schemes,
including TESLA [5] and its variants, can also provide message
sender authentication. However, this scheme requires initial
time synchronization, which is not easy to be implemented in
large scale WSNs. In addition, they also introduce delay in
message authentication, and the delay increases as the network
scales up.
A secret polynomial based message authentication scheme
was introduced in [3]. This scheme offers information-theoretic
security with ideas similar to a threshold secret sharing, where
the threshold is determined by the degree of the polynomial.
When the number of messages transmitted is below the thresh-
old, the scheme enables the intermediate node to verify the
authenticity of the message through 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. To increase the threshold
and the complexity for the intruder to reconstruct the secret
polynomial, a random noise, also called a perturbation factor,
was added to the polynomial in [4] to thwart the adversary
from computing the coefficient of the polynomial. However,
the added perturbation factor can be completely removed using
error-correcting code techniques [6].
For the public-key based approach, each message is transmit-
ted 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. The recent progress on elliptic curve cryp-
tography (ECC) shows that the public-key schemes can be more
advantageous in terms of memory usage, message complexity,
and security resilience, since public-key based approaches have
a simple and clean key management [9].
The existing anonymous communication protocols are
largely stemmed from either mixnet [11] or DC-net [12]. A
mixnet provides anonymity via packet re-shuffling through
a set of mix servers (with at least one being trusted). In
a mixnet, a sender encrypts an outgoing message, and the
ID of the recipient, using the public key of the mix. The
mix accumulates a batch of encrypted messages, decrypts and
reorders these messages, and forwards them to the recipients.
Since mixnet-like protocols rely on the statistical properties of
the background traffic, they cannot provide provable anonymity.
DC-net [12], [16] is an anonymous multi-party computation
scheme. Some pairs of the participants are required to share
secret keys. DC-net provides perfect (information-theoretic)
sender anonymity without requiring trusted servers. However, in
DC-net, only one user can send at a time, so it takes additional
bandwidth to handle collision and contention.
Recently, message sender anonymity based on ring signatures
was introduced [20]. This approach enables the message sender
to generate a source anonymous message signature with content
authenticity assurance. To generate a ring signature, a ring
member randomly selects an AS and forges a message signature
for all other members. Then he uses his trap-door information
to glue the ring together. The original scheme has very limited
flexibility and very high complexity. Moreover, the original
paper only focuses on the cryptographic algorithm, and the
relevant network issues were left unaddressed.
IV. PROPOSED SOURCE ANONYMOUS MESSAGE
AUTHENTICATION (SAMA) ON ELLIPTIC CURVES
In this section, we propose an unconditionally secure and
efficient source anonymous message authentication scheme
IEEE Transactions on Parallel and Distributed Systems,Volume:25,Issue:5,Issue Date : May.2014
4. 4
(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.
A. Proposed MES Scheme on Elliptic Curves
Let p > 3 be an odd prime. An elliptic curve E is defined
by an equation of the form:
E : y2
= x3
+ ax + b mod p,
where a, b 2 Fp, and 4a3
+ 27b2
6⌘ 0 mod p. The set E(Fp)
consists of all points (x, y) 2 Fp on the curve, together with a
special point O, called the point at infinity.
Let G = (xG, yG) be a base point on E(Fp) whose order is
a very large value N. User A selects a random integer dA 2
[1, N 1] as his private key. Then, he can compute his public
key QA from QA = dA ⇥ G.
Signature generation algorithm: For Alice to sign a
message m, she follows these steps:
1) Select a random integer kA, 1 kA N 1.
2) Calculate r = xA mod N, where (xA, yA) = kAG. If
r = 0, go back to step 1.
3) Calculate hA
l
h(m, r), where h is a cryptographic
hash function, such as SHA-1, and
l
denotes the l
leftmost bits of the hash.
4) Calculate s = rdAhA + kA mod N. If s = 0, go back to
step 2.
5) The signature is the pair (r, s).
Signature verification algorithm: For Bob to authenticate
Alice’s signature, he must have a copy of her public key QA,
then he:
1) Checks that QA 6= O, otherwise invalid
2) Checks that QA lies on the curve
3) Checks that nQA = O
After that, Bob follows these steps to verify the signature:
1) Verify that r and s are integers in [1, N 1]. If not, the
signature is invalid.
2) Calculate hA
l
h(m, r), where h is the same function
used in the signature generation.
3) Calculate (x1, x2) = sG rhAQA mod N.
4) The signature is valid if r = x1 mod N, invalid other-
wise.
B. Proposed SAMA on Elliptic Curves
Suppose that the message sender (say Alice) wishes to
transmit a message m anonymously from her network node to
any other nodes. The AS includes n members, A1, A2, · · · , An,
e.g., S = {A1, A2, · · · , An}, where the actual message sender
Alice is At, for some value t, 1 t n. In this paper, we
will not distinguish between the node Ai and its public key
Qi. Therefore, we also have S = {Q1, Q2, · · · , Qn}.
Authentication generation algorithm: Suppose m is a
message to be transmitted. The private key of the message
sender Alice is dt, 1 t N. To generate an efficient SAMA
for message m, Alice performs the following three steps:
1) Select a random and pairwise different ki for each 1
i n 1, i 6= t and compute ri from (ri, yi) = kiG.
2) Choose a random ki 2 Zp and compute rt from (rt, yt) =
ktG
P
i6=t
rihiQi such that rt 6= 0 and rt 6= ri for any
i 6= t, where hi
l
h(m, ri).
3) Compute s = kt +
P
i6=t
ki + rtdtht mod N.
The SAMA of the message m is defined as:
S(m) = (m, S, r1, y1, · · · , rn, yn, s).
C. Verification of SAMA
Verification algorithm: For Bob to verify an alleged
SAMA (m, S, r1, y1, · · · , rn, yn, s), he must have a copy of
the public keys Q1, · · · , Qn. Then he:
1) Checks that Qi 6= O, i = 1, · · · , n, otherwise invalid
2) Checks that Qi, i = 1, · · · , n lies on the curve
3) Checks that nQi = O, i = 1, · · · , n
After that, Bob follows these steps:
1) Verify that ri, yi, i = 1, · · · , n and s are integers in
[1, N 1]. If not, the signature is invalid.
2) Calculate hi
l
h(m, ri), where h is the same function
used in the signature generation.
3) Calculate (x0, y0) = sG
nP
i=1
rihiQi
4) The signature is valid if the first coordinate of
P
i
(ri, yi)
equals x0, invalid otherwise.
In fact, if the SAMA has been correctly generated without
being modified, then we compute:
(x0, y0) = sG
nX
i=1
rihiQi
= (kt +
X
i6=t
ki + rtdtht)G
X
i
rihiQi
=
X
i6=t
kiG + (ktG
X
i6=t
rihiQi)
=
X
i6=t
(ri, yi) + (rt, yt)
=
X
i
(ri, yi).
Therefore, the verifier should always Accept the SAMA.
Remark 1. It is apparent that when n = 1, SAMA becomes a
simple signature algorithm.
IEEE Transactions on Parallel and Distributed Systems,Volume:25,Issue:5,Issue Date : May.2014
5. 5
D. Security Analysis
In this subsection, we will prove that the proposed SAMA
scheme can provide unconditional source anonymity and prov-
able unforgeability against adaptive chosen-message attacks.
1) Anonymity: In order to prove that the proposed SAMA
can ensure unconditional source anonymity, we have to prove
that: (i) for anybody other than the members of S, the prob-
ability to successfully identify the real sender is 1/n, and (ii)
anybody from S can generate SAMAs.
Theorem 1. The proposed source anonymous message authen-
tication scheme (SAMA) can provide unconditional message
sender anonymity.
Proof: The identity of the message sender is uncondi-
tionally protected with the proposed SAMA scheme. This is
because, regardless of the sender’s identity, there are exactly
(N 1)(N 2) · · · (N n) different options to generate the
SAMA. All of them can be chosen by any members in the AS
during the SAMA generation procedure with equal probability
without depending on any complexity-theoretic assumptions.
The proof for the second part, that anybody from S can generate
the SAMA, is straightforward. This finishes the proof of this
theorem.
2) Unforgeability: The design of the proposed SAMA relies
on the ElGamal signature scheme. Signature schemes can
achieve different levels of security. Security against existential
forgery under adaptive-chosen message attacks is the maximum
level of security.
In this section, we will prove that the proposed SAMA
is secure against existential forgery under adaptive-chosen
message attacks in the random oracle model [21]. The security
of our result is based on elliptic curve cryptography (ECC),
which assumes that the computation of discrete logarithms on
elliptic curves is computationally infeasible. In other words, no
efficient algorithms are known for non-quantum computers.
We will introduce two lemmas. Lemma 1 is the Splitting
Lemma, which is a well-known probabilistic lemma from
reference [10]. The basic idea of the Splitting Lemma is that
when a subset Z is “large” in a product space X ⇥ Y , it will
have many “large” sections. Lemma 2 is a slight modification
of the Forking Lemma presented in [10]. The proofs of the two
lemmas are mainly probability theory related. We will skip the
proofs of these two lemmas here.
Lemma 1 (The Splitting Lemma). Let Z ⇢ X ⇥ Y such that
Pr[(x, y) 2 Z] ". For any ↵ < ", define W = {(x, y) 2
X ⇥ Y | Pr
y02Y
[(x, y0
) 2 Z] " ↵}, and ¯W = (X ⇥ Y )W,
then the following statements hold:
1) Pr[W] ↵.
2) 8(x, y) 2 W, Pry02Y [(x, y0
) 2 Z] " ↵.
3) Pr[W|Z] ↵/".
Lemma 2 (The Forking Lemma). Let A be a Probabilistic
Polynomial Time (PPT) Turing machine. Given only the pub-
lic data as input, if A can find, with non-negligible proba-
bility, a valid SAMA (m, S, r1, y1, · · · , rn, yn, h1, · · · , hn, s)
within a bounded polynomial time T, then with non-negligible
probability, a replay of this machine, which has control
over A and a different oracle, outputs another valid SAMA
(m, S, r1, y1, · · · , rn, yn, h0
1, · · · , h0
n, s), such that hi = h0
i, for
all 1 i v, i 6= j for some fixed j.
Theorem 2. The proposed SAMA is secure against adaptive
chosen-message attacks in the random oracle model.
Proof: (Sketch) If an adversary can forge a valid SAMA
with non-negligible probability, then according to the Fork-
ing Lemma, the adversary can obtain two valid SAMAs
S(m) = (m, S, r1, y1, · · · , rn, yn, h1, · · · , hn, s), and S(m) =
(m, S, r1, y1, · · · , rn, yn, h0
1, · · · , h0
n, s), such that for 1 i
n, i 6= j, hi = h0
i, hj 6= h0
j and sG
nP
i=1
rihiQi =
P
i
(ri, yi),
s0
G
nP
i=1
rih0
iQi =
P
i
(ri, yi).
Subtracting these two equations, we obtain (s s0
)G =
rj(hj h0
j)Qj. Equivalently, we have:
Qj =
s s0
rj(hj h0
j)
G.
Therefore, we can compute the elliptic curve discrete loga-
rithm of Qj in base G with non-negligible probability, which
contradicts the assumption that it is computationally infeasible
to compute the elliptic discrete logarithm of Qj in base G.
Therefore, it is computationally infeasible for any adversary to
forge a valid SAMA.
V. AS SELECTION AND SOURCE PRIVACY
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. In this section, we will discuss
techniques that can 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, he can possibly find
the direction of the previous hop, or even the real node of the
previous hop. However, 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.
Some basic criteria for the selection of the AS can be
described as follows:
• To provide message source privacy, the message source
needs to select the AS to include nodes from all directions
of the source node. In particular, the AS should include
nodes from the opposite direction of the successor node.
In this way, even the immediate successor node will not
IEEE Transactions on Parallel and Distributed Systems,Volume:25,Issue:5,Issue Date : May.2014
6. 6
D
S
Network
A
Active routing pathNodes in the AS Nodes not in the AS
Fig. 1. Anonymous set selection in active routing
be able to distinguish the message source node from the
forwarder based on the message that it receives.
• Though the message source node can select any node in
the AS, some nodes in the AS may not be able to add any
ambiguity to the message source node. For instance, the
nodes that are apparently impossible or very unlikely to
be included in the AS based on the geographic routing.
Therefore, these nodes are not appropriate candidates for
the AS. They should be excluded from the AS for energy
efficiency.
• To balance the source privacy and efficiency, we should
try to select the nodes to be within a predefined distance
range from the routing path. We recommend selecting an
AS from the nodes in a band that covers the active routing
path. However, the AS does not have to include all the
nodes in the routing path.
• The AS does not have to include all nodes in that range,
nor does it have to include all the nodes in the active
routing path. In fact, if all nodes are included in the AS,
then this may help the adversary to identity the possible
routing path and find the source node.
As an example, suppose we want to transmit a packet from
source node S to destination node D in Fig. 1. We select the
AS to include only nodes marked with , while nodes marked
as • will not be included in the AS. Of all these nodes, some
of them are on the active routing path, while others are not.
However, all these nodes are located within the shaded band
area surrounding the active routing path. Suppose node A is
compromised, unless node A collaborates with other nodes and
can fully monitor the traffic of the source node S, it will not
be able to determine whether S is the source node, or simply
a forwarder. Similar analysis is also true for other nodes.
Any node in the active routing path can verify the contents’
authenticity and integrity. However, anybody who receives a
packet in the transmission can possibly exclude some of the
nodes in the WSNs as the possible source node. Inclusion of
these nodes in the AS will not increase the source privacy.
Nevertheless, the more the nodes included in the AS are, the
higher the energy cost will be. Therefore, the selection of the
AS has to be done with care so that the energy cost and the
source privacy can both be optimized.
In addition, to balance the power consumption between
authenticity and integrity verification, and the possibility that
corrupted messages are being forwarded, the verification ser-
vice may not have to take place in every hop; instead, it may
be configured to take place in every other hop, for instance.
AS1
AS3
AS2
Fig. 2. Compromised node detection
VI. KEY MANAGEMENT AND COMPROMISED NODE
DETECTION
In our scheme, we assume that there is an SS whose
responsibilities include public-key storage and distribution in
the WSNs. We assume that the SS will never be compromised.
However, 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. We further assume that 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.
A. Compromised Node Detection
As a special scenario, we assume that all sensor information
will be delivered to a sink node, which can be co-located with
the SS. As described in Section V, when a message is received
by the sink node, the message source is hidden in an AS. Since
the SAMA scheme guarantees that the message integrity is
untampered, when a bad or meaningless message is received by
the sink node, the source node is viewed as compromised. If the
compromised source node only transmits one message, it would
be very difficult for the node to be identified without additional
network traffic information. However, when a compromised
node transmits more than one message, the sink node can
narrow the possible compromised nodes down to a very small
set.
As shown in Fig. 2, we use the circle to represent an AS.
When only one message is transmitted, the sink node can only
obtain the information that the source node will be in a set,
say AS1. When the compromised source node transmits two
messages, the sink node will be able to narrow the source
node down to the set with both vertical lines and horizontal
lines. When the compromised source node transmits three
messages, the source node will be further narrowed down to
the shaded area. Therefore, if the sink node keeps tracking
the compromised message, there is a high probability that the
compromised node can be isolated.
IEEE Transactions on Parallel and Distributed Systems,Volume:25,Issue:5,Issue Date : May.2014
7. 7
If the compromised nodes repeatedly use the same AS,
it makes traffic analysis of the compromised nodes feasible,
which will increase the likelihood for the compromised nodes
to be identified and captured.
When a node has been identified as compromised, the SS
can remove its public key from its public key list. It can also
broadcast the node’s short identity to the entire sensor domain
so that any sensor node that uses the stored public key for an AS
selection can update its key list. Once the public key of a node
has been removed from the public key list, and/or broadcasted,
any message with the AS containing the compromised node
should be dropped without any process in order to save the
precious sensor power.
VII. PERFORMANCE ANALYSIS
In this section, we will evaluate our proposed authentica-
tion scheme through both theoretical analysis and simulation
demonstrations. We will compare our proposed scheme with the
bivariate polynomial-based symmetric-key scheme described
in [3], [4]. A fair comparison between our proposed scheme and
the scheme proposed in [4] should be performed with n = 1.
A. Theoretical Analysis
Key management is one of the major issues for secret-key
based authentication schemes. This is especially true for large
scale WSNs. While many of these schemes are designed to
provide node authentication, they can only provide end-to-end
node authentication using the secret key shared between the
two nodes, which implies that only the receiver can verify
the authenticity of the messages en-route. This means that
no intermediate node can authenticate the message in general.
The intermediate nodes may have to forward a manipulated
message for many hops before the message can finally be
authenticated and dropped by the receiving node. This not only
consumes extra sensor power, but also increases the network
collision and decreases the message delivery ratio. In addition
to performance improvement, enabling intermediate node au-
thentication will thwart adversaries from performing denial-of-
service attacks through message manipulation to deplete the
energy and communication resources of the wireless network.
Therefore, developing a protocol that can provide hop-by-hop
intermediate node authentication is an important research task.
Most of the authentication schemes are based on symmetric-
key schemes, including the polynomial evaluation based thresh-
old authentication scheme [4]. The secret bivariate polynomial
is defined as [3]:
f(x, y) =
dxX
i=0
dy
X
j=0
Ai,jxi
yj
,
where each coefficient Ax,y is an element of a finite field Fp,
and dx and dy are the degrees of this polynomial. dx and dy
are also related to the message length and the computational
complexity of this scheme. From the performance aspect, dx
and dy should be as short as possible.
On the other hand, it is easy to see that when either more
than dy + 1 messages transmitted from the base station are
received and recorded by the intruders, or more than dx + 1
sensor nodes have been compromised, the intruders can recover
the polynomial f(x, y) via Lagrange interpolation. In this case,
the security of the system is totally broken and the system
cannot be used anymore. This property requires that both dx
and dy be very large for the scheme to be resilient to node
compromise attacks.
An alternative approach based on perturbation of the polyno-
mial was also explored. The main idea is to add a small amount
of random noise to the polynomial in the original scheme so that
the adversaries will no longer be able to solve the coefficients
using Lagrange interpolation. However, this technique is proved
to be vulnerable to security attacks [6], since the random noise
can be removed from the polynomial using error-correcting
techniques.
While hop-by-hop authentication can be achieved through
a public-key encryption system, the public-key based schemes
were generally considered as not preferred, mainly due to their
high computational overhead. However, our research demon-
strates that it is not always true, especially for elliptic curve
public-key cryptosystems.
In our scheme, each SAMA contains an AS of n randomly
selected nodes that dynamically changes for each message. For
n = 1, our scheme can provide at least the same security as the
bivariate polynomial-based scheme. For n > 1, we can provide
extra source privacy benefits. Even if one message is corrupted,
other messages transmitted in the network can still be secure.
Therefore, n can be much smaller than the parameters dx and
dy. In fact, even a small n may provide adequate source privacy,
while ensuring high system performance.
In addition, in the bivariate polynomial-based scheme, there
is only one base station that can send messages. All the other
nodes can only act as intermediate nodes or receivers. This
property makes the base station easy to attack, and severely
narrows the applicability of this scheme. In fact, the major
traffic in WSNs is packet delivery from the sensor nodes to
the sink node. In this case, our scheme enables every node to
transmit the message to the sink node as a message initiator.
The recent progress on elliptic curve cryptography (ECC)
has demonstrated that the public-key based schemes have more
advantages in terms of memory usage, message complexity, and
security resilience, since public-key based approaches have a
simple and clean key management [9].
B. Experimental Results
In this section, we implement the bivariate polynomial-based
scheme and our proposed scheme in a real world comparison.
The comparison is based on comparable security levels.
The implementation in [4] was carried out on Mica2 plat-
form, which is 8MHz, while our implementation is carried out
on Telosb platform, which is 4MHz. We first provide simulation
in Table I to compare and justify our parameter selections. From
the table, we can see that our results is comparable with the
IEEE Transactions on Parallel and Distributed Systems,Volume:25,Issue:5,Issue Date : May.2014
8. 8
TABLE I
PERFORMANCE COMPARISON OF THE BIVARIATE POLYNOMIAL-BASED
SCHEME IN TWO DIFFERENT SCENARIOS: (A) THE ORIGINAL
IMPLEMENTATION UNDER 8MHZ MICA2 PLATFORM, AND (B) OUR
IMPLEMENTATION UNDER 4MHZ TELOSB.
(a). Original implementation [4]
dx, dy = 3 dx, dy = 4
ROM RAM Sign Verf ROM RAM Sign Verf
(KB) (B) (ms) (ms) (KB) (B) (ms) (ms)
14.78 1938 5.8 57.89 15.04 2211 7.59 70.8
(b). Our implementation
dx, dy = 3 dx, dy = 4
ROM RAM Sign Verf ROM RAM Sign Verf
(KB) (B) (ms) (ms) (KB) (B) (ms) (ms)
13.61 1938 9 108 13.65 2302 11.73 126.93
original paper. This justifies that the performance comparisons
between our scheme and the algorithm proposed in [4] using
different parameters are consistent and reasonable.
1) Simulation parameter setup: The bivariate polynomial-
based scheme is a symmetric-key based implementation, while
our scheme is based on ECC. This requires us to determine the
comparable key sizes. If we choose the key size to be l for the
symmetric-key cryptosystem, then the key size for our proposed
ECC should be 2l according to [22], which is much shorter than
the traditional public-key cryptosystem. This progress facilitates
the implementation of the authentication scheme using ECC.
In our simulation setting, we choose five security levels,
which are indicated by the symmetric-key sizes l: 24bit, 32bit,
40bit, 64bit, and 80bit, respectively. The comparable key sizes
of our scheme are 48bit, 64bit, 80bit, 128bit, and 160bit,
respectively.
We also need to determine dx and dy for the bivariate
polynomial-based scheme, and the n for our scheme. In our
simulation, we select dx equal to dy and choose three values for
them: 80, 100, and 150. We assume that WSNs do not contain
more than 216
nodes in our simulation, which is reasonably
large. For size n of the AS, we choose three values in the
simulation: 10, 15 and 20.
We will compare the computational overhead, communica-
tion overhead, delivery ratio, energy consumption, transmission
delay, and memory consumption of our proposed scheme with
the bivariate polynomial-based scheme.
2) Computational overhead: For a public-key based authen-
tication scheme, computational overhead is one of the most
important performance measurements. So we first performed
simulation to measure the process time. The simulations were
carried out in 16-bit, 4 MHz TelosB mote.
Table II shows the process time of our scheme and the bivari-
ate polynomial-based scheme for both authentication generation
and verification. In the simulations, we assume that the key
length of our scheme is 2l.
From the table, we have the following findings:
• For the bivariate polynomial-based scheme, the authenti-
cation generation time is much longer than the verifying
time; while for our proposed scheme, the verifying time
is about half of the authentication generation time, except
when n = 1, the generation time is shorter than the
verification time.
• Comparing bivariate polynomial-based scheme with our
proposed scheme for n = 1, we find that the generation
time of our scheme is less than 5% of the bivariate
polynomial-based scheme for all dx, dy, but the verifying
time is slightly longer when dx, dy is less than 100. When
dx, dy is longer than 150, the verifying times of the two
schemes are comparable.
• The memory consumption of our proposed scheme is
slightly less than the bivariate polynomial-based scheme
in all scenarios.
• For our proposed scheme, to provide source privacy, the
cost of generation time and verifying time increase linearly
with n.
3) Communication overhead and message transmission de-
lay: The communication overhead is determined by the mes-
sage length. For the bivariate polynomial-based scheme, each
message is transmitted in the form of < m, MAFm(y) >,
where MAFm(y) is defined as: MAFm(y) = f(h(m), y) =
Pdy
j=0 Mjyj
. MAFm(y) is represented by its dy+1 coefficients
Mi, 2 Zp, 0 i dy, where p 2 (2l 1
, 2l
) is a large prime
number. The total length of the message is l(dy + 1).
For our scheme, the message format is:
(m, S, r1, y1, · · · , rn, yn, s), where m, s, ri, yi are all numbers
with length L = 2l. S is the ID list for all the nodes included
in the AS. Assuming the network is composed of nodes
in total, each ID will be of the length: dlog2 e. When n
nodes are included in the AS, the length of S is ndlog2 e.
Therefore, the total length of one message for our scheme is:
4l(n + 1) + ndlog2 e.
The large communication overhead of the polynomial-based
scheme will increase the energy consumption and message
delay. The simulation results in Fig. 3(a) and Fig. 3(b) demon-
strate that our proposed scheme has a much lower energy con-
sumption and message transmission delay. These simulations
were carried out in ns-2 on RedHat Linux system. The security
levels 1, 2, 3, 4 correspond to symmetric key sizes 24bit, 32bit,
40bit, 64bit, and elliptic curves key size 48bit, 64bit, 80bit,
128bit, respectively.
We also conduct simulations to compare the delivery ratios
using ns-2 on RedHat Linux system. The results show that our
scheme is slightly better than the bivariate polynomial-based
scheme in delivery ratio. The results are given in Fig. 3(c).
Our simulation on memory consumption derived in TelosB,
see Table III, shows the overall memory consumption for
bivariate polynomial-based scheme is at least 5 times larger
than our proposed scheme.
VIII. CONCLUSION
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
IEEE Transactions on Parallel and Distributed Systems,Volume:25,Issue:5,Issue Date : May.2014
9. 9
TABLE II
PROCESS TIME (S) FOR THE TWO SCHEMES (16-BIT, 4 MHZ TELOSB MOTE)
Polynomial-based approach Proposed approach
dx, dy = 80 dx, dy = 100 dx, dy = 150 n = 1 n = 10 n = 15 n = 20
Gen Verify Gen Verify Gen Verify Gen Verify Gen Verify Gen Verify Gen Verify
l = 24 9.31 0.25 14.45 0.31 31.95 0.46 0.24 0.53 4.24 2.39 6.16 3.51 8.38 4.44
l = 32 12.95 0.33 20.05 0.41 44.60 0.62 0.34 0.80 5.99 3.32 8.92 5.05 12.19 6.42
l = 40 13.32 0.35 20.57 0.44 45.73 0.65 0.46 1.05 8.03 4.44 11.94 6.71 16.18 8.50
l = 64 21.75 0.57 33.64 0.71 74.85 1.06 1.18 1.77 20.53 11.03 30.12 16.41 41.44 21.10
l = 80 26.40 0.70 41.03 0.88 90.86 1.30 1.46 2.22 25.58 13.90 37.66 20.96 50.96 26.18
TABLE III
MEMORY (KB) FOR THE TWO SCHEMES (TELOSB) (F STANDS FOR FLASH MEMORY).
Polynomial-based approach Proposed approach
dx, dy = 80 dx, dy = 100 dx, dy = 150 n = 1 n = 10 n = 15 n = 20
ROM RAM F ROM RAM F ROM RAM F ROM RAM F ROM RAM F ROM RAM F ROM RAM F
l = 24 21 3 26 21 4 40 26 4 90 21 1 0 21 2 0 21 2 0 21 2 0
l = 32 21 4 39 21 5 60 26 6 135 21 2 0 21 2 0 21 2 0 21 2 0
l = 40 21 4 39 21 5 60 26 6 135 21 2 0 21 2 0 21 2 0 21 3 0
l = 64 21 6 64 21 7 100 26 9 225 21 2 0 22 3 0 22 3 0 22 3 0
l = 80 21 7 77 21 8 120 26 10 270 20 2 0 21 3 0 21 3 0 21 4 0
1 1.5 2 2.5 3 3.5 4
1
2
3
4
5
6
7
Security Level
Energy/Joule
dx,dy = 80
dx,dy = 100
dx,dy = 150
n = 10
n = 15
n = 20
(a) Energy consumption
1 1.5 2 2.5 3 3.5 4
0
5
10
15
20
25
30
Security Level
Delay/seconds
dx,dy = 80
dx,dy = 100
dx,dy = 150
n = 10
n = 15
n = 20
(b) Message delay
1 1.5 2 2.5 3 3.5 4
0.96
0.965
0.97
0.975
0.98
0.985
0.99
0.995
1
1.005
Security Level
DeliveryRatio
dx,dy = 80
dx,dy = 100
dx,dy = 150
n = 10
n = 15
n = 20
(c) Delivery ratio
Fig. 3. Performance comparison of our proposed scheme and bivariate polynomial-based scheme.
message authentication without the weakness of the built-
in threshold of the polynomial-based scheme, we then pro-
pose 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. We compared our proposed scheme with the
bivariate polynomial-based scheme through simulations using
ns-2 and TelosB. Both theoretical and simulation results show
that, in comparable scenarios, our 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.
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.
[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] 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] 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.
[6] M. Albrecht, C. Gentry, S. Halevi, and J. Katz, “Attacking crypto-
IEEE Transactions on Parallel and Distributed Systems,Volume:25,Issue:5,Issue Date : May.2014
10. 10
graphic schemes based on ”perturbation polynomials”,” Cryptology ePrint
Archive, Report 2009/098, 2009, http://eprint.iacr.org/.
[7] 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.
[8] 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.
[9] 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.
[10] 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.
[11] D. Chaum, “Untraceable electronic mail, return addresses, and digital
pseudonyms,” Communications of the ACM, vol. 24, no. 2, pp. 84–88,
February 1981.
[12] ——, “The dinning cryptographer problem: Unconditional sender and
recipient untraceability,” Journal of Cryptology, vol. 1, no. 1, pp. 65–75,
1988.
[13] A. Pfitzmann and M. Hansen, “Anonymity, unlinkability, unobservabil-
ity, pseudonymity, and identity management a proposal for terminol-
ogy,” http://dud.inf.tu-dresden.de/literatur/Anon Terminology v0.31.pdf,
Feb. 15 2008.
[14] 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. 245–253.
[15] M. Reiter and A. Rubin, “Crowds: anonymity for web transaction,” ACM
Transactions on Information and System Security, vol. 1, no. 1, pp. 66–92,
1998.
[16] M. Waidner, “Unconditional sender and recipient untraceability in spite
of active attacks,” in Advances in Cryptology - EUROCRYPT, ser. Lecture
Notes in Computer Science Volume 434, 1989, pp. 302–319.
[17] D. Pointcheval and J. Stern, “Security arguments for digital signatures
and blind signatures,” Journal of Cryptology, vol. 13, no. 3, pp. 361–
396, 2000.
[18] L. Harn and Y. Xu, “Design of generalized ElGamal type digital signature
schemes based on discret logarithm,” Electronics Letters, vol. 30, no. 24,
pp. 2025–2026, 1994.
[19] K. Nyberg and R. A. Rueppel, “Message recovery for signature schemes
based on the discrete logarithm problem,” in Advances in Cryptology
- EUROCRYPT, ser. Lecture Notes in Computer Science Volume 950,
1995, pp. 182–193.
[20] R. Rivest, A. Shamir, and Y. Tauman, “How to leak a secret,” in Advances
in Cryptology–ASIACRYPT, ser. Lecture Notes in Computer Science, vol
2248/2001. Springer Berlin / Heidelberg, 2001.
[21] M. Bellare and P. Rogaway, “Random oracles are practical: A paradigm
for designing efficient protocols,” in CCS’93, 1993, pp. 62–73.
[22] BlueKrypt, “Cryptographic key length recommendation,” http://www.
keylength.com/en/3/.
Jian Li received the BE and MA degrees in elec-
trical engineering both from Tsinghua University in
2005 and 2008, respectively. He is currently a PhD
candidate in electrical and computer engineering at
Michigan State University. His research interests are
in cyber security, network coding and distributed
storage.
Yun Li received the BE from Xidian University in
2005, and Ph.D. degree in electrical and computer
engineering from Michigan State University in May
2010. He joined the Network Operating System Tech-
nology Group (NOSTG) of Cisco System in 2010. Dr.
Li joined the Server & Tools Division of Microsoft in
2012. His current research interests include wireless
sensor networks, network security and cloud based
data services.
Jian Ren received the BS and MS degrees both in
mathematics from Shaanxi Normal University, and
received the Ph.D. degree in EE from Xidian Uni-
versity, China. He is an Associate Professor in the
Department of ECE at Michigan State University.
His current research interests include cryptography,
network security, energy efficient sensor network se-
curity protocol design, privacy-preserving communi-
cations, and cognitive networks. He is a recipient of
the US National Science Foundation Faculty Early
Career Development (CAREER) award in 2009. Dr.
Ren is a senior member of the IEEE.
Jie Wu is the chair and a professor in the Department
of Computer and Information Sciences, Temple Uni-
versity. Prior to joining Temple University, he was
a program director at National Science Foundation.
His research interests include wireless networks and
mobile computing, routing protocols, fault-tolerant
computing, and interconnection networks. He serves
in the editorial board of the IEEE Transactions on
Computers and Journal of Parallel and Distributed
Computing. Dr. Wu is program cochair for IEEE
INFOCOM 2011. He was also general cochair for
IEEE MASS 2006, IEEE IPDPS 2008, and DCOSS 2009. He is serving as
an ACM distinguished speaker and is the chairman of the IEEE Technical
Committee on Distributed Processing (TCDP). Dr. Wu is a Fellow of the IEEE.
IEEE Transactions on Parallel and Distributed Systems,Volume:25,Issue:5,Issue Date : May.2014