Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
SOM-PAD: Novel Data Security Algorithm on Self Organizing Map cscpconf
Data security is one of major challenges in the recent literature. Cryptography is the most
common phenomena used to secure data. One main aspect in cryptography is creating a hard to
guess cipher. Artificial Neural Networks (ANN) is one of the machine learning techniques
widely employed in several fields based on its characters, depending on the application area.
One of these fields is data security. The state of art in this paper is the use of self organizing
map (SOM) algorithm concept as a core idea to construct a pad; this pad is used to generate the
cipher at one end. At the other end of communication the same process is synchronized to
generate the same pad as the deciphering key. The security of the proposed model depends on
the complex nature of ANN's. The algorithm could be categorized under symmetric
cryptography, merging both stream and block cipher. A modified version of the same algorithm
also presented employs permutation and variable SOM neighborhoods. The proposal can be
applied over several file formats like videos, images, text files, data benchmarks, etc as show in
experimental results
A SURVEY ON RECENT APPROACHES COMBINING CRYPTOGRAPHY AND STEGANOGRAPHYcsandit
Digital communication witnesses a noticeable and continuous development in many
applications in the Internet. Hence, a secure communication sessions must be provided. The
security of data transmitted across a global network has turned into a key factor on the network
performance measures. Cryptography and steganography are two important techniques that are
used to provide network security. In this paper, we conduct a comparative study of
steganography and cryptography. We survey a number of methods combining cryptography and
steganography techniques in one system. Moreover, we present a classification of these
methods, and compare them in terms of the algorithm used for encryption, the steganography
technique and the file type used for covering the information.
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of
DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of
Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher.
5 ijaems jan-2016-16-survey on encryption techniques in delay and disruption ...INFOGAIN PUBLICATION
Delay and disruption tolerant network (DTN) is used for long area communication in computer network, where there is no direct connection between the sender and receiver and there was no internet facility. Delay tolerant network generally perform store and forward techniques as a result intermediate node can view the message, the possible solution is using encryption techniques to protect the message. Starting stages of DTN RSA, DES, 3DES encryption algorithms are used but now a day’s attribute based encryption (ABE) techniques are used. Attribute based encryption technique can be classified in to two, key policy attribute based encryption (KPABE) and cipher policy attribute based encryption (CPABE). In this paper we perform a categorized survey on different encryption techniques presents in delay tolerant networks. This categorized survey is very helpful for researchers to propose modified encryption techniques. Finally the paper compares the performance and effectiveness of different encryption algorithms.
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
Wireless sensor network promises ubiquitous data
collection and processing for variety of commercial, healthcare
and military applications. Practical realization of WSN
applications is possible only after assuring network security.
Cryptographic key distribution is an important phase in
network security which establishes initial trust in the network.
Security protocol implementation in WSN is limited by
resource constrained nature of sensor nodes. The key
distribution algorithm satisfying security requirements of
given WSN application should be implemented with minimum
communication and memory overhead. As a solution to this
problem, hierarchical key management technique is proposed
in this paper. Symmetric key pre-distribution technique with
less computational overhead and ID-based asymmetric key
(IBK) distribution technique with less communication
overhead are applied simultaneously in the network at
different levels. Resilience strength and resource overhead of
the proposed scheme is compared with both symmetric and
asymmetric techniques.
Cryptography is a process used for sending information in secret way. Goal of this process is to provide protection for information but in different way. In this paper our motive to represent a new method for protection that is generated by combination of RSA and 2 bit rotation mechanism of cryptography. There are many algorithms exist for this process. For cryptography there are algorithms like RSA, IDEA, AES, and DES but here we are using only one algorithm from these that is RSA which is enough to implement combined process using 2 bit rotation. The encrypted image is used as input for network for further implementation.RSA encrypt image with 1 bit rotation. In 1 bit rotation only 1 bit is shifted and at decrypt side shifted bit are reversed. But to make it more secure we are going to perform 2 bit rotation due to which it is more secure as compared to existing algorithm. After applying the 2 bit rotation we perform the permutation of that image that will give us encrypted image. Shivam Kumar | Dr. Ganesh D "Image Cryptography using RSA Algorithm" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd42408.pdf Paper URL: https://www.ijtsrd.comcomputer-science/computer-security/42408/image-cryptography-using-rsa-algorithm/shivam-kumar
SOM-PAD: Novel Data Security Algorithm on Self Organizing Map cscpconf
Data security is one of major challenges in the recent literature. Cryptography is the most
common phenomena used to secure data. One main aspect in cryptography is creating a hard to
guess cipher. Artificial Neural Networks (ANN) is one of the machine learning techniques
widely employed in several fields based on its characters, depending on the application area.
One of these fields is data security. The state of art in this paper is the use of self organizing
map (SOM) algorithm concept as a core idea to construct a pad; this pad is used to generate the
cipher at one end. At the other end of communication the same process is synchronized to
generate the same pad as the deciphering key. The security of the proposed model depends on
the complex nature of ANN's. The algorithm could be categorized under symmetric
cryptography, merging both stream and block cipher. A modified version of the same algorithm
also presented employs permutation and variable SOM neighborhoods. The proposal can be
applied over several file formats like videos, images, text files, data benchmarks, etc as show in
experimental results
A SURVEY ON RECENT APPROACHES COMBINING CRYPTOGRAPHY AND STEGANOGRAPHYcsandit
Digital communication witnesses a noticeable and continuous development in many
applications in the Internet. Hence, a secure communication sessions must be provided. The
security of data transmitted across a global network has turned into a key factor on the network
performance measures. Cryptography and steganography are two important techniques that are
used to provide network security. In this paper, we conduct a comparative study of
steganography and cryptography. We survey a number of methods combining cryptography and
steganography techniques in one system. Moreover, we present a classification of these
methods, and compare them in terms of the algorithm used for encryption, the steganography
technique and the file type used for covering the information.
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of
DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of
Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher.
5 ijaems jan-2016-16-survey on encryption techniques in delay and disruption ...INFOGAIN PUBLICATION
Delay and disruption tolerant network (DTN) is used for long area communication in computer network, where there is no direct connection between the sender and receiver and there was no internet facility. Delay tolerant network generally perform store and forward techniques as a result intermediate node can view the message, the possible solution is using encryption techniques to protect the message. Starting stages of DTN RSA, DES, 3DES encryption algorithms are used but now a day’s attribute based encryption (ABE) techniques are used. Attribute based encryption technique can be classified in to two, key policy attribute based encryption (KPABE) and cipher policy attribute based encryption (CPABE). In this paper we perform a categorized survey on different encryption techniques presents in delay tolerant networks. This categorized survey is very helpful for researchers to propose modified encryption techniques. Finally the paper compares the performance and effectiveness of different encryption algorithms.
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
Wireless sensor network promises ubiquitous data
collection and processing for variety of commercial, healthcare
and military applications. Practical realization of WSN
applications is possible only after assuring network security.
Cryptographic key distribution is an important phase in
network security which establishes initial trust in the network.
Security protocol implementation in WSN is limited by
resource constrained nature of sensor nodes. The key
distribution algorithm satisfying security requirements of
given WSN application should be implemented with minimum
communication and memory overhead. As a solution to this
problem, hierarchical key management technique is proposed
in this paper. Symmetric key pre-distribution technique with
less computational overhead and ID-based asymmetric key
(IBK) distribution technique with less communication
overhead are applied simultaneously in the network at
different levels. Resilience strength and resource overhead of
the proposed scheme is compared with both symmetric and
asymmetric techniques.
Cryptography is a process used for sending information in secret way. Goal of this process is to provide protection for information but in different way. In this paper our motive to represent a new method for protection that is generated by combination of RSA and 2 bit rotation mechanism of cryptography. There are many algorithms exist for this process. For cryptography there are algorithms like RSA, IDEA, AES, and DES but here we are using only one algorithm from these that is RSA which is enough to implement combined process using 2 bit rotation. The encrypted image is used as input for network for further implementation.RSA encrypt image with 1 bit rotation. In 1 bit rotation only 1 bit is shifted and at decrypt side shifted bit are reversed. But to make it more secure we are going to perform 2 bit rotation due to which it is more secure as compared to existing algorithm. After applying the 2 bit rotation we perform the permutation of that image that will give us encrypted image. Shivam Kumar | Dr. Ganesh D "Image Cryptography using RSA Algorithm" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd42408.pdf Paper URL: https://www.ijtsrd.comcomputer-science/computer-security/42408/image-cryptography-using-rsa-algorithm/shivam-kumar
A Trust Conscious Secure Route Data Communication in MANETSCSCJournals
Security in mobile adhoc networks is difficult to achieve, notably because of the vulnerability of wireless links, the limited physical protection of nodes, the dynamically changing topology, the absence of a certification authority, and the lack of a centralized monitoring or management point. The major difficulty in adhoc network occurs when a new node join network but not having any trusts relation with other node of network. We have proposed a new mechanism that provides trust conscious and secure data communication between the nodes. In this mechanism we will dynamically increase the trust from (Low to High) between the mobile nodes using proxy node. When mobile node needs secure data communication, it will generate a dynamic secret session key with the desired destination mobile node directly or via proxy mobile node. These dynamic secret session keys are generated using message digest and Diffie-Hellmann protocol.
Different date block size using to evaluate the performance between different...IJCNCJournal
The different computer networks whether wired or wireless are becoming more popular with its high
security aspect. Different security algorithms and technique are using to avoid any aforementioned attacks.
One of these technique is a cryptography technique that makes the data as unreadable during the transfer
hence; there is no chance to reclaim the information. Presently, most of the users are using various media
types and internet to transfer the data but, it has the chance to retrieve the data by using these media types.
The perfect solution for this problem is to provide security on time-to-time basis; this stage is always
significant to the security related community discussions. This paper explains the comparison between the
run time of three different encryption algorithms which are DES, AES and Blowfish The compression
includes using different modes, data block size and different operation modes. As a result, Blowfish
algorithm followed by AES take less time for running compared to DES.
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
SECURED TEXT MESSAGE TRANSMISSION IN A WIRELESS COMMUNICATION SYSTEM WITH THE...caijjournal
A broad variety of wireless data applications and services depend on security. This paper presents a
simulation-based study of a wireless communication system using a secured Vigenere cipher and the RSA
cryptographic algorithms on text message transmission. The system under consideration uses 1/2-rated
CRC channel coding and BPSK digital modulation over an Additive White Gaussian noise (AWGN)
channel. To address security concerns, a text message is encrypted at the transmitter with the Vigenere
cipher and RSA before being decrypted and compared for different levels of SNR at the receiver end. To
carry out the computer simulation, the Matlab 2016a programming language has been used. The
transmitted text message is successfully retrieved at the receiver end after the Vigenere cipher and the RSA
cryptographic algorithm are implemented. It is also anticipated that as noise power increases, the
effectiveness of a wireless communication system based on the Vigenere cipher and RSA security will
decrease.
RSA and RC4 Cryptosystem Performance Evaluation Using Image and TextYekini Nureni
The process of transforming plaintext data into cipher text in order to conceal its meaning in case it fall to hand of unauthorized recipient is refers to as encryption. The systems that perform the encryption processes are known as cryptosystems, there are several cryptosystem algorithms: RSA, RC4, DES, 3DES, Blowfish, AES, IDEA, Skipjack, DSA, ElGamal, etc. The major features that identify and differentiate one cryptosystem algorithm from another are its ability to secure the protected data against attacks and its speed/efficiency. In this paper: application software was designed to implement RSA, and RCA encryption algorithms with advanced features of visual Basic 6 for the front end interface. Microsoft Access is used to design backend of the application, and the Macromedia Flash was also used to incorporate dynamic features that enhance the appearance of the application. The program was used to compare the performance of RSA and RC4. The encryption operation was carried out for both RSA and RC4 using five text files and five graphic files of different sizes 10, 50, 100, 150, and 200 kilobyte respectively. The major factor considered for measuring the performance of the algorithms (RSA and RC4) is the speed of execution using time of execution (TE) as parameter for the evaluation. The performance result was presented and analyzed. We discovered that the RC4 is better compare to RSA algorithm based on the experimental facts presented and the result analysis of the two evaluated algorithms.
An efficient approach for secured communication in wireless sensor networks IJECEIAES
Wireless sensor network (WSN) have limited bandwidth, low computational functions, energy constraints. Inspite of these constraints, WSN is useful where communication happens without infrastructure support. The main concern of WSN is the security as the sensor nodes may be attacked and information may be hacked. Security of WSN should have the capability to ensure that the message received was sent by the particular sent node and not modified during transmission. WSN applications require lightweight and strong authentication mechanisms for obtaining data from unprivileged users. In wireless sensor networks, authentication is the effective method to stop unauthorized and undisrupted communication service. In order to strengthen the authenticated communication, several researchers have developed mechanisms. Some of the techniques work with identifying the attacked node or detecting injected bogus message in the network. Encryption and decryption are the popular methods of providing the security. These are based on either public-key or symmetric-key cryptosystems.Many of the existing solutions have limitations in communication and computational expertise. Also, the existing mechanisms lack in providing strength and scalability of the network. In order address these issues; a polynomial based method was introduced in recent days. Key distribution is a significant aspect in key management in WSNs. The simplest method of distribution of key is by hand which was used in the days of couriers. Now a day, most distribution of keys is done automatically. The automatic distribution of keys is essential and convenient in networks that require two parties to transmit their security keys in the same communication medium. In this work, a new type of key exchange mechanism is proposed. The proposed method for authentication among sensor nodes proves to be promising as per the simulation results. The nodes which are unknown to each other setup a private however arbitrary key for the symmetric key cryptosystem.
Mobile Ad hoc Network is a collection of wireless mobile nodes forming a network without
using any existing infrastructure. MANET is a collection of mobile nodes along with wireless
transmitter and receiver that with each other via a bi-directional links either directly or indirectly. A
new intrusion detection system named communicates Enhanced Adaptive Acknowledgment
(EAACK) specially designed for MANETs. It is based on the digital signature algorithm (DSA). To
enhance the security in the mobile adhoc networks, we introduce a new approach called Hybrid
cryptography algorithm that provides integrity, confidentiality and authentication. This hybrid
cryptography algorithm is based on two cryptography algorithms such as RSA and AES. Encryption is
achieved by using, RSA algorithm for authentication and symmetric algorithm for the integrity. By
using the symmetric and asymmetric cryptographic algorithm, we can achieve better security and
integrity than the EAACK
Review on Encrypted Image with Hidden Data Using AES AlgorithmEECJOURNAL
Steganography is the art of hiding the fact where communication is taking place, by hiding information in other information. Steganography becomes more important as more people join the cyberspace revolution. . In contrast to cryptography, it is not to keep others from knowing the hidden information but it is to keep others from thinking that the information even exists. Steganography include an array of secret communication methods that hide the message from being seen or discovered. Many different carrier file formats can be used, but digital images are the most popular because of their frequency on the internet. For hiding secret information in images, there exists a large variety of steganography techniques some are more complex than others and all of them have respective strong and weak points. Different applications may require absolute invisibility of the secret information, while others require a large secret message to be hidden. This project report intends to give an overview of image steganography, its uses and techniques. In addition to this our project also adds security to both the data hidden and the image that carries the information. Security is provided by Encrypting the data that is sent in the image and again encrypting the image that carries the information using AES algorithm. This encryption of the data and image thus provides double security layer.
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
Creation of smart spaces and scaling of devices to achieve miniaturization in pervasive computing environments has put forth a question on the degree of security of such devices. Security being a unique challenge in such environments, solution demands scalability, access control, heterogeneity, trust. Most of the existing cryptographic solutions widely in use rely on the hardness of factorization and number theory
problems. With the increase in cryptanalytic attacks these schemes will soon become insecure. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this work, we discuss the aspects of Lattice based cryptography as a new dimension of providing security whose strength lies in the hardness of lattice problems. We discuss about a cryptosystem whose security relies on high lattice dimension.
Analysis of Cryptographic Algorithms for Network SecurityEditor IJCATR
Cryptography plays a major role in securing data. It is used to ensure that the contents of a message are confidentially
transmitted and would not be altered. Network security is most vital component in information security as it refers to all hardware and
software function, characteristics, features, operational procedures, accountability, access control, and administrative and management
policy. Cryptography is central to IT security challenges, since it underpins privacy, confidentiality and identity, which together
provide the fundamentals for trusted e-commerce and secure communication. There is a broad range of cryptographic algorithms that
are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving
more advanced techniques for secures communication.
Secure key exchange and encryption mechanism for group communication in wirel...graphhoc
Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active interfering. The lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. Nodes act both as hosts and routers and are interconnected by Multi- hop communication path for forwarding and receiving packets to/from other nodes. The objective of this paper is to propose a key exchange and encryption mechanism that aims to use the MAC address as an additional parameter as the message specific key[to encrypt]and forward data among the nodes. The nodes are organized in spanning tree fashion, as they avoid forming cycles and exchange of key occurs only with authenticated neighbors in ad hoc networks, where nodes join or leave the network dynamically.
WIRELESS SENSORS INTEGRATION INTO INTERNET OF THINGS AND THE SECURITY PRIMITIVEScsandit
The common vision of smart systems today, is by and large associated with one single concept,
the internet of things (IoT), where the whole physical infrastructure is linked with intelligent
monitoring and communication technologies through the use of wireless sensors. In such an
intelligent vibrant system, sensors are connected to send useful information and control
instructions via distributed sensor networks. Wireless sensors have an easy deployment and
better flexibility of devices contrary to wired setup. With the rapid technological development of
sensors, wireless sensor networks (WSNs) will become the key technology for IoT and an
invaluable resource for realizing the vision of Internet of things (IoT) paradigm. It is also
important to consider whether the sensors of a WSN should be completely integrated into IoT or
not. New security challenges arise when heterogeneous sensors are integrated into the IoT. Security needs to be considered at a global perspective, not just at a local scale. This paper gives an overview of sensor integration into IoT, some major security challenges and also a
number of security primitives that can be taken to protect their data over the internet.
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
A Trust Conscious Secure Route Data Communication in MANETSCSCJournals
Security in mobile adhoc networks is difficult to achieve, notably because of the vulnerability of wireless links, the limited physical protection of nodes, the dynamically changing topology, the absence of a certification authority, and the lack of a centralized monitoring or management point. The major difficulty in adhoc network occurs when a new node join network but not having any trusts relation with other node of network. We have proposed a new mechanism that provides trust conscious and secure data communication between the nodes. In this mechanism we will dynamically increase the trust from (Low to High) between the mobile nodes using proxy node. When mobile node needs secure data communication, it will generate a dynamic secret session key with the desired destination mobile node directly or via proxy mobile node. These dynamic secret session keys are generated using message digest and Diffie-Hellmann protocol.
Different date block size using to evaluate the performance between different...IJCNCJournal
The different computer networks whether wired or wireless are becoming more popular with its high
security aspect. Different security algorithms and technique are using to avoid any aforementioned attacks.
One of these technique is a cryptography technique that makes the data as unreadable during the transfer
hence; there is no chance to reclaim the information. Presently, most of the users are using various media
types and internet to transfer the data but, it has the chance to retrieve the data by using these media types.
The perfect solution for this problem is to provide security on time-to-time basis; this stage is always
significant to the security related community discussions. This paper explains the comparison between the
run time of three different encryption algorithms which are DES, AES and Blowfish The compression
includes using different modes, data block size and different operation modes. As a result, Blowfish
algorithm followed by AES take less time for running compared to DES.
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
SECURED TEXT MESSAGE TRANSMISSION IN A WIRELESS COMMUNICATION SYSTEM WITH THE...caijjournal
A broad variety of wireless data applications and services depend on security. This paper presents a
simulation-based study of a wireless communication system using a secured Vigenere cipher and the RSA
cryptographic algorithms on text message transmission. The system under consideration uses 1/2-rated
CRC channel coding and BPSK digital modulation over an Additive White Gaussian noise (AWGN)
channel. To address security concerns, a text message is encrypted at the transmitter with the Vigenere
cipher and RSA before being decrypted and compared for different levels of SNR at the receiver end. To
carry out the computer simulation, the Matlab 2016a programming language has been used. The
transmitted text message is successfully retrieved at the receiver end after the Vigenere cipher and the RSA
cryptographic algorithm are implemented. It is also anticipated that as noise power increases, the
effectiveness of a wireless communication system based on the Vigenere cipher and RSA security will
decrease.
RSA and RC4 Cryptosystem Performance Evaluation Using Image and TextYekini Nureni
The process of transforming plaintext data into cipher text in order to conceal its meaning in case it fall to hand of unauthorized recipient is refers to as encryption. The systems that perform the encryption processes are known as cryptosystems, there are several cryptosystem algorithms: RSA, RC4, DES, 3DES, Blowfish, AES, IDEA, Skipjack, DSA, ElGamal, etc. The major features that identify and differentiate one cryptosystem algorithm from another are its ability to secure the protected data against attacks and its speed/efficiency. In this paper: application software was designed to implement RSA, and RCA encryption algorithms with advanced features of visual Basic 6 for the front end interface. Microsoft Access is used to design backend of the application, and the Macromedia Flash was also used to incorporate dynamic features that enhance the appearance of the application. The program was used to compare the performance of RSA and RC4. The encryption operation was carried out for both RSA and RC4 using five text files and five graphic files of different sizes 10, 50, 100, 150, and 200 kilobyte respectively. The major factor considered for measuring the performance of the algorithms (RSA and RC4) is the speed of execution using time of execution (TE) as parameter for the evaluation. The performance result was presented and analyzed. We discovered that the RC4 is better compare to RSA algorithm based on the experimental facts presented and the result analysis of the two evaluated algorithms.
An efficient approach for secured communication in wireless sensor networks IJECEIAES
Wireless sensor network (WSN) have limited bandwidth, low computational functions, energy constraints. Inspite of these constraints, WSN is useful where communication happens without infrastructure support. The main concern of WSN is the security as the sensor nodes may be attacked and information may be hacked. Security of WSN should have the capability to ensure that the message received was sent by the particular sent node and not modified during transmission. WSN applications require lightweight and strong authentication mechanisms for obtaining data from unprivileged users. In wireless sensor networks, authentication is the effective method to stop unauthorized and undisrupted communication service. In order to strengthen the authenticated communication, several researchers have developed mechanisms. Some of the techniques work with identifying the attacked node or detecting injected bogus message in the network. Encryption and decryption are the popular methods of providing the security. These are based on either public-key or symmetric-key cryptosystems.Many of the existing solutions have limitations in communication and computational expertise. Also, the existing mechanisms lack in providing strength and scalability of the network. In order address these issues; a polynomial based method was introduced in recent days. Key distribution is a significant aspect in key management in WSNs. The simplest method of distribution of key is by hand which was used in the days of couriers. Now a day, most distribution of keys is done automatically. The automatic distribution of keys is essential and convenient in networks that require two parties to transmit their security keys in the same communication medium. In this work, a new type of key exchange mechanism is proposed. The proposed method for authentication among sensor nodes proves to be promising as per the simulation results. The nodes which are unknown to each other setup a private however arbitrary key for the symmetric key cryptosystem.
Mobile Ad hoc Network is a collection of wireless mobile nodes forming a network without
using any existing infrastructure. MANET is a collection of mobile nodes along with wireless
transmitter and receiver that with each other via a bi-directional links either directly or indirectly. A
new intrusion detection system named communicates Enhanced Adaptive Acknowledgment
(EAACK) specially designed for MANETs. It is based on the digital signature algorithm (DSA). To
enhance the security in the mobile adhoc networks, we introduce a new approach called Hybrid
cryptography algorithm that provides integrity, confidentiality and authentication. This hybrid
cryptography algorithm is based on two cryptography algorithms such as RSA and AES. Encryption is
achieved by using, RSA algorithm for authentication and symmetric algorithm for the integrity. By
using the symmetric and asymmetric cryptographic algorithm, we can achieve better security and
integrity than the EAACK
Review on Encrypted Image with Hidden Data Using AES AlgorithmEECJOURNAL
Steganography is the art of hiding the fact where communication is taking place, by hiding information in other information. Steganography becomes more important as more people join the cyberspace revolution. . In contrast to cryptography, it is not to keep others from knowing the hidden information but it is to keep others from thinking that the information even exists. Steganography include an array of secret communication methods that hide the message from being seen or discovered. Many different carrier file formats can be used, but digital images are the most popular because of their frequency on the internet. For hiding secret information in images, there exists a large variety of steganography techniques some are more complex than others and all of them have respective strong and weak points. Different applications may require absolute invisibility of the secret information, while others require a large secret message to be hidden. This project report intends to give an overview of image steganography, its uses and techniques. In addition to this our project also adds security to both the data hidden and the image that carries the information. Security is provided by Encrypting the data that is sent in the image and again encrypting the image that carries the information using AES algorithm. This encryption of the data and image thus provides double security layer.
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
Creation of smart spaces and scaling of devices to achieve miniaturization in pervasive computing environments has put forth a question on the degree of security of such devices. Security being a unique challenge in such environments, solution demands scalability, access control, heterogeneity, trust. Most of the existing cryptographic solutions widely in use rely on the hardness of factorization and number theory
problems. With the increase in cryptanalytic attacks these schemes will soon become insecure. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this work, we discuss the aspects of Lattice based cryptography as a new dimension of providing security whose strength lies in the hardness of lattice problems. We discuss about a cryptosystem whose security relies on high lattice dimension.
Analysis of Cryptographic Algorithms for Network SecurityEditor IJCATR
Cryptography plays a major role in securing data. It is used to ensure that the contents of a message are confidentially
transmitted and would not be altered. Network security is most vital component in information security as it refers to all hardware and
software function, characteristics, features, operational procedures, accountability, access control, and administrative and management
policy. Cryptography is central to IT security challenges, since it underpins privacy, confidentiality and identity, which together
provide the fundamentals for trusted e-commerce and secure communication. There is a broad range of cryptographic algorithms that
are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving
more advanced techniques for secures communication.
Secure key exchange and encryption mechanism for group communication in wirel...graphhoc
Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active interfering. The lack of any central coordination and shared wireless medium makes them more vulnerable to attacks than wired networks. Nodes act both as hosts and routers and are interconnected by Multi- hop communication path for forwarding and receiving packets to/from other nodes. The objective of this paper is to propose a key exchange and encryption mechanism that aims to use the MAC address as an additional parameter as the message specific key[to encrypt]and forward data among the nodes. The nodes are organized in spanning tree fashion, as they avoid forming cycles and exchange of key occurs only with authenticated neighbors in ad hoc networks, where nodes join or leave the network dynamically.
WIRELESS SENSORS INTEGRATION INTO INTERNET OF THINGS AND THE SECURITY PRIMITIVEScsandit
The common vision of smart systems today, is by and large associated with one single concept,
the internet of things (IoT), where the whole physical infrastructure is linked with intelligent
monitoring and communication technologies through the use of wireless sensors. In such an
intelligent vibrant system, sensors are connected to send useful information and control
instructions via distributed sensor networks. Wireless sensors have an easy deployment and
better flexibility of devices contrary to wired setup. With the rapid technological development of
sensors, wireless sensor networks (WSNs) will become the key technology for IoT and an
invaluable resource for realizing the vision of Internet of things (IoT) paradigm. It is also
important to consider whether the sensors of a WSN should be completely integrated into IoT or
not. New security challenges arise when heterogeneous sensors are integrated into the IoT. Security needs to be considered at a global perspective, not just at a local scale. This paper gives an overview of sensor integration into IoT, some major security challenges and also a
number of security primitives that can be taken to protect their data over the internet.
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
Robust Visual Tracking Based on Sparse PCA-L1csandit
Recently, visual tracking based on sparse principle component analysis has drawn much
research attention. As we all know, principle component analysis (PCA) is widely used in data
processing and dimensionality reduction. But PCA is difficult to interpret in practical
application and all those principal components are linear combinations of all variables. In our
paper, a novel visual tracking method based on sparse principal component analysis and L1
tracking is introduced, which we named the method SPCA-L1 tracking. We firstly introduce
trivial templates of L1 tracking method, which are used to describe noise, into PCA appearance
model. Then we use lasso model to achieve sparse coefficients. Then we update the eigenbasis
and mean incrementally to make the method robust when solving different kinds of changes of
the target. Numerous experiments, where the targets undergo large changes in pose, scale and
illumination, demonstrate the effectiveness and robustness of the proposed method.
Basic Evaluation of Antennas Used in Microwave Imaging for Breast Cancer Dete...csandit
Microwave imaging is one of the most promising techniques in diagnosis and screening of
breast cancer and in the medical field that currently under development. It is nonionizing,
noninvasive, sensitive to tumors, specific to cancers, and low-cost. Microwave measurements
can be carried out either in frequency domain or in time domain. In order to develop a
clinically viable medical imaging system, it is important to understand the characteristics of the
microwave antenna. In this paper we investigate some antenna characteristics and discuss
limitations of existing and proposed systems.
CREATING DATA OUTPUTS FROM MULTI AGENT TRAFFIC MICRO SIMULATION TO ASSIMILATI...csandit
The intensive development of traffic engineering and technologies that are integrated into
vehicles, roads and their surroundings, bring opportunities of real time transport mobility
modeling. Based on such model it is then possible to establish a predictive layer that is capable
of predicting short and long term traffic flow behavior. It is possible to create the real time
model of traffic mobility based on generated data. However, data may have different
geographical, temporal or other constraints, or failures. It is therefore appropriate to develop
tools that artificially create missing data, which can then be assimilated with real data. This
paper presents a mechanism describing strategies of generating artificial data using
microsimulations. It describes traffic microsimulation based on our solution of multiagent
framework over which a system for generating traffic data is built. The system generates data of
a structure corresponding to the data acquired in the real world.
EVALUATION AND STUDY OF SOFTWARE DEGRADATION IN THE EVOLUTION OF SIX VERSIONS...csandit
When a software system evolves, new requirements may be added, existing functionalities
modified, or some structural change introduced. During such evolution, disorder may be
introduced, complexity increased or unintended consequences introduced, producing rippleeffect
across the system. JHotDraw (JHD), a well-tested and widely used open source Javabased
graphics framework developed with the best software engineering practice was selected
as a test suite. Six versions were profiled and data collected dynamically, from which two metrics were derived namely entropy and software maturity index. These metrics were used to investigate degradation as the software transitions from one version to another. This study observed that entropy tends to decrease as the software evolves. It was also found that a
software product attains its lowest decrease in entropy at the turning point where its highest maturity index is attained, implying a possible correlation between the point of lowest decreasein entropy and software maturity index.
Explore the Effects of Emoticons on Twitter Sentiment Analysis csandit
In recent years, Twitter Sentiment Analysis (TSA) has become a hot research topic. The target of
this task is to analyse the sentiment polarity of the tweets. There are a lot of machine learning
methods specifically developed to solve TSA problems, such as fully supervised method,
distantly supervised method and combined method of these two. Considering the specialty of
tweets that a limitation of 140 characters, emoticons have important effects on TSA. In this
paper, we compare three emoticon pre-processing methods: emotion deletion (emoDel),
emoticons 2-valued translation (emo2label) and emoticon explanation (emo2explanation).
Then, we propose a method based on emoticon-weight lexicon, and conduct experiments based
on Naive Bayes classifier, to validate the crucial role emoticons play on guiding emotion
tendency in a tweet. Experiments on real data sets demonstrate that emoticons are vital to TSA.
Exploring The Dynamic Integration of Heterogeneous Services csandit
The increase need for services to handle a plethora of business needs within the enterprise
landscape has yielded to an increase in the development of heterogeneous services across the
digital world. In today’s digital economy, services are the key components for communication
and collaboration amongst enterprises internally and externally. Since Internet has stimulated
the use of services, different services have been developed for different purposes prompting
those services to be heterogeneous due to incompatibles approaches relied upon at both
conceptual and exploitation phases. The proliferation of developed heterogeneous services in
the digital world therefore comes along with a range of challenges more precisely in the
integration layer. Traditionally, integration is achieved by using gateways, which require
considerable configuration effort. Many approaches and frameworks have been developed by
different researchers to overcome these challenges, but up to date the challenges of integration
heterogeneous services with minimal user-involvement still exist. In this paper, we are exploring
the challenges of heterogeneous services and characteristics thereof with the aim of developing
a seamless approach that will alleviate some of these challenges in near future. It is therefore of
outmost importance to understand the challenges and characteristics of heterogeneous services
before developing a mechanism that could eliminate these challenges.
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
Several solutions exist for file storage, sharing, and synchronization. Many of them involve a
central server, or a collection of servers, that either store the files, or act as a gateway for them
to be shared. Some systems take a decentralized approach, wherein interconnected users form a
peer-to-peer (P2P) network, and partake in the sharing process: they share the files they
possess with others, and can obtain the files owned by other peers.
In this paper, we survey various technologies, both cloud-based and P2P-based, that users use
to synchronize their files across the network, and discuss their strengths and weaknesses.
A LITERATURE REVIEW ON SEMANTIC WEB – UNDERSTANDING THE PIONEERS’ PERSPECTIVEcsandit
There are various definitions, view and explanations about Semantic Web, its usage and its underlying architecture. However, the various flavours of explanations seem to have swayed way off-topic to the real purpose of Semantic Web. In this paper, we try to review the literature of Semantic Web based on the original views of the pioneers of Semantic Web which includes, Sir Tim Berners-Lee, Dean Allemang, Ora Lassila and James Hendler. Understanding the vision of the pioneers of any technology is cornerstone to the development. We have broken down Semantic Web into two approaches which allows us to reason with why Semantic Web is not mainstream.
What is Sleeping pralysis and how it effect us ?Harshit Agarwal
Sleep paralysis consists of a period when one cannot perform voluntary movements. REM sleep- The stage of sleep marked by rapid eye movements, dreaming, and paralysis of motor systems; sleep with an activated brain.
Restorative effects of sleep appear to be more important for brain than rest of body.
Market based instruments as a policy instrument for environmental problemsGlen Speering
A short (15min) presentation on examples of market based instruments for addressing environmental problems. Definitions, caveats and popularity are covered.
Security Model for Hierarchical Clustered Wireless Sensor NetworksCSCJournals
The proposed security system for the Wireless Sensor Network (WSN) is based on the WSN security design goal that ‘to design a completely secure WSN, security must be integrated into every node of the system’. This paper discusses on two main components of the security framework viz. the secure key management module and the secure routing scheme. The incorporation of security mechanism during the routing protocol design phase is the main focus of this paper. The proposed security framework viz. ‘Secure and Hierarchical, a Routing Protocol’ (SHARP) is designed for the wireless sensor network applications which is deployed particularly for data collection purpose in a battlefield where the security aspect of the network cannot be compromised at any cost. SHARP consists of three basic integrated modules and each module performs a well defined task to make the whole security framework a complete system on its own.
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.
Enhanced security for non English users of Wireless Sensor NetworksEswar Publications
Wireless Sensor Networks is an infrastructure less, self-configured, reprogrammable, energy-aware network used
in various applications. Many networks works on security of data including mainly ASCII values but not the non English end users. BDNA cryptography describes how to encrypt non English patterns but which leads to propagation of more bits transmitted means indirectly consumes more energy in WSN. In this we propose new steps to reduce the transmission of more bytes in the network. This gives high propagation speed in the network with minimum hash overhead.
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.
FSDA: Framework for Secure Data Aggregation in Wireless Sensor Network for En...IJECEIAES
An effective key management plays a crucial role in imposing a resilient security technique in Wireless Sensor Network (WSN). After reviewing the existing approaches of key management, it is confirmed that existing approachs does not offer good coverage on all potential security breaches in WSN. With WSN being essential part of Internet-of-Things (IoT), the existing approaches of key management can definitely not address such security breaches. Therefore, this paper introduces a Framework for Secure Data Aggregation (FSDA) that hybridizes the public key encryption mechanism in order to obtain a novel key management system. The proposed system does not target any specific attacks but is widely applicable for both internal and external attacks in WSN owing to its design principle. The study outcome exhibits that proposed FSDA offers highly reduced computational burden, minimal delay, less energy consumption, and higher data transmission perforance in contrast to frequency used encryption schemes in WSN.
A SECURE KEY COMPUTATION PROTOCOL FOR SECURE GROUP COMMUNICATION WITH PASSWOR...cscpconf
Providing security in group communication is more essential in this new network environment. Authentication and Confidentiality are the major concerns in secure group
communication. Our proposed approach uses an authenticated group key transfer protocol that relies on trusted key generation center (KGC). KGC computes group pair for each
individual and transport the pair of values to all group members in a secured manner. Password based authentication mechanism is used to avoid the illegal member access in a
group Also, the proposed approach facilitates efficient key computation technique such that only authorized group members will be able to computer and retrieve the secret key and unauthorized members cannot retrieve the key. The proposed algorithm is more efficient and relies on NP class. In addition, the distribution of key is also safe and secure. Moreover, the pair generated for the computation of key is also very strong since the cryptographic techniques are used which provides efficient computation.
A secure key computation protocol for secure group communication with passwor...csandit
Providing security in group communication is more essential in this new network
environment. Authentication and Confidentiality are the major concerns in secure group
communication. Our proposed approach uses an authenticated group key transfer protocol
that relies on trusted key generation center (KGC). KGC computes group pair for each
individual and transport the pair of values to all group members in a secured manner.
Password based authentication mechanism is used to avoid the illegal member access in a
group Also, the proposed approach facilitates efficient key computation technique such that
only authorized group members will be able to computer and retrieve the secret key and
unauthorized members cannot retrieve the key. The proposed algorithm is more efficient and
relies on NP class. In addition, the distribution of key is also safe and secure. Moreover, the
pair generated for the computation of key is also very strong since the cryptographic
techniques are used which provides efficient computation.
Securing Many-To- Many Wireless Sensor Networks With Unique Dynamic KeyEditor IJMTER
Due to the sensitive nature of the data transmitted by applications ranging from mobile target
surveillance to intelligent home networking, through Wireless sensor networks, (WSNs) appropriate
protection mechanisms are needed to prevent attackers from exploiting the weaknesses of the radio links.
In this paper, we propose a novel group key management scheme. This paper investigates the use of secure
tunnels as a solution to improve the protection of WSNs. We propose a tunneling scheme that conforms
to the security requirements of WSNs while having less computational and network overhead. Our
protocol considerably can reduce the number of transmitted messages as well as the computational load,
which makes it suitable for WSNs. We tested the proposed protocol considering two models of mobility
of the targets which are respectively the Random Walk model and the Gauss Markov model.
AN ANTI-CLONE ATTACK KEY MANAGEMENT SCHEME FOR WIRELESS SENSOR NETWORKScsandit
Wireless Sensor Networks (WSNs) are subject to various kinds of attacks such as replaying of
messages, battery exhausting, and nodes compromising. While most of these attacks can be
dealt with through cryptographic security protocols provided by key management schemes,
there are always a few that manage to really cause problems. One such attack that is most
common and significant in WSNs is cloning attack. In clone attack, the intruder tries to capture
and compromise some nodes and inject them into several locations throughout the network in
order to conduct other types of attacks. Moreover, if this attack is not detected early, then these
replicated injected nodes will consume a large amount of the network resources. In this paper,
we analyze several key management schemes that can be used for checking integrity and
preventing cloning attacks. After analyzing the problems associated with these schemes, we
propose a model that allows us to distinguish between legitimate nodes and cloned nodes in
such sensor networks.
User Selective Encryption Method for Securing MANETs IJECEIAES
Security issue is getting important day by day. At present, there are a variety of methodologies to provide protection for data confidentiality. MANETs have lots of security challenges than traditional networks like infrastructureless and self-organizing requirements. As t he MANETs are dynamic networks that’s make every transmission in such networks vulnerable to many attacks and improving security level becomes a main issue. This paper introduces a user selective encryption method by operating Data Encryption Standard (DES ), Triple DES (3DES), Advanced Encryption Standard (AES) and the Diffie-Hellman Key Exchange (DHKE) protocol for key management in order to improve MANET security. Through the Network Simulator-2 (NS-2), the we investigat e the performance of the proposed method in terms of data transfer time and network throughput for different data sizes and different sender-to-receiver number of hops. The results show the superiority of AES over other encryption algorithms. Furthermore, the effectiveness of our proposed method is verified through comparing our results with those obtained from previous studies.
Balancing Trade-off between Data Security and Energy Model for Wireless Senso...IJECEIAES
An extensive effort to evolve various routing protocol to ensure optimal data delivery in energy efficient way is beneficial only if there is additional means of security process is synchronized. However, the security process consideration introduces additional overhead thus a security mechanism is needed to accomplish an optimal trade-off that exists in-between security as well as resource utilization especially energy. The prime purpose of this paper is to develop a process of security in the context of wireless sensor networks (WSN) by introducing two types of sensor node deployed with different capabilities. The proposed algorithm Novel Model of Secure Paradigm (N-MSP) which is further integrated with WSN. However, this algorithm uses a Hash-based Message Authentication Code (HMAC) authentication followed by pairwise key establishment during data aggregation process in a WSN. The extensive simulation carried out in a numerical platform called MATLAB that depicts that the proposed N-MSP achieves optimal processing time along with energy efficient pairwise key establishment during data aggregation process.
ENHANCED THREE TIER SECURITY ARCHITECTURE FOR WSN AGAINST MOBILE SINK REPLI...ijwmn
Recent developments on Wireless Sensor Networks have made their application in a wide range
such as military sensing and tracking, health monitoring, traffic monitoring, video surveillance and so on.
Wireless sensor nodes are restricted to computational resources, and are always deployed in a harsh,
unattended or unfriendly environment. Therefore, network security becomes a tough task and it involves
the authorization of admittance to data in a network. The problem of authentication and pair wise key
establishment in sensor networks with mobile sink is still not solved in the mobile sink replication attacks.
In q-composite key pre distribution scheme, a large number of keys are compromised by capturing a
small fraction of sensor nodes by the attacker. The attacker can easily take a control of the entire network
by deploying a replicated mobile sinks. Those mobile sinks which are preloaded with compromised keys
are used authenticate and initiate data communication with sensor node. To determine the above problem
the system adduces the three-tier security framework for authentication and pair wise key establishment
between mobile sinks and sensor nodes. The previous system used the polynomial key pre distribution
scheme for the sensor networks which handles sink mobility and continuous data delivery to the
neighbouring nodes and sinks, but this scheme makes high computational cost and reduces the life time of
sensors. In order to overcome this problem a random pair wise key pre distribution scheme is suggested
and further it helps to improve the network resilience. In addition to this an Identity Based Encryption is
used to encrypt the data and Mutual authentication scheme is proposed for the identification and
isolation of replicated mobile sink from the network.
Key Management Schemes for Secure Communication in Heterogeneous Sensor NetworksIDES Editor
Hierarchical Sensor Network organization is
widely used to achieve energy efficiency in Wireless Sensor
Networks(WSN). To achieve security in hierarchical WSN,
it is important to be able to encrypt the messages sent
between sensor nodes and its cluster head. The key
management task is challenging due to resource constrained
nature of WSN. In this paper we are proposing two key
management schemes for hierarchical networks which
handles various events like node addition, node compromise
and key refresh at regular intervals. The Tree-Based
Scheme ensures in-network processing by maintaining some
additional intermediate keys. Whereas the CRT-Based
Scheme performs the key management with minimum
communication and storage at each node.
Similar to Key Management Scheme for Secure Group Communication in WSN with Multiple Groups (20)
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
2. 92 Computer Science & Information Technology (CS & IT)
the best node to invoke their attacks thereby potentially making security breach. Owing to the
wireless medium of communication in WSN, it is very challenging task to identify the malicious
nodes and design a security policy to deny the access in the network. The malicious nodes are
quite capable enough to access the entire network using potential computers and sophisticated
communication equipments. The malicious nodes can also seed themselves in the network
environment without even getting caught [4]. It is said that sink is considered as the most reliable
core of the wireless sensor network that stores significant information about the security
protocols, readings of sensors, and routing information. These are very critical in group
communication. In small scale sensor network, it is easier to capture the data, process it, and
forward to sink. But in random and dynamic network of large size, it usually doesn’t go by single
hop communication. The nodes are formulated in groups, where each group member interacts
with other group member to forward the processed data from one point to another. The process of
data aggregation completely fails without group communication. Hence, it is very important that
a robust security technique is to be developed to address the security issues in group
communication system in WSN. Cryptography [5] is the most frequently adopted technique to
incorporate security while performing group communication in WSN.
However, conventional cryptographic algorithms like SHA, AES, although have good security
features, suffer from limitations too. Hence, keeping all these issues in mind, the paper introduces
a scheme for secure group key communication with multiple groups. Remaining part of the paper
is ordered as follows: Section 2 discusses background of research work followed by key
management scheme in section 3. Authenticated group communication is presented in section 4
and section 5 summarizes the paper.
2. BACKGROUND
The study towards secure group communication is more than a decade old and there are various
techniques that have been introduced by the various researchers. This section discusses some of
the recent studies found in standard research manuscript that focuses on i) secure group
communication and ii) key distribution mechanism.
Cheikhrouhou et al. [6] have discussed a protocol for ensuring secure group communication
using elliptical curve cryptography over ring based topology of wireless sensor network. The
authors have discussed their outcomes considering storage cost which was found to be efficient
compared to existing techniques. However, the limitation of the scheme is the dependency of key
storage of size 160 bits. Wang et al. [7] have proposed a predistribution policy considering
hexagonal grids consisting of groups and keys. Miettinen et al. [8] have presented a security
protocol by incorporating an authenticated pairing system based on key context. Furtak and
Chudzikiewicz [9] have used asymmetric key pair as well as electronic signature to provide
secure authentication in wireless sensor network. Xi et al. [10] have presented a key estimating
process that is done in faster manner as compared to attacker. However, various attackers have
various patterns of generating attacks, the authors have not discrete mentioned the names of the
attack. Moreover the outcomes of the study were not found to be benchmarked.
Hence, it can be seen that there exists various security protocols in the research papers with
advantages and limitations. The prime trade-off found in all the study is dependency of
broadcasting the key. We comment that broadcasting of the key is very sensitive operation and is
highly prone to capture if proper encryption scheme is not implemented. Another trade-off found
3. Computer Science & Information Technology (CS & IT) 93
is majority of the schemes are based on enhancement of conventional cryptographic scheme with
less novelty in mathematical approaches. The third trade-off seen in all the studies is about the
key sizes, which is 128, 216, 160, or 512 bits. Although the key sizes seem to be smaller but as
majority of the existing approaches store this, grossly the sizes of the matrix holding the keys
becomes eventually larger.
Many schemes for group key management have been proposed in the literature for WSN [11, 12,
13, 14]. But all these schemes consider a single group communication scenario. Aparna et al. [15]
have discussed a scheme for secure group communication with multiple groups which is based on
logical key trees. A combination of key-based and secret share-based approach is used for
managing the group keys. Purushothama et al. [16] have proposed a group key management
scheme for simultaneous multiple groups with overlapped membership. The scheme is based on
key-user tree structure with substantial reduction in storage and rekeying cost. But both of these
schemes are proposed for conventional networks. In this paper, we have proposed a scheme for
secure group communication for WSN with multiple groups.
3. KEY MANAGEMENT SCHEME
We propose a scheme for group key management with multiple groups. A group consists of n
sensing nodes and there are at most m simultaneous groups that need to be established. The nodes
are numbered s1, s2…sn and groups are numbered G1, G2… Gm. A logical tree in constructed for
each group Gi, for i =1,2...m. The height of the tree for group Gi depends on the number of
sensing nodes in Gi and it is log2k if there are k (k ≤ n) nodes in the tree. The tree is maintained by
the central node. It constructs a separate key tree for each group. Each sensing node shares a
private key with the central node which is used for confidential communication. The group key
(GK) is at the root of the tree and is used for confidential communication with the group
members. An interior node with two child nodes forms a subgroup and keys associated with the
subgroup are called secondary keys. These keys are named either kij for j=1,2…m or kp-l
depending on whether they have two child nodes or one child node. The key is named kij if it is
the root of the subtree with leftmost child si and rightmost child sj and it is named kp-l if it is the
root of the subtree with one child node (left or right). kp is the leftmost or rightmost child
(whichever exists) of this subtree and l is the level number. Secondary keys (keys along the path
excluding group key and private key) are used to encrypt new group key. Next we discuss group
formation phase followed by computation and distribution of group key.
3.1 Group Formation Phase
The proposed scheme uses Logical Key Hierarchy (LKH) scheme [17] and a binary tree with two
keys at each level. The central node is responsible for group formation and rekeying operations. It
assigns each sensing node a unique id (UID) which is a binary string of length p where p =
log2
n
where n is the number of sensing nodes. A sensing node si, which wishes to join the group
Gj sends a join request of the form JOIN (UIDi, Gj) to the central node where UIDi is the unique
identification number of si. A node wishing to join more than one group sends individual join
request to each group. A node can send a request to join more than one group in which case it
will be a member of more than one key tree.
4. 94 Computer Science & Information Technology (CS & IT)
3.2 Rekeying Strategies and Protocols
We use key based approach for managing group keys and secondary keys. Whenever a node is
compromised, it is evicted from the group(s) to which it belongs. Similarly, whenever a new node
enters a monitoring area it is added to the group. In either case there is a membership change and
hence the group key needs to be changed to prevent a new group member from reading past
communications and old group member from reading current and future communications.
Whenever there is a membership change, the central node updates the key tree, computes the new
group key and distributes it to the existing nodes securely. In the following subsections we
discuss the protocols for joining and leaving a group(s) represented by key tree(s).
3.2.1 Joining a key tree
A new node si (1 ≤ i ≤ n) wanting to join a group Gj (1 ≤ j ≤ m), sends a join request of the form
JOIN (UIDi, Gj) to the central node (CN). Upon receiving this join request from si, the CN checks
the node’s identity and whether it is allowed to join the group Gj. If so, the CN updates the key
tree by creating a node for si and ensures backward secrecy by changing the keys along the path
from root till its parent and communicating them to appropriate users. The CN computes new
group key
'
jGK for group Gj and sends it to current members of Gj by encrypting it with old
group key GKj. For the new node, the CN sends the keys along the path by encrypting them with
PKi, private key of si. For example, consider an initial key tree with multiple groups shown Fig.1.
In the figure s-nodes represent the sensing nodes and nodes labeled PK from PK1 to PK11
represent the private keys of s1 to s11. The k-nodes represent the secondary keys and root nodes
labeled GK1, GK2, GK3 represent the group keys.
Fig 1 : Initial key tree with 3 groups
There are 3 simultaneous groups G1, G2, G3 with four members, s1, s2, s3, s4 in G1, 3 members s3,
s5, s6 in G2 and 6 members s4, s7, s8, s9, s10, s11 in G3.
Now, suppose a new node s12 wants to join group G3 in Fig.1, it sends a join request JOIN
(UID12, G3) to the CN. If the requesting node is allowed to join, the CN updates the key tree as
shown in Fig.2. The keys that must be changed are K11-2 and GK3. The CN changes K11-2 to K1012
5. Computer Science & Information Technology (CS & IT) 95
and randomly selects a new group key
'
3GK . The changed keys and the new group key are
communicated to appropriate nodes by sending the following rekeying messages:
1. CN →{s12} : 12PKE (K12-1, K1012, G
'
3K )
2. CN →{s10, s11} : 1011KE (K1012), 3GKE (G
'
3K )
3. CN →{s4, s7, s8, s9} : 3GKE (G
'
3K )
Fig.2 Key Tree after s12 joins G3.
Suppose, now s13 wants to join both G2 and G3, it sends join requests to both the groups. It sends
JOIN(UID13, G2) and JOIN(UID13, G3) to the CN. If the requested node is allowed to join G2 and
G3, the CN updates the key tree as shown in Fig.3. The keys that must be changed are K12-1,
K1012,
'
3GK , K6-1 and 2GK . The new keys are sent to appropriate nodes by generating the
following rekeying messages:
1. CN →{s13} : 13PKE (K613,
'
2GK , K1213, K1013,
''
3GK |
)
2. CN →{s6} : 2GKE (
'
2GK , K613)
3. CN →{s3, s5} : 2GKE (
'
2GK )
4. CN →{s12} :
12PKE (K1213), 1213KE (K1013), '
3
GKE (
''
3GK )
6. 96 Computer Science & Information Technology (CS & IT)
5. CN →{s10, s11} :
1011KE (K1013), '
3
GKE (
''
3GK )
6. CN →{s4, s7, s8, s9} : '
3
GKE (
''
3GK )
Fig. 3 : Key Tree after s13 joins G2 and G3.
When a member joins a group Gj with k members, then at most log2k keys have to be changed,
2log2k encryptions are required and log2k rekey messages have to be built to communicate the
changed keys to the appropriate members of the group. For a member joining i number of groups,
the number of keys to be changed, number of encryptions required and number of rekey
messages to be sent are∑ ݈݃ଶ݊
ୀଵ , 2∑ ݈݃ଶ݊
ୀଵ , ∑ ݈݃ଶ݊
ୀଵ respectively where nj is the
number of nodes in group Gj.
3.2.2 Leaving a key tree
After a node leaves a group, current group key can no longer be used for future communications
and a new group key must be selected and distributed securely to the remaining group members.
In addition, all other keys which are known to the leaving node must also be changed to ensure
forward secrecy. A leaving node may be a member of a single group or more than one group.
Depending on how many groups it belongs to and how many groups it wants to leave, the CN
updates the key tree accordingly. Suppose a node s4 which is a member of G1 and G3 wants to
leave group G3, it sends leave request of the form LEAVE (UID4, G3) to CN. Upon receiving this
request CN removes it from G3 and changes the keys along the path as shown in Fig.4. The keys
that must be changed are
''
3GK , K47, K49.
''
3GK Changes to
'''
3GK , K47 changes to K7-1and
K49changes to K79. The new keys are conveyed to the existing members of the group by sending
the following rekey messages :
7. Computer Science & Information Technology (CS & IT) 97
Fig. 4 : Key Tree after s4 leaves G3.
1. CN→{s7} : 7PKE (K7-1), 17−KE (K79), 79KE (
'''
3GK )
2. CN→{s8,s9} : 89KE (K79), 79KE (
'''
3GK )
3. CN→{s10, s11, s12, s13} :
1013KE (
'''
3GK )
Now, suppose s3 wants to leave both G1 and G2, it sends leave request to both the groups. It sends
LEAVE (UID3, G1) and LEAVE (UID3, G2) to CN. The CN removes s3 from the trees representing
G1 and G2. The key K34, changes to K4-1, K35 changes to K5-1, GK1 to
'
1GK and
'
2GK to
''
2GK .
The resulting key tree is shown in Fig. 5 below. The new keys are communicated to
corresponding nodes by generating and sending the following rekeying messages :
1. CN →{s4} : 4PKE (K4-1), 14−KE (
'
1GK )
2. CN →{s1, s2} : 12KE (
'
1GK )
3. CN →{s5} : 5PKE (K5-1), 15−KE (
''
2GK )
4. CN →{s6, s13} : 613KE (
''
2GK )
8. 98 Computer Science & Information Technology (CS & IT)
Fig.5 : Key Tree after s3 leaves G1 and G2.
When a member leaves a group Gj with k members, then at most log2k keys have to be changed,
2log2k encryptions are required and log2k rekey messages have to be sent to the appropriate
members of the group to communicate the changed keys.
3.2.3 Changing the group membership
A node wishing to move from one group to another sends a move request to CN. Move request
can be implemented as leave request followed by join request. For example, a node moving from
Gi to Gjcan be interpreted as leaving group Gi and joining group Gj. The CN must ensure forward
secrecy for group Gi and backward secrecy for group Gj by changing the keys along the path in Gi
and Gj. Consider the key tree in Fig.5. Now, suppose s4 wants to move from G1 to G2, it sends a
move request of the form MOVE (UID4, G1, G2) to the CN. The CN now removes the node for s4
from G1 and inserts it to G2. The resulting key tree is shown in Fig.6. CN constructs the following
rekeying messages and sends to the appropriate nodes:
Fig.6 : Key Tree after s4 moves from G1 to G2.
9. Computer Science & Information Technology (CS & IT) 99
1. CN →{s1,s2} : 12KE (
''
1GK )
2. CN →{s4} : 4PKE (K45,
'''
2GK )
3. CN →{s5} : 5PKE (K45), 45KE (
'''
2GK )
4. CN →{s6, s13} : 613KE (
'''
2GK )
For a member moving from group Gi to group Gj, the number of keys to be changed, number of
encryptions required and number of rekey messages to be sent are log2ni+ log2nj , 2(log2ni +
log2nj) and log2ni + log2nj respectively where ni and nj are the number of nodes in groups Gi
and Gj respectively.
Each member of the group needs to store hj – 1 secondary keys and one group key where hj is the
height of the tree in group j for j = 1 to m. A node needs to store ∑ (ℎ − 1)
ୀଵ secondary keys
and i number of group keys if it is a member of i number of groups.
4. VERIFYING AUTHENTICITY IN GROUP COMMUNICATION
Verifying authenticity of the sender is an important issue in secure group communication which
provides protection against masquerade attack. For example, when a sender node si sends a
message to group Gk, (1≤ k≤ m), the members of Gk must identify that the sender is si and it is not
some other node sj trying to impersonate si. In this section, we provide a protocol for
authenticated group communication. When a node si wants to send a message to group Gk, it first
sends a request to CN which includes the node’s identity, group identity and a challenge C. The
CN in turn sends a authentication key AKi to si encrypted with private key PKi and hash of AKi to
the members of Gk encrypted with group key GKi. si, now computes hash of AKi and sends the
message M along with H(AKi) to group members encrypted with group key GKi. Upon receiving
this from si, group members decrypt it, compare the received H(AKi) with the one received from
the CN. If both match the group members are sure of the sender and accept the message sent by
si. Otherwise they discard the message. The use of challenge assures the group members that this
is a fresh message and no old message has been replayed. Thus the protocol in Fig.7 provides
authenticity as well as confidentiality in group communication. In the protocol we use the symbol
|| to denote concatenation operation.
1. si→ CN : [UIDi || Gi || C]
2. CN→si : iPKE [AKi || f(C)]
3. CN →Gi : iGKE [H(AKi) || f(C) || UIDi]
4. si→Gi : iGKE [M || H(AKi) || f(C) || UIDi]
Fig.7: Protocol for authenticated group communication.
10. 100 Computer Science & Information Technology (CS & IT)
5. CONCLUSION
Secure group communication is an increasingly popular research area having received much
attention in recent years. Group oriented applications in WSN demand for the security services to
achieve the secure group communication. A common method is to encrypt messages with a group
key so that entities outside the group cannot decode them. Therefore, key management is a
fundamental building block for secure group communication systems. This paper introduces a
key management scheme for WSN with multiple simultaneous groups. We have used a key-based
approach for managing the groups and in case of membership change events the communication
and computation costs are logarithmic in nature. The paper also provides a protocol for
authenticated group communication.
REFERENCES
[1] N.Meghanathan, S. Boumerdassi, N. Chaki, D. Nagamalai, “Recent Trends in Network Security and
Applications: Third International Conference”, The Third International Conference on Network
Security and Applications, 2010.
[2] R.Shyamala, S. Valli, “Impact of Black hole and Rushing Attack on the Location-Based Routing
Protocol for Wireless Sensor Networks”, Advance in Computer & Inform, Technology, pp. 349-359,
2012.
[3] T. Shimeall, J. Spring, “Introduction to Information Security: A Strategic-Based Approach”, Newnes
Compute, pp. 382, 2013.
[4] J.Sen, “Security and privacy challenges in cognitive wireless sensor networks”, arXiv preprint arXiv:
1302.2253, 2013.
[5] G. Sharmaa, S. Balaa, A.K.Vermaa, “Security Frameworks for Wireless Sensor Networks-Review”,
2nd International Conference on Communication, Computing & Security, SciVerse Science Direct,
2012.
[6] C. Cheikhrouhou, A. Koubâa, G. Dini, and M. Abid, "RiSeG: a ring based secure group
communication protocol for resource-constrained wireless sensor networks", Personal and Ubiquitous
Computing, Vol. 15, No. 8, pp. 783-797, 2011.
[7] X. Wanga, P. Lia, Y. Suia, and H. Yanga, "A Hexagon-based Key Pre-distribution Scheme for
Wireless Sensor Networks", Journal of Information & Computational Science, Vol. 11 (8), pp. 2479-
2491, 2014.
[8] M. Miettinen, N. Asokan, T.D.Nguyen, A-R.Sadeghi, and M. Sobhani, “Context-Based Zero-
Interaction Pairing and Key Evolution for Advanced Personal Devices”, In Proceedings of the ACM
SIGSAC Conference on Computer and Communications Security, pp. 880-891, 2014.
[9] J. Furtak, and J. Chudzikiewicz, "The concept of authentication in WSNs using TPM", Computer
Science and Information Systems, Vol. 3, pp. 183–190, 2014.
[10] W. Xi, X-Y. Li, C. Qian, J. Han, S. Tang, J. Zhao, and K. Zhao, "Keep: Fast Secret Key Extraction
Protocol for D2D Communication", IEEE, 2014.
11. Computer Science & Information Technology (CS & IT) 101
[11] Guorui Li; Ying Wang; Jingsha He, “Efficient Group Key Management Scheme in Wireless Sensor
Networks”, Third International Symposium on Intelligent Information Technology and Security
Informatics (IITSI), 2010
[12] Ju-Hyung, Jun-Sik Lee ; Seung-Woo Seo,“ Energy Efficient Group Key Management Scheme for
Wireless Sensor Networks”, 2nd International Conference on Communication System Software and
Middleware, 2007.
[13] YuanZhang, Yongluo Shen ; SangKeun Lee, “A Cluster-Based Group Key Management Scheme for
Wireless Sensor Networks”, Web Conference (APWEB), 2010 12th International Asia-Pacific, 2010.
[14] A.S. Poornima, B.B. Amberker, “A Secure Group Key Management Scheme for Sensor Networks”,
Fifth International Conference on Conference: Information Technology: New Generations, 2008.
ITNG 2008
[15] R. Aparna and B. B. Amberker, “Key management scheme for multiple simultaneous secure group
communication,” in Proceedings of the IEEE International Conference on Internet Multimedia
Services Architecture and Applications (IMSAA ’09), December 2009.
[16] B R Purushothama , B B Amberker, “Group key management scheme for simultaneous multiple
groups with overlapped membership”, Third International Conference on Communication Systems
and Networks (COMSNETS 2011), 2011.
[17] C.K.Wong, M. Gouda, and S.S. Lam. Secure Group Communication Using key Graphs. IEEE/ACM
Transactions on Networking, Volume 8,No.1, pp.16-30, Feb.2000.
AUTHORS
H.S Annapurna is currently working as Associate Professor in the department of
Computer Science &Engg., Sri Siddhartha Institute of Technology, Tumkur. She has
obtained her Bachelor of Engineering from University of Mysore, Mysore. She has
received Masters degree in Software Systems from BITS, Pilani. She is currently
pursuing Doctral degree in the area of cryptography and network security from Sri
Siddhartha Academy of Higher Education, Tumakuru India.
M.Siddappa received B.E and M.Tech degree in Computer Science & Engineering from
University of Mysore, Karnataka, India in 1989 and 1993 respectively. He has
completed doctoral degree from Dr.MGR Educational Research Institute Chennai
under supervision of Dr.A.S.Manjunatha, CEO, Manvish e-Tech Pvt. Ltd., Bangalore in
2010. He worked as project associate in IISc, Bangalore under Dr. M.P Srinivasan and
Dr. V.Rajaraman from 1993 – 1995. He has teaching experience of 26 years and
research of 10 years . He published 45 Technical Papers in National, International
Conference and Journals. He has citation index of 113 till 2015 and h-index of 3 and
i10-index of 1 to his credit. He is a member of IEEE and Life member of ISTE. He is working in the field
of data structure and algorithms, Artificial Intelligence, Image processing and Computer networking. He
worked as Assistant Professor in Department of Computer Science & Engineering from 1996 to 2003 in Sri
Siddhartha Institute of Technology, Tumkur. Presently, he is working as Professor and Head, Department
of Computer Science & Engineering from 1999 at Siddhartha Institute of Technology, Tumakuru. He has
visited Louisiana university Baton rouge and California university.