Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
…
10 pages
1 file
Wireless Sensor Networks consist of small, inexpensive, low-powered sensor nodes that communicate with each other. To achieve a low communication cost in a resource constrained network, a novel concept of signcryption has been applied for secure communication. Signcryption enables a user to perform a digital signature for providing authenticity and public key encryption for providing message confidentiality simultaneously in a single logical step with a lower cost than that of the sign-then-encrypt approach. Ring signcryption maintains the signer's privacy, which is lacking in normal signcryption schemes. Signcryption can provide confidentiality and authenticity without revealing the user's identity of the ring. This paper presents the security notions and an evaluation of an ID-based ring signcryption scheme for wireless sensor networks. The scheme has been proven to be better than the existing schemes. The proposed scheme was found to be secure against adaptive chosen ciphertext ring attacks (IND-IDRSC-CCA2) and secure against an existential forgery for adaptive chosen message attacks (EF-IDRSC-ACMA). The proposed scheme was found to be more efficient than scheme for Wireless Sensor Networks reported by Qi. et al. based on the running time and energy consumption.
International Journal of Computer Networks & Communications
With the growing usage of wireless sensors in a variety of applications including Internet of Things, the security aspects of wireless sensor networks have been on priority for the researchers. Due to the constraints of resources in wireless sensor networks, it has been always a challenge to design efficient security protocols for wireless sensor networks. An novel elliptic curve signcryption based security protocol for wireless sensor networks has been presented in this paper, which provides anonymity, confidentiality, mutual authentication, forward security, secure key establishment, and key privacy at the same time providing resistance from replay attack, impersonation attack, insider attack, offline dictionary attack, and stolen-verifier attack. Results have revealed that the proposed elliptic curve signcryption based protocol consumes the least time in comparison to other protocols while providing the highest level of security.
International Journal of Sensor Networks and Data Communications, 2015
Over the past few years, the concern of security is increasing day by day. Without proper protection, any part of any network can be susceptible to attacks or unauthorized activity. Ring Signature is a type of digital signature that enable a user to sign a message so that ring of possible signers is identified without revealing exactly which member of that ring actually generated the signature. Ring signatures are completely ad-hoc in nature there is no requirement of any central authority or coordination among different users. In this paper, we review summarize the study of ring signature schemes and scrutinize their relationships with other existing cryptographic schemes and discuss the uses and the mechanism used by ring signature.
Journal of King Saud University - Computer and Information Sciences, 2014
The veracity of a message from a sensor node must be verified in order to avoid a false reaction by the sink. This verification requires the authentication of the source node. The authentication process must also preserve the privacy such that the node and the sensed object are not endangered. In this work, a ring signature was proposed to authenticate the source node while preserving its spatial privacy. However, other nodes as signers and their numbers must be chosen to preclude the possibility of a traffic analysis attack by an adversary. The spatial uncertainty increases with the number of signers but requires larger memory size and communication overhead. This requirement can breach the privacy of the sensed object. To determine the effectiveness of the proposed scheme, the location estimate of a sensor node by an adversary and enhancement in the location uncertainty with a ring signature was evaluated. Using simulation studies, the ring signature was estimated to require approximately four members from the same neighbor region of the source node to sustain the privacy of the node. Furthermore, the ring signature was also determined to have a small overhead and not to adversely affect the performance of the sensor network.
International Journal of Modern Education and Computer Science, 2014
Advancements in the domains of low-data-rate wireless networking and micro-electro-mechanical systems enabled the inception of a new networking domain, called wireless sensor network. These ad-hoc kind of networks have diversified applications in battlefield surveillance, disaster monitoring, intrusion detection etc. These networks consist plethora of sensor nodes which are severely resource constrained. As the application of the wireless sensor network is increasing, there is an emerging need for the security and privacy scheme which makes the network secure from various attacks and hide the ongoing activities in the network from a non-network entity. Privacy in wireless sensor network is yet a challenging domain to work on. Lot of work has been done to ensure privacy in the network. These relate to provide privacy in terms of the network entity and the privacy of the sensed information. Most of the solutions till date is based upon routing in the network layer, random walk based flooding, dummy data injection and cross layer solutions. Each of the schemes induce some overhead in the network. A light weight scheme is always desired for resource constraint wireless sensor networks. In this work we will propose a scheme which assures the privacy of the nodes in the network along with the privacy of the event generated in the network through a self organizing scheme. Through various simulation results the validity of our scheme among different network scenarios will be shown. We will also prove through graphical results that our proposed scheme enhances network lifetime quite satisfactorily.
Int. J. Netw. Secur., 2014
This paper describes an efficient and secure online and off-line signature scheme for wireless sensor network (WSN). Security of the proposed scheme is based on difficulty of breaking Bilinear Diffie-Hellman problem (BDHP). WSN systems are usually deployed in hostile environments where they encounter a wide variety of malicious attacks. Information that is the cooked data collected within the sensor network, is valuable and should be kept confidential. In order to protect this transmitted information or messages between any two adjacent sensor nodes, a mutual authentication and key establishment protocol is required for wireless sensor networks. Because some inherent restrictions of sensor nodes which include low power, less storage space, low computation ability and short communication range most existing protocols attempt to establish a pairwise key between any two adjacent sensor nodes by adopting a key pre-distribution approach. In order to further reduce the computational cost ...
In wireless sensor networks (WSNs), secure data transmission is a critical problem. System performance should be increased by Clustering technique. This survey introduces two secure and efficient data transmission (SET) protocols for CWSNs, called SET-IBS and SET-IBOOS. The SET-IBS scheme using the identity-based digital signature (IBS) scheme and SET-IBOOS scheme using the identity-based online/ offline digital signature (IBOOS) scheme, respectively. In SET-IBS scheme security based on the difficulties of the Diffie-Hellman problem in the pairing domain. SET-IBOOS additionally reduces the computational overhead for protocol security, which is critical for WSNs. In SET-IBOOS security relies on the hardness of the discrete logarithm problem. The survey show that the SET-IBS SET-IBOOS protocols have better performance than the existing LEACH ,LEACH LIKE PROTOCOLS for CWSNs, in terms of security overhead and energy consumption.
The concept of forward secrecy is extended to wireless sensor networks where it is frequent that nodes run out of energy and new nodes join the network. However it should not be able to retrieve the previous session key or some crucial information. In 2011 Hagras et al. proposed a key management scheme for heterogeneous wireless sensor networks, which satisfies confidentiality, authentication, integrity and unforgeability but lacks forward secrecy. In this paper, the shortcomings of the victim scheme has been extricated and repaired with the help of Elliptic Curve Discrete logarithm problem (ECDLP). An elliptic curve based signcryption key management scheme has been proposed which includes forward secrecy.
Computer and Information …, 2010
In Wireless Sensor Networks (WSNs), authentication is a crucial security requirement to avoid attacks against secure communication, and to mitigate DoS attacks exploiting the limited resources of sensor nodes. Resource constraints of sensor nodes are hurdles in applying strong public key cryptographic based mechanisms in WSNs. To address the problem of authentication in WSNs, we propose an efficient and secure framework for authenticated broadcast/multicast by sensor nodes as well as for outside user authentication, which utilizes identity based cryptography and online/offline signature schemes. The primary goals of this framework are to enable all sensor nodes in the network, firstly, to broadcast and/or multicast an authenticated message quickly; secondly, to verify the broadcast/multicast message sender and the message contents; and finally, to verify the legitimacy of an outside user. The proposed framework is also evaluated using the most efficient and secure identity-based signature schemes.
IJSRD, 2013
Authentication in Wireless Sensor Networks (WSNs) is a challenging process. Providing authentication for the Nodes in WSN is a vital issue in Secure Group communication among WSNs. Massive group of tiny sensor Nodes forms WSNs and these are placed in open, unattended milieu. Due to this reason, Nodes in WSN can endure exclusive encounters. WSNs are more vulnerable to active and passive attacks than wired ones due to their broadcasting nature, limitations in resources and unrestrained environments. However, security will be a significant factor for their complete implementation. In this proposal, a new approach has been introduced to achieve secure authentication among Nodes in WSNs.
IEEE Systems Journal, 2017
Internet of Things (IoT) consists of scenarios in which real-world appliances, objects, animals or people with unique identifiers transfer data over an insecure wireless network to accomplish specific tasks without any physical interaction. To achieve the specified goal, wireless sensor networks (WSNs) are usually connected to the Internet and integrated as part of the IoT. In such environments, how to send a message securely from a sensor to an Internet host becomes an important issue for the successful functioning of the IoT. In this paper, a new, efficient, heterogeneous online/offline signcryption scheme is proposed. This scheme achieves the security goals of confidentiality, integrity, authentication, and nonrepudiation in a logical single step. In particular, its structure allows a sensor node in an identity-based cryptography (IBC) setup to send a message to an Internet host in a public key infrastructure (PKI) such that the heavy verification loads on low-power devices are mitigated. The proposed signcryption scheme is divided into the offline and the online signcrypt stages for further load mitigation. The first stage handles most part of computations in generating a ciphertext before knowing the message. Only a few operations are left for the second stage when the messages show up. This scheme is indistinguishable against adaptive chosen-ciphertext attacks under the computational Diffie-Hellman assumption, and is unforgeable against adaptive chosen-message attacks under the elliptic curve discrete logarithm assumption. As compared with other related works, the proposed scheme has lower computation costs on both the sensor and the host sides and is more power efficient and scalable for various IoT scenarios.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Lecture Notes in Computer Science, 2005
International Journal of Electrical and Computer Engineering (IJECE), 2020
KSII Transactions on Internet and Information Systems, 2012
Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, 2010
19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers), 2005
IJARCCE, 2017