Wireless Sensor Networks (WSN) are constraint by the limited resources available to its
constituting sensors. Thus the use of public-key cryptographyduring message exchange gets
forbidden. One has to invoke symmetric key techniques. This leads to key distribution in the
sensors which in itself is a major challenge. Again due to resource constraints, Key
Predistrubution (KPD) methods are preferred to other distribution techniques. It requires
predistribution of keys in nodes prior to deployment and establishing immediately once
deployed. However there are certain weaknesses in various existing KPD schemes. For
instance, often it is not guaranteed that any given pair of nodes communicate directly. This
leads one to revert to multi-hop communication involving intermediate sensor nodes resulting
in increased cost of communication. In this work a key predistribution technique using ReedSolomon
codes is considered which is faced with the above weakness. The authors suggests a
novel technique of merging certain number of sensors into blocks ensuring that the blocks
have full connectivity amongst themselves. Here the blocks are chosen in such a way that it
ensures no intra-node communication. Further this approach improves both time and space
complexity of the system
A Novel Method for Preventing Selective Jamming Attacks in Wireless NetworksIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
A NEW KEY ESTABLISHMENT SCHEME FOR WIRELESS SENSOR NETWORKSIJNSA Journal
Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the serious limitations in terms of computational power, energy supply, network bandwidth. In order to balance the security and efficiency, we propose a new scheme by employing LU Composition techniques for mutual authenticated pairwise key establishment and integrating LU Matrix with Elliptic Curve Diffie-Hellman for anonymous pathkey establishment. At the meantime, it is able to achieve efficient group key agreement and management. Analysis shows that the new scheme has better performance and provides authenticity and anonymity for sensor to establish multiple kinds of keys, compared with previous related works.
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
SECURITY ENHANCED KEY PREDISTRIBUTION SCHEME USING TRANSVERSAL DESIGNS AND RE...IJNSA Journal
Resource constraints of the nodes make security protocols difficult to implement. Thus key management is an important area of research in Wireless Sensor Networks (WSN). Key predistribution (kpd) which involves preloading keys in sensor nodes, has been considered as the best solution for key management when sensor nodes are battery powered and have to work unattended. This paper proposes a method to fix some loophole in an existing key predistribution scheme thereby enhancing the security of messages exchanged within a WSN. Here we use a model based on Reed Muller Codes to establish connectivity keys between sensor nodes. The model is then utilized to securely establish communication keys and exchange messages in a WSN designed on basis of two schemes using transversal designs for key predistribution. The combination of the key predistribution scheme and the connectivity model gives rise to highly resilient communication model with same connectivity between nodes as the chosen key predistribution scheme.
Identity-Based Blind Signature Scheme with Message Recovery IJECEIAES
Blind signature allows a user to obtain a signature on a message without revealing anything about the message to the signer. Blind signatures play an important role in many real world applications such as e-voting, e-cash system where anonymity is of great concern. Due to the rapid growth in popularity of both wireless communications and mobile devices, the design of secure schemes with low-bandwidth capability is an important research issue. In this paper, we present a new blind signature scheme with message recovery in the ID-based setting using bilinear pairings over elliptic curves. The proposed scheme is unforgeable with the assumption that the Computational Diffie-Hellman problem is hard. We compare our scheme with the related schemes in terms of computational and communicational point of view.
Analysis and improvement of pairing free certificate-less two-party authentic...ijsptm
The predominant grid authentication mechanisms use public key infrastructure (PKI). Nonetheless,
certificate-less public key cryptography (CL-PKC) has several advantages that seem to well align with the
demands of grid computing. Security and efficiency are the main objectives of grid authentication
protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear
pairing, that is extremely computational expensive. In this paper, we analyze the recently secure certificateless
key agreement protocols without pairing. We then propose a novel grid pairing-free certificate-less
two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key
management approach for grid users. We also show, a GPC-AKA security protocol proof using formal
automated security analysis Sycther tool.
A Novel Method for Preventing Selective Jamming Attacks in Wireless NetworksIJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
A NEW KEY ESTABLISHMENT SCHEME FOR WIRELESS SENSOR NETWORKSIJNSA Journal
Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the serious limitations in terms of computational power, energy supply, network bandwidth. In order to balance the security and efficiency, we propose a new scheme by employing LU Composition techniques for mutual authenticated pairwise key establishment and integrating LU Matrix with Elliptic Curve Diffie-Hellman for anonymous pathkey establishment. At the meantime, it is able to achieve efficient group key agreement and management. Analysis shows that the new scheme has better performance and provides authenticity and anonymity for sensor to establish multiple kinds of keys, compared with previous related works.
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
SECURITY ENHANCED KEY PREDISTRIBUTION SCHEME USING TRANSVERSAL DESIGNS AND RE...IJNSA Journal
Resource constraints of the nodes make security protocols difficult to implement. Thus key management is an important area of research in Wireless Sensor Networks (WSN). Key predistribution (kpd) which involves preloading keys in sensor nodes, has been considered as the best solution for key management when sensor nodes are battery powered and have to work unattended. This paper proposes a method to fix some loophole in an existing key predistribution scheme thereby enhancing the security of messages exchanged within a WSN. Here we use a model based on Reed Muller Codes to establish connectivity keys between sensor nodes. The model is then utilized to securely establish communication keys and exchange messages in a WSN designed on basis of two schemes using transversal designs for key predistribution. The combination of the key predistribution scheme and the connectivity model gives rise to highly resilient communication model with same connectivity between nodes as the chosen key predistribution scheme.
Identity-Based Blind Signature Scheme with Message Recovery IJECEIAES
Blind signature allows a user to obtain a signature on a message without revealing anything about the message to the signer. Blind signatures play an important role in many real world applications such as e-voting, e-cash system where anonymity is of great concern. Due to the rapid growth in popularity of both wireless communications and mobile devices, the design of secure schemes with low-bandwidth capability is an important research issue. In this paper, we present a new blind signature scheme with message recovery in the ID-based setting using bilinear pairings over elliptic curves. The proposed scheme is unforgeable with the assumption that the Computational Diffie-Hellman problem is hard. We compare our scheme with the related schemes in terms of computational and communicational point of view.
Analysis and improvement of pairing free certificate-less two-party authentic...ijsptm
The predominant grid authentication mechanisms use public key infrastructure (PKI). Nonetheless,
certificate-less public key cryptography (CL-PKC) has several advantages that seem to well align with the
demands of grid computing. Security and efficiency are the main objectives of grid authentication
protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear
pairing, that is extremely computational expensive. In this paper, we analyze the recently secure certificateless
key agreement protocols without pairing. We then propose a novel grid pairing-free certificate-less
two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key
management approach for grid users. We also show, a GPC-AKA security protocol proof using formal
automated security analysis Sycther tool.
EFFICIENT CONDITIONAL PROXY REENCRYPTION WITH CHOSEN CIPHER TEXT SECURITYIJNSA Journal
In a proxy re-encryption (PRE) scheme, Alice gives a special information to a proxy that allows it to transform messages encrypted under Alice's public key into a encryption under Bob's public key such that the message is not revealed to the proxy. In [14], Jian Weng and others introduced the notion of conditional proxy re-encryption (C-PRE) with bilinear pairings. Later, a break for the same was published in [17] and a new C-PRE scheme with bilinear pairings was introduced. In C-PRE, the proxy also needs to have the right condition key to transform the ciphertext (associated with a condition set by Alice) under Alice's public key into ciphertext under Bob's public key, so that Bob can decrypt it. In this paper, we propose an efficient C-PRE scheme which uses substantially less number of bilinear pairings when compared to the existing one [17]. We then prove its chosen-ciphertext security under modified Computational Diffie-Hellman (mCDH) and modified Computational Bilinear Diffie-Hellman (mCBDH) assumptions in the random oracle model.
Performance Comparison of Cluster based and Threshold based Algorithms for De...Eswar Publications
In mobile ad-hoc networks (MANET), the movement of the nodes may quickly change the networks topology resulting in the increase of the overhead message in topology maintenance. The nodes communicate with each other by exchanging the hello packet and constructing the neighbor list at each node. MANET is vulnerable to attacks such as black hole attack, gray hole attack, worm hole attack and sybil attack. A black hole attack makes a serious impact on routing, packet delivery ratio, throughput, and end to end delay of packets. In this paper, the performance comparison of clustering based and threshold based algorithms for detection and prevention of
cooperative in MANETs is examined. In this study every node is monitored by its own cluster head (CH), while server (SV) monitors the entire network by channel overhearing method. Server computes the trust value based on sent and receive count of packets of the receiver node. It is implemented using AODV routing protocol in the NS2 simulations. The results are obtained by comparing the performance of clustering based and threshold based methods by varying the concentration of black hole nodes and are analyzed in terms of throughput,
packet delivery ratio. The results demonstrate that the threshold based method outperforms the clustering based method in terms of throughput, packet delivery ratio and end to end delay.
A New Security Level for Elliptic Curve Cryptosystem Using Cellular Automata ...Editor IJCATR
Elliptic curve cryptography (ECC) is an effective approach to protect privacy and security of information. Encryption
provides only one level of security during transmission over the channel. Hence there is a need for a stronger encryption which is very
hard to break. So, to achieve better results and improve security, information has to pass through several levels of encryption. The aim
of this paper would be to provide two levels of security. First level comprises of plaintext using as security key compressed block to
encrypt text based ECC technique and the second level comprises of scrambling method with compression using 2D Cellular rules. In
particular, we propose an efficient encryption algorithm based ECC using Cellular automata and it is termed as Elliptic Curve
Cryptosystem based Cellular Automata (ECCCA). This paper presents the implementation of ECCCA for communication over
insecure channel. The results are provided to show the encryption performance of the proposed method.
Implementation Secure Authentication Using Elliptic Curve CryptographyAM Publications
Elliptic curve cryptography is the most efficient public key encryption scheme based on the elliptic curve concepts that
can be used to create faster, smaller, and efficient cryptographic keys. As a use of network increase for critical transaction, so
huge damages are caused by intrusion attacks hence there is the need of computer network security. To protect network against
various active and passive attack, various technique have been suggested. Mobile devices have many differences in their
capabilities, computational powers and security requirements. The security of mobile communication has stopped the list of
concerns for mobile phone users. Confidentiality, Authentication, Integrity and Non-repudiation are required security services for mobile communication.
Modeling and Analysis of Two Node Network Model with Multiple States in Mobi...Editor IJCATR
In this work, the decision probability of the handoff are modeled and simulated for smaller bandwidths. The smaller
bandwidth is chosen just for simulation purposes and to demonstrate the applicability of the algorithm. The probability of handover
and probability of incorrect decision in the handover is modeled. Two nodes of the network are modeled and the probabilities of four
different states of the mobile node are also modeled. The results are presented for two cases with and without the probabilities of four
different states of the mobile nodes
A New Key Agreement Protocol Using BDP and CSP in Non Commutative GroupsEswar Publications
The available key agreement schemes using number theoretic, elliptic curves etc are common for cryptanalysts and associated security is vulnerable. This vulnerability further increases when we talk about modern efficient computers. So there is a need of providing new mechanism for key agreement with different properties so intruders get surprised and communication scenarios becomes stronger than before. In this paper, we propose a key agreement protocol which works in a non commutative group. We prove that our protocol meets the desired security attributes under the assumption that Conjugacy Search Problem and Decomposition Problem are hard in non commutative groups.
Belief Propagation Decoder for LDPC Codes Based on VLSI Implementationinventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
In remote sensor arrange messages are exchanged between the different source and goal matches agreeably such way that multi-jump parcel transmission is utilized. These information bundles are exchanged from the middle of the road hub to sink hub by sending a parcel to goal hubs. Where each hub overhears transmission close neighbor hub. To dodge this we propose novel approach with proficient steering convention i.e. most brief way directing and conveyed hub steering calculation. Proposed work additionally concentrates on Automatic Repeat Request and Deterministic Network coding. We spread this work by the end to end message encoding instrument. To upgrade hub security match shrewd key era is utilized, in which combined conveying hub is allocated with combine key to making secure correspondence. End to end. We dissect both single and numerous hubs and look at basic ARQ and deterministic system coding as strategies for transmission.
Interference Minimization Protocol in Heterogeneous Wireless Sensor Network f...IJERA Editor
High-quality data transmission is the primary objective of WSN for achieving quality of service.
Heterogeneous wireless sensor networks (HTWSN) can be used to deploy in sensitive and unmanned areas
to monitor the objects. HTWSN is high configured network used to capture high-quality images and videos
of targeted objects. During the data transmission in HTWSN, we identified that, the formation of
interference with in the network due to link capacity overhead. Due to that, the quality data transmission is
not possible through the network. In this research paper, we described the deployment of HTWSN network
and identifying the primary sources for interference and introducing the proposed Interference
Minimization Protocol (IMP). The IM protocol has achieved better quality of service by minimizing the
interference in HTWSN.
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have
become increasingly reliant on. The main research in computer security domain is how to enhance the
speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the
CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo
value that can process large power of numbers which otherwise are not supported by built-in data types.
First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using
CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime
number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or
small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical
soundness can be alleviated by this algorithm.
Exact secure outage probability performance of uplinkdownlink multiple access...journalBEEI
In this paper, we study uplink-downlink non-orthogonal multiple access (NOMA) systems by considering the secure performance at the physical layer. In the considered system model, the base station acts a relay to allow two users at the left side communicate with two users at the right side. By considering imperfect channel state information (CSI), the secure performance need be studied since an eavesdropper wants to overhear signals processed at the downlink. To provide secure performance metric, we derive exact expressions of secrecy outage probability (SOP) and and evaluating the impacts of main parameters on SOP metric. The important finding is that we can achieve the higher secrecy performance at high signal to noise ratio (SNR). Moreover, the numerical results demonstrate that the SOP tends to a constant at high SNR. Finally, our results show that the power allocation factors, target rates are main factors affecting to the secrecy performance of considered uplink-downlink NOMA systems.
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
LATTICE BASED TOOLS IN CRYPTANALYSIS FOR PUBLIC KEY CRYPTOGRAPHY IJNSA Journal
Lattice reduction is a powerful concept for solving diverse problems involving point lattices. Lattice reduction has been successfully utilizing in Number Theory, Linear algebra and Cryptology. Not only the existence of lattice based cryptosystems of hard in nature, but also has vulnerabilities by lattice reduction techniques. In this survey paper, we are focusing on point lattices and then describing an introduction to
the theoretical and practical aspects of lattice reduction. Finally, we describe the applications of lattice reduction in Number theory, Linear algebra.
Searchable Encryption remain to be one of the most widely required functionality of cloud storage. In this paper, we provide a security analysis of the popular schemes including the study of their implementation and security definitions. We cover Order Preserving Symmetric Encryption, Order Revealing Encryption and Partial Order Preserving Encoding.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Lightweight Cryptography for Distributed PKI Based MANETSIJCNCJournal
Because of lack of infrastructure and Central Authority(CA), secure communication is
a challenging job in MANETs. A lightweight security solution is needed in MANET to balance its
nodes resource tightness and mobility feature. The role of CA should be decentralized in MANET
because the network is managed by the nodes themselves without any fixed infrastructure and centralized
authority. In this paper, we created a distributed PUblic Key Infrastructure (PKI) using
Shamir secret sharing mechanism which allows the nodes of the MANET to have a share of its private
key. The traditional PKI protocols require centralized authority and heavy computing power to
manage public and private keys, thus making them not suitable for MANETs. To establish a secure
communication for the MANET nodes, we proposed a lightweight crypto protocol which requires
limited resources, making it suitable for MANETs.
Modified Koblitz Encoding Method for ECCidescitation
Extensive use of Wireless Sensor Networks is giving
rise to different types of threats in certain commercial and
military applications. To protect the WSN data communication
against various threats appropriate security schemes are
needed. However, WSN nodes are resource constrained, with
respect to limited battery energy, and limited computational
and memory available with each WSN node. Hence, the
security model to be used in WSN’s should use minimal
resources to the extent possible and it should also provide
good security. Elliptic curve cryptography (ECC) is the best
suited algorithm for WSNs, as it offers better security for
smaller key sizes compared to the popular RSA algorithm. In
ECC, encoding of message data to a point lying on the give
Elliptic Curve is a major problem as the encoding consumes
more resources. This paper provides a novel encoding
procedure to overcome these problems to a large extent. This
paper also describes implementation aspects of the proposed
encoding and decoding methods.
ASSURED NEIGHBOR BASED COUNTER PROTOCOL ON MAC-LAYER PROVIDING SECURITY IN MO...cscpconf
In this paper, we have taken out the concern of security on a Medium Access Control layer
implementing Assured Neighbor based Security Protocol to provide the authentication,
confidentiality and taking in consideration High speed transmission by providing security in
parallel manner in both Routing and Link Layer of Mobile Ad hoc Networks. We basically
divide the protocol into two different segments as the first portion concentrates, based on
Routing layer information; we implement the scheme for the detection and isolation of the
malicious nodes. The trust counter for each node is maintained which actively increased and
decreased considering the trust value for the packet forwarding. The threshold level is defined differencing the malicious and non malicious nodes. If the value of the node in trust counter lacks below the threshold value then the node is considered as malicious. The second part focus on providing the security in the link layer, the security is provided using CTR (Counter) approach for authentication and encryption. Hence simulating the results in NS-2, we come to conclude that the proposed protocol can attain high packet delivery over various intruders while attaining low delays and overheads.
EFFICIENT CONDITIONAL PROXY REENCRYPTION WITH CHOSEN CIPHER TEXT SECURITYIJNSA Journal
In a proxy re-encryption (PRE) scheme, Alice gives a special information to a proxy that allows it to transform messages encrypted under Alice's public key into a encryption under Bob's public key such that the message is not revealed to the proxy. In [14], Jian Weng and others introduced the notion of conditional proxy re-encryption (C-PRE) with bilinear pairings. Later, a break for the same was published in [17] and a new C-PRE scheme with bilinear pairings was introduced. In C-PRE, the proxy also needs to have the right condition key to transform the ciphertext (associated with a condition set by Alice) under Alice's public key into ciphertext under Bob's public key, so that Bob can decrypt it. In this paper, we propose an efficient C-PRE scheme which uses substantially less number of bilinear pairings when compared to the existing one [17]. We then prove its chosen-ciphertext security under modified Computational Diffie-Hellman (mCDH) and modified Computational Bilinear Diffie-Hellman (mCBDH) assumptions in the random oracle model.
Performance Comparison of Cluster based and Threshold based Algorithms for De...Eswar Publications
In mobile ad-hoc networks (MANET), the movement of the nodes may quickly change the networks topology resulting in the increase of the overhead message in topology maintenance. The nodes communicate with each other by exchanging the hello packet and constructing the neighbor list at each node. MANET is vulnerable to attacks such as black hole attack, gray hole attack, worm hole attack and sybil attack. A black hole attack makes a serious impact on routing, packet delivery ratio, throughput, and end to end delay of packets. In this paper, the performance comparison of clustering based and threshold based algorithms for detection and prevention of
cooperative in MANETs is examined. In this study every node is monitored by its own cluster head (CH), while server (SV) monitors the entire network by channel overhearing method. Server computes the trust value based on sent and receive count of packets of the receiver node. It is implemented using AODV routing protocol in the NS2 simulations. The results are obtained by comparing the performance of clustering based and threshold based methods by varying the concentration of black hole nodes and are analyzed in terms of throughput,
packet delivery ratio. The results demonstrate that the threshold based method outperforms the clustering based method in terms of throughput, packet delivery ratio and end to end delay.
A New Security Level for Elliptic Curve Cryptosystem Using Cellular Automata ...Editor IJCATR
Elliptic curve cryptography (ECC) is an effective approach to protect privacy and security of information. Encryption
provides only one level of security during transmission over the channel. Hence there is a need for a stronger encryption which is very
hard to break. So, to achieve better results and improve security, information has to pass through several levels of encryption. The aim
of this paper would be to provide two levels of security. First level comprises of plaintext using as security key compressed block to
encrypt text based ECC technique and the second level comprises of scrambling method with compression using 2D Cellular rules. In
particular, we propose an efficient encryption algorithm based ECC using Cellular automata and it is termed as Elliptic Curve
Cryptosystem based Cellular Automata (ECCCA). This paper presents the implementation of ECCCA for communication over
insecure channel. The results are provided to show the encryption performance of the proposed method.
Implementation Secure Authentication Using Elliptic Curve CryptographyAM Publications
Elliptic curve cryptography is the most efficient public key encryption scheme based on the elliptic curve concepts that
can be used to create faster, smaller, and efficient cryptographic keys. As a use of network increase for critical transaction, so
huge damages are caused by intrusion attacks hence there is the need of computer network security. To protect network against
various active and passive attack, various technique have been suggested. Mobile devices have many differences in their
capabilities, computational powers and security requirements. The security of mobile communication has stopped the list of
concerns for mobile phone users. Confidentiality, Authentication, Integrity and Non-repudiation are required security services for mobile communication.
Modeling and Analysis of Two Node Network Model with Multiple States in Mobi...Editor IJCATR
In this work, the decision probability of the handoff are modeled and simulated for smaller bandwidths. The smaller
bandwidth is chosen just for simulation purposes and to demonstrate the applicability of the algorithm. The probability of handover
and probability of incorrect decision in the handover is modeled. Two nodes of the network are modeled and the probabilities of four
different states of the mobile node are also modeled. The results are presented for two cases with and without the probabilities of four
different states of the mobile nodes
A New Key Agreement Protocol Using BDP and CSP in Non Commutative GroupsEswar Publications
The available key agreement schemes using number theoretic, elliptic curves etc are common for cryptanalysts and associated security is vulnerable. This vulnerability further increases when we talk about modern efficient computers. So there is a need of providing new mechanism for key agreement with different properties so intruders get surprised and communication scenarios becomes stronger than before. In this paper, we propose a key agreement protocol which works in a non commutative group. We prove that our protocol meets the desired security attributes under the assumption that Conjugacy Search Problem and Decomposition Problem are hard in non commutative groups.
Belief Propagation Decoder for LDPC Codes Based on VLSI Implementationinventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
In remote sensor arrange messages are exchanged between the different source and goal matches agreeably such way that multi-jump parcel transmission is utilized. These information bundles are exchanged from the middle of the road hub to sink hub by sending a parcel to goal hubs. Where each hub overhears transmission close neighbor hub. To dodge this we propose novel approach with proficient steering convention i.e. most brief way directing and conveyed hub steering calculation. Proposed work additionally concentrates on Automatic Repeat Request and Deterministic Network coding. We spread this work by the end to end message encoding instrument. To upgrade hub security match shrewd key era is utilized, in which combined conveying hub is allocated with combine key to making secure correspondence. End to end. We dissect both single and numerous hubs and look at basic ARQ and deterministic system coding as strategies for transmission.
Interference Minimization Protocol in Heterogeneous Wireless Sensor Network f...IJERA Editor
High-quality data transmission is the primary objective of WSN for achieving quality of service.
Heterogeneous wireless sensor networks (HTWSN) can be used to deploy in sensitive and unmanned areas
to monitor the objects. HTWSN is high configured network used to capture high-quality images and videos
of targeted objects. During the data transmission in HTWSN, we identified that, the formation of
interference with in the network due to link capacity overhead. Due to that, the quality data transmission is
not possible through the network. In this research paper, we described the deployment of HTWSN network
and identifying the primary sources for interference and introducing the proposed Interference
Minimization Protocol (IMP). The IM protocol has achieved better quality of service by minimizing the
interference in HTWSN.
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have
become increasingly reliant on. The main research in computer security domain is how to enhance the
speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the
CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo
value that can process large power of numbers which otherwise are not supported by built-in data types.
First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using
CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime
number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or
small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical
soundness can be alleviated by this algorithm.
Exact secure outage probability performance of uplinkdownlink multiple access...journalBEEI
In this paper, we study uplink-downlink non-orthogonal multiple access (NOMA) systems by considering the secure performance at the physical layer. In the considered system model, the base station acts a relay to allow two users at the left side communicate with two users at the right side. By considering imperfect channel state information (CSI), the secure performance need be studied since an eavesdropper wants to overhear signals processed at the downlink. To provide secure performance metric, we derive exact expressions of secrecy outage probability (SOP) and and evaluating the impacts of main parameters on SOP metric. The important finding is that we can achieve the higher secrecy performance at high signal to noise ratio (SNR). Moreover, the numerical results demonstrate that the SOP tends to a constant at high SNR. Finally, our results show that the power allocation factors, target rates are main factors affecting to the secrecy performance of considered uplink-downlink NOMA systems.
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
LATTICE BASED TOOLS IN CRYPTANALYSIS FOR PUBLIC KEY CRYPTOGRAPHY IJNSA Journal
Lattice reduction is a powerful concept for solving diverse problems involving point lattices. Lattice reduction has been successfully utilizing in Number Theory, Linear algebra and Cryptology. Not only the existence of lattice based cryptosystems of hard in nature, but also has vulnerabilities by lattice reduction techniques. In this survey paper, we are focusing on point lattices and then describing an introduction to
the theoretical and practical aspects of lattice reduction. Finally, we describe the applications of lattice reduction in Number theory, Linear algebra.
Searchable Encryption remain to be one of the most widely required functionality of cloud storage. In this paper, we provide a security analysis of the popular schemes including the study of their implementation and security definitions. We cover Order Preserving Symmetric Encryption, Order Revealing Encryption and Partial Order Preserving Encoding.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Lightweight Cryptography for Distributed PKI Based MANETSIJCNCJournal
Because of lack of infrastructure and Central Authority(CA), secure communication is
a challenging job in MANETs. A lightweight security solution is needed in MANET to balance its
nodes resource tightness and mobility feature. The role of CA should be decentralized in MANET
because the network is managed by the nodes themselves without any fixed infrastructure and centralized
authority. In this paper, we created a distributed PUblic Key Infrastructure (PKI) using
Shamir secret sharing mechanism which allows the nodes of the MANET to have a share of its private
key. The traditional PKI protocols require centralized authority and heavy computing power to
manage public and private keys, thus making them not suitable for MANETs. To establish a secure
communication for the MANET nodes, we proposed a lightweight crypto protocol which requires
limited resources, making it suitable for MANETs.
Modified Koblitz Encoding Method for ECCidescitation
Extensive use of Wireless Sensor Networks is giving
rise to different types of threats in certain commercial and
military applications. To protect the WSN data communication
against various threats appropriate security schemes are
needed. However, WSN nodes are resource constrained, with
respect to limited battery energy, and limited computational
and memory available with each WSN node. Hence, the
security model to be used in WSN’s should use minimal
resources to the extent possible and it should also provide
good security. Elliptic curve cryptography (ECC) is the best
suited algorithm for WSNs, as it offers better security for
smaller key sizes compared to the popular RSA algorithm. In
ECC, encoding of message data to a point lying on the give
Elliptic Curve is a major problem as the encoding consumes
more resources. This paper provides a novel encoding
procedure to overcome these problems to a large extent. This
paper also describes implementation aspects of the proposed
encoding and decoding methods.
ASSURED NEIGHBOR BASED COUNTER PROTOCOL ON MAC-LAYER PROVIDING SECURITY IN MO...cscpconf
In this paper, we have taken out the concern of security on a Medium Access Control layer
implementing Assured Neighbor based Security Protocol to provide the authentication,
confidentiality and taking in consideration High speed transmission by providing security in
parallel manner in both Routing and Link Layer of Mobile Ad hoc Networks. We basically
divide the protocol into two different segments as the first portion concentrates, based on
Routing layer information; we implement the scheme for the detection and isolation of the
malicious nodes. The trust counter for each node is maintained which actively increased and
decreased considering the trust value for the packet forwarding. The threshold level is defined differencing the malicious and non malicious nodes. If the value of the node in trust counter lacks below the threshold value then the node is considered as malicious. The second part focus on providing the security in the link layer, the security is provided using CTR (Counter) approach for authentication and encryption. Hence simulating the results in NS-2, we come to conclude that the proposed protocol can attain high packet delivery over various intruders while attaining low delays and overheads.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Iterative network channel decoding with cooperative space-time transmissionijasuc
One of the most efficient methods of exploiting space diversity for portable wireless devices is cooperative
communication utilizing space-time block codes. In cooperative communication, users besides
communicating their own information, also relay the information of other users. In this paper we
investigate a scheme where cooperation is achieved using two methods, namely, distributed space-time
coding and network coding. Two cooperating users utilize Alamouti space time code for inter-user
cooperation and in addition utilize a third relay which performs network coding. The third relay does not
have any of its information to be sent. In this paper we propose a scheme utilizing convolutional code based
network coding, instead of conventional XOR based network code and utilize iterative joint networkchannel
decoder for efficient decoding. Extrinsic information transfer (EXIT) chart analysis is performed to
investigate the convergence property of the proposed decoder.
EFFICIENTLY SECURE BROADCASTING IN 5G WIRELESS FOG-BASED-FRONTHAUL NETWORKSijwmn
Enhanced Diversity and Network Coding (eDC-NC), the synergistic combination of Diversity and modified Triangular Network Coding, was introduced recently to provide efficient and ultra-reliable networking with near-instantaneous fault recovery. In this paper it is shown that eDC-NC technology can efficiently and securely broadcast messages in 5G wireless fog-computing-based Radio Access Networks (F-RAN). In particular, this work is directed towards demonstrating the ability of eDC-NC technology to more efficiently provide secure messages broadcasting than standardized methods such as Secure Multicasting using Secret (Shared) Key Cryptography, such that the adversary has no ability to acquire information
even if they wiretap the entire F-RAN network (except of course the source and destination nodes). Our results show that using secure eDC-NC technology in F-RAN fronthaul network will enhance secure broadcasting and provide ultra-reliability networking, near-instantaneous fault recovery, and retain the
throughput benefits of Network Coding
EFFICIENTLY SECURE BROADCASTING IN 5G WIRELESS FOG-BASED-FRONTHAUL NETWORKSijwmn
Enhanced Diversity and Network Coding (eDC-NC), the synergistic combination of Diversity and modified Triangular Network Coding, was introduced recently to provide efficient and ultra-reliable networking with near-instantaneous fault recovery. In this paper it is shown that eDC-NC technology can efficiently and securely broadcast messages in 5G wireless fog-computing-based Radio Access Networks (F-RAN). In particular, this work is directed towards demonstrating the ability of eDC-NC technology to more efficiently provide secure messages broadcasting than standardized methods such as Secure Multicasting
using Secret (Shared) Key Cryptography, such that the adversary has no ability to acquire information even if they wiretap the entire F-RAN network (except of course the source and destination nodes). Our results show that using secure eDC-NC technology in F-RAN fronthaul network will enhance secure broadcasting and provide ultra-reliability networking, near-instantaneous fault recovery, and retain the throughput benefits of Network Coding.
NONLINEAR MODELING AND ANALYSIS OF WSN NODE LOCALIZATION METHODijwmn
In this paper, node localization algorithms in wireless sensor networks are researched, the traditional algorithms are studied, and some meaningful results are obtained. For the localization algorithm and route planning of WSN exists a big localization error in wireless communication. WSN communication system is researched. According to the anchor nodes and unknown nodes, a new localization algorithm and route planning method of WSN are proposed in this paper. At the same time, a new genetic algorithm of route planning of WSN is proposed. The performance of the node density and localization error is simulated and analyzed. The simulation results show that the performance of proposed WSN localization algorithm and route planning method are better than the traditional algorithms.
NONLINEAR MODELING AND ANALYSIS OF WSN NODE LOCALIZATION METHODijwmn
In this paper, node localization algorithms in wireless sensor networks are researched, the traditional
algorithms are studied, and some meaningful results are obtained. For the localization algorithm and route
planning of WSN exists a big localization error in wireless communication. WSN communication system is
researched. According to the anchor nodes and unknown nodes, a new localization algorithm and route
planning method of WSN are proposed in this paper. At the same time, a new genetic algorithm of route
planning of WSN is proposed. The performance of the node density and localization error is simulated and
analyzed. The simulation results show that the performance of proposed WSN localization algorithm and
route planning method are better than the traditional algorithms.
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...csandit
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of
potential applications in civilian and military sectors. The self-control, self-organization,
topology dynamism, and bandwidth limitation of the wireless communication channel make
implementation of MANETs a challenging task. The Connected Dominating Set (CDS) has been
proposed to facilitate MANETs realization. Minimizing the CDS size has several advantages;
however, this minimization is NP complete problem; therefore, approximation algorithms are
used to tackle this problem. The fastest CDS creation algorithm is Wu and Li algorithm;
however, it generates a relatively high signaling overhead. Utilizing the location information of
network members reduces the signaling overhead of Wu and Li algorithm. In this paper, we
compare the performance of Wu and Li algorithm with its Location-Information-Based version
under two types of Medium Access Control protocols, and several network sizes. The MAC
protocols used are: a virtual ideal MAC protocol, and the IEEE 802.11 MAC protocol. The use
of a virtual ideal MAC enables us to investigate how the real-world performance of these
algorithms deviates from their ideal-conditions counterpart. The simulator used in this research
is the ns-2 network simulator.
A SIMULATION-BASED PERFORMANCE COMPARISON OF MANETS CDS CREATION ALGORITHMS U...cscpconf
Mobile Ad Hoc networks (MANETs) are gaining increased interest due to their wide range of potential applications in civilian and military sectors. The self-control, self-organization,
topology dynamism, and bandwidth limitation of the wireless communication channel make implementation of MANETs a challenging task. The Connected Dominating Set (CDS) has been proposed to facilitate MANETs realization. Minimizing the CDS size has several advantages; however, this minimization is NP complete problem; therefore, approximation algorithms are
used to tackle this problem. The fastest CDS creation algorithm is Wu and Li algorithm; however, it generates a relatively high signaling overhead. Utilizing the location information of
network members reduces the signaling overhead of Wu and Li algorithm. In this paper, we compare the performance of Wu and Li algorithm with its Location-Information-Based version
under two types of Medium Access Control protocols, and several network sizes. The MAC protocols used are: a virtual ideal MAC protocol, and the IEEE 802.11 MAC protocol. The use of a virtual ideal MAC enables us to investigate how the real-world performance of these algorithms deviates from their ideal-conditions counterpart. The simulator used in this research
is the ns-2 network simulator.
SR-Code: Smart Relay Network Coding for Data Collection for Wireless Sensor N...IJERA Editor
Reliability in data collection for wireless sensor networks is one of the major problems in IoT applications. Sensor nodes are usually placed in harsh conditions where data communication is at risk of losing packets. Retransmissions are considered costly in terms of delay and power consumptions, especially that wireless sensor nodes are battery operated. In this context we introduce SR-Code, a novel network coding algorithm that achieves reliability in harsh conditions. SR-Code utilizes the XOR operator to code overheard packets. The targeted network topology is a 2-tier network where data loss can occur in all tiers. SR-Code utilizes bit addresses where each node is identified by a single bit in an address bit vector. Identifying packets and computing the cardinality of coded messages can be easily done using address bit vectors. SR-Code realizes redundancy as a function of overheard packet. SR-Code achieved a reliability factor of 75% when the number of packets lost was 100% of the original (un-coded) packet sent.
Data transmitted encryption for clustering protocol in heterogeneous wireless...nooriasukmaningtyas
In this paper, elliptic curves Diffie Hellman-Rivest Shamir Adleman algorithm (ECDH-RSA) is a novel encryption method was proposed, which based on ECDH and RSA algorithm to secure transmitted data in heterogeneous wireless sensor networks (HWSNs). The proposed encryption is built under cheesboard clustering routing method (CCRM). The CCRM used to regulate energy consumption of the nodes. To achieve good scalability and performance by using limited powerful max-end sensors besides a large powerful of min-end sensors. ECDH is used for the sharing of public and private keys because of its ability to provide small key size high protection. The proposed authentication key is generated by merging it with the reference number of the node, and distance to its cluster head (CH). Decreasing the energy intake of CHs, RSA encryption allows CH to compile the tha data which encrypted with no need to decrypt it. The results of the simulation show that the approach could maximize the life of the network by nearly (47%, and 35.7%) compare by secure low-energy adaptive clustering hierarchy (Sec-LEACH and SL-LEACH) approches respectively.
Node Legitimacy Based False Data Filtering Scheme in Wireless Sensor NetworksEswar Publications
False data injection attack is a serious threat to wireless sensor network. In this paper, a node legitimacy based false data filtering scheme (NLFS) is proposed. NLFS verifies not only message authentication codes (MACs) contains in reports, but also the legitimacy of nodes that endorse the report. The verification guarantees that compromised nodes from different geographical areas cannot collude to inject false data, which makes NLFS has a high tolerance of compromised nodes. In addition, NLFA only utilizes the relationships between node IDs to verify the legitimacy of nodes without other software or hardware overhead. Simulation results show that NLFS can filter 95% false reports within three hops and is resilience to an increasing number of compromised nodes.
A Traffic-Aware Key Management Architecture for Reducing Energy Consumption i...IDES Editor
In Wireless Sensor Networks (WSNs), most
of the existing key management schemes, establish shared
keys for all pairs of neighbor sensor nodes without
considering the communication between these nodes.
When the number of sensor nodes in WSNs is increased
then each sensor node is to be loaded with bulky amount
of keys. In WSNs a sensor node may communicate with a
small set of neighbor sensor nodes. Based on this fact, in
this paper, an energy efficient Traffic-Aware Key
Management (TKM) scheme is developed for WSNs,
which only establishes shared keys for active sensors
which participate in direct communication. The proposed
scheme offers an efficient Re-keying mechanism to
broadcast keys without the need for retransmission or
acknowledgements. Numerical results show that proposed
key management scheme achieves high connectivity. In
the simulation experiments, the proposed key
management scheme is applied for different routing
protocols. The performance evaluation shows that
proposed scheme gives stronger resilence, low energy
consumption and lesser end to end delay.
PERFORMANCE ANALYSIS OF SYMMETRIC KEY CIPHERS IN LINEAR AND GRID BASED SENSOR...cscpconf
The linear and grid based Wireless Sensor Networks (WSN) are formed by applications where
objects being monitored are either placed in linear or grid based form. E.g. monitoring oil,
water or gas pipelines; perimeter surveillance; monitoring traffic level of city streets, goods
warehouse monitoring. The security of data is a critical issue for all such applications and as
the devices used for the monitoring purpose have several resource constraints (bandwidth,
storage capacity, battery life); it is significant to have a lightweight security solution. Therefore,
we consider symmetric key based solutions proposed in the literature as asymmetric based
solutions require more computation, energy and storage of keys. We analyse the symmetric
ciphers with respect to the performance parameters: RAM, ROM consumption and number of
CPU cycles. We perform this simulation analysis in Contiki Cooja by considering an example
scenario on two different motes namely: Sky and Z1. The aim of this analysis is to come up with
the best suited symmetric key based cipher for the linear and grid based WSN.
A High Performance Hybrid Two Dimensional Spectral/Spatial NZCC/MD Code for S...IJCNCJournal
This paper proposes a new technique to construct a hybrid zero cross-correlation (NZCC) based on multiple diagonal (MD) code for two-dimensional (2D) spectral amplitude coding for optical code division multiple access code division multiple access (SAC-OCDMA) systems. The proposed hybrid code eliminates totally the multiple access interference (MAI) between a large number of users and allows them to connect simultaneously via the optical communication link with a high speed to receive huge data and serve various areas such as Internet, telephony, DAB radio, digital audio broadcasting, and DVB video. Simulation results demonstrate that the performance of such a SAC-OCDA system based on novel 2D hybrid NZCC/MD code can be easily improved keeping a less complex structure using couplers for direct spectral/spatial dimension (SDD) detection and show superior bit error rate (BER) values comparing to previously developed two-dimensional codes including perfect difference (2D-PD), diagonal Eigen-value units (2D-DEU), multi-service (2D-MS) and balanced incomplete block design (2D-BIBD) codes.
Similar to Full Communication in a Wireless Sensor Network by Merging Blocks of a Key Predistribution using Reed Solomon Code (20)
ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR cscpconf
The progressive development of Synthetic Aperture Radar (SAR) systems diversify the exploitation of the generated images by these systems in different applications of geoscience. Detection and monitoring surface deformations, procreated by various phenomena had benefited from this evolution and had been realized by interferometry (InSAR) and differential interferometry (DInSAR) techniques. Nevertheless, spatial and temporal decorrelations of the interferometric couples used, limit strongly the precision of analysis results by these techniques. In this context, we propose, in this work, a methodological approach of surface deformation detection and analysis by differential interferograms to show the limits of this technique according to noise quality and level. The detectability model is generated from the deformation signatures, by simulating a linear fault merged to the images couples of ERS1 / ERS2 sensors acquired in a region of the Algerian south.
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATIONcscpconf
A novel based a trajectory-guided, concatenating approach for synthesizing high-quality image real sample renders video is proposed . The lips reading automated is seeking for modeled the closest real image sample sequence preserve in the library under the data video to the HMM predicted trajectory. The object trajectory is modeled obtained by projecting the face patterns into an KDA feature space is estimated. The approach for speaker's face identification by using synthesise the identity surface of a subject face from a small sample of patterns which sparsely each the view sphere. An KDA algorithm use to the Lip-reading image is discrimination, after that work consisted of in the low dimensional for the fundamental lip features vector is reduced by using the 2D-DCT.The mouth of the set area dimensionality is ordered by a normally reduction base on the PCA to obtain the Eigen lips approach, their proposed approach by[33]. The subjective performance results of the cost function under the automatic lips reading modeled , which wasn’t illustrate the superior performance of the
method.
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...cscpconf
Universities offer software engineering capstone course to simulate a real world-working environment in which students can work in a team for a fixed period to deliver a quality product. The objective of the paper is to report on our experience in moving from Waterfall process to Agile process in conducting the software engineering capstone project. We present the capstone course designs for both Waterfall driven and Agile driven methodologies that highlight the structure, deliverables and assessment plans.To evaluate the improvement, we conducted a survey for two different sections taught by two different instructors to evaluate students’ experience in moving from traditional Waterfall model to Agile like process. Twentyeight students filled the survey. The survey consisted of eight multiple-choice questions and an open-ended question to collect feedback from students. The survey results show that students were able to attain hands one experience, which simulate a real world-working environment. The results also show that the Agile approach helped students to have overall better design and avoid mistakes they have made in the initial design completed in of the first phase of the capstone project. In addition, they were able to decide on their team capabilities, training needs and thus learn the required technologies earlier which is reflected on the final product quality
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIEScscpconf
Using social media in education provides learners with an informal way for communication. Informal communication tends to remove barriers and hence promotes student engagement. This paper presents our experience in using three different social media technologies in teaching software project management course. We conducted different surveys at the end of every semester to evaluate students’ satisfaction and engagement. Results show that using social media enhances students’ engagement and satisfaction. However, familiarity with the tool is an important factor for student satisfaction.
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGICcscpconf
In real world computing environment with using a computer to answer questions has been a human dream since the beginning of the digital era, Question-answering systems are referred to as intelligent systems, that can be used to provide responses for the questions being asked by the user based on certain facts or rules stored in the knowledge base it can generate answers of questions asked in natural , and the first main idea of fuzzy logic was to working on the problem of computer understanding of natural language, so this survey paper provides an overview on what Question-Answering is and its system architecture and the possible relationship and
different with fuzzy logic, as well as the previous related research with respect to approaches that were followed. At the end, the survey provides an analytical discussion of the proposed QA models, along or combined with fuzzy logic and their main contributions and limitations.
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS cscpconf
Human beings generate different speech waveforms while speaking the same word at different times. Also, different human beings have different accents and generate significantly varying speech waveforms for the same word. There is a need to measure the distances between various words which facilitate preparation of pronunciation dictionaries. A new algorithm called Dynamic Phone Warping (DPW) is presented in this paper. It uses dynamic programming technique for global alignment and shortest distance measurements. The DPW algorithm can be used to enhance the pronunciation dictionaries of the well-known languages like English or to build pronunciation dictionaries to the less known sparse languages. The precision measurement experiments show 88.9% accuracy.
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS cscpconf
In education, the use of electronic (E) examination systems is not a novel idea, as Eexamination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments.
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTICcscpconf
African Buffalo Optimization (ABO) is one of the most recent swarms intelligence based metaheuristics. ABO algorithm is inspired by the buffalo’s behavior and lifestyle. Unfortunately, the standard ABO algorithm is proposed only for continuous optimization problems. In this paper, the authors propose two discrete binary ABO algorithms to deal with binary optimization problems. In the first version (called SBABO) they use the sigmoid function and probability model to generate binary solutions. In the second version (called LBABO) they use some logical operator to operate the binary solutions. Computational results on two knapsack problems (KP and MKP) instances show the effectiveness of the proposed algorithm and their ability to achieve good and promising solutions.
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAINcscpconf
In recent years, many malware writers have relied on Dynamic Domain Name Services (DDNS) to maintain their Command and Control (C&C) network infrastructure to ensure a persistence presence on a compromised host. Amongst the various DDNS techniques, Domain Generation Algorithm (DGA) is often perceived as the most difficult to detect using traditional methods. This paper presents an approach for detecting DGA using frequency analysis of the character distribution and the weighted scores of the domain names. The approach’s feasibility is demonstrated using a range of legitimate domains and a number of malicious algorithmicallygenerated domain names. Findings from this study show that domain names made up of English characters “a-z” achieving a weighted score of < 45 are often associated with DGA. When a weighted score of < 45 is applied to the Alexa one million list of domain names, only 15% of the domain names were treated as non-human generated.
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...cscpconf
The amount of piracy in the streaming digital content in general and the music industry in specific is posing a real challenge to digital content owners. This paper presents a DRM solution to monetizing, tracking and controlling online streaming content cross platforms for IP enabled devices. The paper benefits from the current advances in Blockchain and cryptocurrencies. Specifically, the paper presents a Global Music Asset Assurance (GoMAA) digital currency and presents the iMediaStreams Blockchain to enable the secure dissemination and tracking of the streamed content. The proposed solution provides the data owner the ability to control the flow of information even after it has been released by creating a secure, selfinstalled, cross platform reader located on the digital content file header. The proposed system provides the content owners’ options to manage their digital information (audio, video, speech, etc.), including the tracking of the most consumed segments, once it is release. The system benefits from token distribution between the content owner (Music Bands), the content distributer (Online Radio Stations) and the content consumer(Fans) on the system blockchain.
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEMcscpconf
This paper discusses the importance of verb suffix mapping in Discourse translation system. In
discourse translation, the crucial step is Anaphora resolution and generation. In Anaphora
resolution, cohesion links like pronouns are identified between portions of text. These binders
make the text cohesive by referring to nouns appearing in the previous sentences or nouns
appearing in sentences after them. In Machine Translation systems, to convert the source
language sentences into meaningful target language sentences the verb suffixes should be
changed as per the cohesion links identified. This step of translation process is emphasized in
the present paper. Specifically, the discussion is on how the verbs change according to the
subjects and anaphors. To explain the concept, English is used as the source language (SL) and
an Indian language Telugu is used as Target language (TL)
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...cscpconf
In this paper, based on the definition of conformable fractional derivative, the functional
variable method (FVM) is proposed to seek the exact traveling wave solutions of two higherdimensional
space-time fractional KdV-type equations in mathematical physics, namely the
(3+1)-dimensional space–time fractional Zakharov-Kuznetsov (ZK) equation and the (2+1)-
dimensional space–time fractional Generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony
(GZK-BBM) equation. Some new solutions are procured and depicted. These solutions, which
contain kink-shaped, singular kink, bell-shaped soliton, singular soliton and periodic wave
solutions, have many potential applications in mathematical physics and engineering. The
simplicity and reliability of the proposed method is verified.
AUTOMATED PENETRATION TESTING: AN OVERVIEWcscpconf
The using of information technology resources is rapidly increasing in organizations,
businesses, and even governments, that led to arise various attacks, and vulnerabilities in the
field. All resources make it a must to do frequently a penetration test (PT) for the environment
and see what can the attacker gain and what is the current environment's vulnerabilities. This
paper reviews some of the automated penetration testing techniques and presents its
enhancement over the traditional manual approaches. To the best of our knowledge, it is the
first research that takes into consideration the concept of penetration testing and the standards
in the area.This research tackles the comparison between the manual and automated
penetration testing, the main tools used in penetration testing. Additionally, compares between
some methodologies used to build an automated penetration testing platform.
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORKcscpconf
Since the mid of 1990s, functional connectivity study using fMRI (fcMRI) has drawn increasing
attention of neuroscientists and computer scientists, since it opens a new window to explore
functional network of human brain with relatively high resolution. BOLD technique provides
almost accurate state of brain. Past researches prove that neuro diseases damage the brain
network interaction, protein- protein interaction and gene-gene interaction. A number of
neurological research paper also analyse the relationship among damaged part. By
computational method especially machine learning technique we can show such classifications.
In this paper we used OASIS fMRI dataset affected with Alzheimer’s disease and normal
patient’s dataset. After proper processing the fMRI data we use the processed data to form
classifier models using SVM (Support Vector Machine), KNN (K- nearest neighbour) & Naïve
Bayes. We also compare the accuracy of our proposed method with existing methods. In future,
we will other combinations of methods for better accuracy.
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...cscpconf
In order to treat and analyze real datasets, fuzzy association rules have been proposed. Several
algorithms have been introduced to extract these rules. However, these algorithms suffer from
the problems of utility, redundancy and large number of extracted fuzzy association rules. The
expert will then be confronted with this huge amount of fuzzy association rules. The task of
validation becomes fastidious. In order to solve these problems, we propose a new validation
method. Our method is based on three steps. (i) We extract a generic base of non redundant
fuzzy association rules by applying EFAR-PN algorithm based on fuzzy formal concept analysis.
(ii) we categorize extracted rules into groups and (iii) we evaluate the relevance of these rules
using structural equation model.
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATAcscpconf
In many applications of data mining, class imbalance is noticed when examples in one class are
overrepresented. Traditional classifiers result in poor accuracy of the minority class due to the
class imbalance. Further, the presence of within class imbalance where classes are composed of
multiple sub-concepts with different number of examples also affect the performance of
classifier. In this paper, we propose an oversampling technique that handles between class and
within class imbalance simultaneously and also takes into consideration the generalization
ability in data space. The proposed method is based on two steps- performing Model Based
Clustering with respect to classes to identify the sub-concepts; and then computing the
separating hyperplane based on equal posterior probability between the classes. The proposed
method is tested on 10 publicly available data sets and the result shows that the proposed
method is statistically superior to other existing oversampling methods.
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCHcscpconf
Data collection is an essential, but manpower intensive procedure in ecological research. An
algorithm was developed by the author which incorporated two important computer vision
techniques to automate data cataloging for butterfly measurements. Optical Character
Recognition is used for character recognition and Contour Detection is used for imageprocessing.
Proper pre-processing is first done on the images to improve accuracy. Although
there are limitations to Tesseract’s detection of certain fonts, overall, it can successfully identify
words of basic fonts. Contour detection is an advanced technique that can be utilized to
measure an image. Shapes and mathematical calculations are crucial in determining the precise
location of the points on which to draw the body and forewing lines of the butterfly. Overall,
92% accuracy were achieved by the program for the set of butterflies measured.
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...cscpconf
Smart cities utilize Internet of Things (IoT) devices and sensors to enhance the quality of the city
services including energy, transportation, health, and much more. They generate massive
volumes of structured and unstructured data on a daily basis. Also, social networks, such as
Twitter, Facebook, and Google+, are becoming a new source of real-time information in smart
cities. Social network users are acting as social sensors. These datasets so large and complex
are difficult to manage with conventional data management tools and methods. To become
valuable, this massive amount of data, known as 'big data,' needs to be processed and
comprehended to hold the promise of supporting a broad range of urban and smart cities
functions, including among others transportation, water, and energy consumption, pollution
surveillance, and smart city governance. In this work, we investigate how social media analytics
help to analyze smart city data collected from various social media sources, such as Twitter and
Facebook, to detect various events taking place in a smart city and identify the importance of
events and concerns of citizens regarding some events. A case scenario analyses the opinions of
users concerning the traffic in three largest cities in the UAE
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGEcscpconf
The anonymity of social networks makes it attractive for hate speech to mask their criminal
activities online posing a challenge to the world and in particular Ethiopia. With this everincreasing
volume of social media data, hate speech identification becomes a challenge in
aggravating conflict between citizens of nations. The high rate of production, has become
difficult to collect, store and analyze such big data using traditional detection methods. This
paper proposed the application of apache spark in hate speech detection to reduce the
challenges. Authors developed an apache spark based model to classify Amharic Facebook
posts and comments into hate and not hate. Authors employed Random forest and Naïve Bayes
for learning and Word2Vec and TF-IDF for feature selection. Tested by 10-fold crossvalidation,
the model based on word2vec embedding performed best with 79.83%accuracy. The
proposed method achieve a promising result with unique feature of spark for big data.
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXTcscpconf
This article presents Part of Speech tagging for Nepali text using General Regression Neural
Network (GRNN). The corpus is divided into two parts viz. training and testing. The network is
trained and validated on both training and testing data. It is observed that 96.13% words are
correctly being tagged on training set whereas 74.38% words are tagged correctly on testing
data set using GRNN. The result is compared with the traditional Viterbi algorithm based on
Hidden Markov Model. Viterbi algorithm yields 97.2% and 40% classification accuracies on
training and testing data sets respectively. GRNN based POS Tagger is more consistent than the
traditional Viterbi decoding technique.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
2. 390 Computer Science & Information Technology (CS & IT)
materials (CBRNE),monitor traffic movement in city rodes and highway, Due to the critical
functionality of WSN, communication between the nodes must be encrypted to make it immune
to unauthorized accesses. Considering the architectural design,WSN can be segmented to two
classes, viz.:
1. HierarchalWireless Sensor Network(HWSN): In this HWSN, there is a predefined hierarchy
in the participating sensor nodes. There are three levels in the HWSN model they are- the
base station, the cluster head and the sensor node. There are three types of communication
possible in HWSN. They are:
– Unicast - sensor node to sensor node,
– Multicast - group wise communication and
– Broadcast base station to sensor nodes.
2. Distributed Wireless Sensor Network (DWSN): In case of DWSN there is no fixed type of
architecture in the sensor nodes. The topology is unknown before the deployment. The mode
of communication is always Unicast in this case.
1.1 RelatedWorks and our contributions
Key predistribution in sensor networks was first considered by Eschenaur and Gligor [4]. In their
work, every key is associated with an unique key identifier. To form the Key rings of the sensors,
keys are randomly drawn from the key pool. Key establishment is also random. Such method of
key predistributuion is probabilistic in the sense that both key distribution and establishment is
done randomly. Many such probabilistic key predistribution schemes have been well studied and
presented in a survey report published in 2005 by C¸ ampete and Yenner [2].
For the above probabilistic approach, shared key establishment and path key discovery can
become very difficult. Lee and Stinson proposed two schemes [5–7] where they have adopted
combinatorial techniques for predistribuion and later establishment of keys. Their works also
suggests that both shared key establishment and path key discovery can be better achieved by the
suggested deterministic approach. Some other deterministic schemes have been proposed by Ruj
and Roy using various combinatorial designs like PBIBD and Transversal Designs in their works
[8, 9] respectively. Very recently unique factorization of polynomials over Finite Fields has been
invoked by Sarkar and Chowdhury [15] to give a KPD scheme while Bag and Ruj [1] utilizes
Affine plane geometry over Finite field for similar purpose.
Hybrid key predistribution scheme by Merging block technique in WSN was first proposed by
Chakarabarti et. al. [3]. Their merging block technique was based on transversal design proposed
by Lee and Stinson [5, 6]. Transversal design proposed by Lee and Stinson [5, 6] has a major
drawback i.e., the absence of full communication hence intermediate nodes were incorporated
which increase overall system overhead. Here nodes were merged in random fashion to get new
nodes. The objective was to increase number of common keys between any two given new
(merged) nodes and achieve full communication within the system.
There are other schemes with similar drawback. For instance a key pre-distribution scheme using
Reed-Solomon code with parameters (n, qk, d, q) was proposed by Ruj and Roy[10]. The authors
of [10] has established the number of common key between any two given nodes are at most k−1.
3. Computer Science & Information Technology (CS & IT) 391
Thus in their scheme with high probability direct communication may not be possible between
given pair of nodes.
In this paper we apply the merging block scheme on the nodes in WSN where key-predistribuion
is done by Reed-Solomon code. Using this merging block technique one can observe the
increment of common keys between any two given merged block hence increase the probability
of direct communication. This greatly enhance system efficiency.
Of course inability of direct communication is not the only deficiency of Ruj & Roy’s scheme in
[10]. These scheme like most KPD scheme is faced with a serius problem of selective node attack
during key establishment phase. In their recently published pioneering work, Sarkar et al. [11] has
develop a novel black box technique which ensure security against this form of attack. They have
theoretically established that their method enhances security of the overall messaging immensely.
Of late this technique have been used to by Sarkar & Saha in [12], Bag, Saha & Sarkar in [13, 14]
to improved schemes proposed in [8, 1, 5–7] respectively.
2 Preliminaries
This section is devoted to describing various preliminary aspects that we shall use while
designing our key predistribution scheme. As described earlier, we shall develop our merging
block design based on a KPD scheme proposed by Ruj and Roy [10] that uses Reed–Solomon
codes. Hence after briefly stating the basics of BIBD designs in section 2.1, we move on to
describing their scheme in section 2.2 and then point out a potential weakness in their proposed
scheme in section 2.3.
2.1 Combinatorial design: BIBD
2.2 Key Predistribution using Reed Solomon code
Consider a (n, qk
, d, q) Reed Solomon code having alphabet in the finite field Fq for q > 2. The
length of the code is n = q − 1, distance is d = n− k +1 and dimension is k. The number of
codeword is M = qk
. When this code is mapped to a Wireless Sensor Network, number of node in
the network is qk
each having q − 1 number of keys. The number of common keys between any
two nodes is n-d = k -1. For any codeword x = (a1 , a2 , . . . , an ), the keys assigned to the node x
4. 392 Computer Science & Information Technology (CS & IT)
are (a1 , 1), (a2 , 2), . . . , (an , n
Fq , i = 1, 2, . . . , n}. Let Fq be
over Fq of degree at most k − 1.
non-zero elements of Fq . For each
. . . , ρi(αq−1 )) to be the i-th cod
ρ}. so, C is a Reed Solomon code.
A sample network having 16 nodes is present in figure 1
Fig. 1. WSN based on KPD using Reed Solomon codes where q = 4, k = 2
2.3 Weakness : Motivation of our work
Among several other weaknesses we figure out a potenti
communication within the above mentioned sche
predistribution. This clearly indicates that there are
communication between any pair of given node is not possible, which may lead to
system overhead.
Computer Science & Information Technology (CS & IT)
n). The key pool consists of qn number of keys {(a
e a finite field of q > 2 elements. Let ρ be the set of
. Thus |ρ| = qk Let F ∗ = {α1 , α2 , . . . , αq−1 }
r each polynomial ρi(x) ∈ ρ, it is defined cpi = (ρi(α
odeword of length q − 1. It is defined that C = {cpi
e.
A sample network having 16 nodes is present in figure 1
WSN based on KPD using Reed Solomon codes where q = 4, k = 2
Weakness : Motivation of our work
Among several other weaknesses we figure out a potential weak point i.e. lack of full
communication within the above mentioned scheme using Reed Solomon codes for key
predistribution. This clearly indicates that there are several possibilities that direct
communication between any pair of given node is not possible, which may lead to
ai, i) : ai ∈
polynomials
be the set of
1 ), ρi(α2 ),
i : pi (x) ∈
al weak point i.e. lack of full
me using Reed Solomon codes for key
veral possibilities that direct
communication between any pair of given node is not possible, which may lead to increased
5. Computer Science & Information Technology (CS & IT) 393
3 Remedial Strategy : Merging block in combinatorial design
Merging block technique is a novel trick to overcome the drawbacks imposed by the KPD using
Reed Solomon code. In this merging block technique several blocks are randomly merged
together to form a new node. Here the model is flexible enough that one can mention the number
of blocks to merged together randomly (here denoted by z). This technique causes increment of
keys in newly formed node, which ensures increment of probability that any given pair nodes can
communicate directly. Details of technical results are discussed bellow.
This KPD design prosed in [10] can be easily checked to be a (v, b, r, k) − 1 BIBD having
configuration v = rk and b = q2. Here z many blocks are merged together to form a node where
In this merging block technique we use a probabilistic i.e. a random merging technique. This
approach mainly involves two steps
1. First the key predistribution is done using Reed-Solomon code
2. Then randomly some number of nodes (usually this number is denoted with z) are merged
together which makes new nodes.
After the blocks are merged, in a newly merged node there may be several repeating keys. This
repeating keys indicate the possibility that intra-node communication may happen. In this random
merging approach, one can’t ensure that the nodes that are being merged will not share a common
key. To eliminate the possibility of intra-node communication, one trick is to take all the keys
once while merging. As such we can make use of a heuristic suggested by Chakraborti et. al [3,
section 4] to address this issue.
A typical picture of merging block design corresponding to network of figure 1 on 16 nodes with
z = 4 is given in figure 2.
6. 394 Computer Science & Information Technology (CS & IT)
Fig. 2. Same WSN using merging block over Reed Solomon code where q = 4, k = 2, z = 4.
4 Key establishment : Merged block formation
Here blocks are merged in randomizedmanner. Let array node[0 : qk
−1] denotes the array of
node id and array_ key[0 : qk
− 1][0 : q − 1] be the array containing all keys of every node.
7. Computer Science & Information Technology (CS & IT) 395
Start of algorithm.
Take a value z (the no of nodes to merge together to form a new node).
Take a new array array node random[0 : qk
− 1].
Randomize elements of array node[0 : qk
− 1] array node random[0 : qk
−1] := array node
[0 : qk
− 1].
Take a new array array node merge[0 : N][0 : z] take z number of elements
from array node random [0 : qk
− 1] and store it to array nodemerge[0 :N][0 : z].
if Key from the array array key[0 : qk
− 1][0 : q − 1] is not present in
array_ key_ merge[0 : N][0 : z][0 : q − 1] then
Find the keys of the nodes in array node merge[0 : N][0 : z] from the
array array key[0 : qk
− 1][0 : q − 1] and store it to to a new array
array key merge[0 : N][0 : (q − 1) * z].
else
Skip it and move to next key.
end if
The array array key merge[0 : N][0 : (q − 1) * z] contain keys of all merged
block where no intra-node common key is present.
End of algorithm.
5 Communication
After the blocks are merged, communication between new nodes takes place. Here the Reed-
Solomon code is taken as (n, qk
, d, q). The number of common key between any two given nodes
at most k−1, i.e., varies from 0 to k−1.When the sensors are merged to form big blocks of z many
sensors each, number of common keys between any pair of given nodes increases which greatly
increases probability of direct communication between any pair of given nodes. The
communication testing algorithm between any pair of nodes is discussed bellow.
Start of algorithm.
Take input id1 and id2 which denotes the node id of a pair of nodes.
Initialize flag as flag = 0.
for i=0:(q-1)*z do
for j=0:(q-1)*z do
if array key merge[id1][i] = array key merge[id2][j] then
flag := flag + 1
end if
end for
end for
end for
if flag! = 0 then
8. 396 Computer Science & Information Technology (CS & IT)
Direct communication possible.
else
Direct communication not possible
end if
End of algorithm.
6 Communication Probability
7 Resilience
Under adversarial situation, one or more numbers of sensor nodes may get compromised. In that
case, all the keys in the node(s) get exposed. They can’t be used in the secret communication any
longer. Links which are connected by those exposed keys will be broken.When communication
links are broken, communication may still exists using alternative paths. Now, another situation
may takes place. Let there is node which have all keys compromised. Then the node will get
disconnected. Node disconnection is a fatal situation as there is no way to communicate with the
disconnected node. After the nodes get compromised, one has to calculate the proportion of links
broken i.e. the links can not be used any further. This proportion is denoted by E(s). Thus,
From the paper of D. Chakrabarti et al., in merging block technique the calculation of E(s) is as
bellow.
9. Computer Science & Information Technology (CS & IT) 397
7.1 Calculation of E(s)
Let N1 & N2 be any 2 given merged nodes. Consider two events E & F as follows:
1. E: N1 and N2 are disconnected after the failure of s number of nodes,
2. F: N1 and N2 were connected before the failure of those s nodes.
Then we can clearly see that
Now let X be a random variabledenotingthe number of common keys between N1 and N2. Thus
we may assume that X follows B(z2
p1), i.e. it follows Binomial distribution in accordance to the
assumption made in Chakrabarti et. al. [3, section 3]. Thus,
Next we can consider two events:
1. E1i : i number of keys (shared between N1 and N2) are revealed consequent upon the failure
of s nodes,
2. E2i : inumber of keys are shared between N1 and N2.
10. 398 Computer Science & Information Technology (CS & IT)
8 Experimental Results
Simulation results for E(s) are presented in table 1 and table 2 compares our results with Ruj &
Roy [10] where k = 2 is assumed for a network with N = 2401 nodes. Thus in our case we take N
= 2550 nodes. In both cases we have assumed s = 10 nodes have been captured. Their
communication probability ρc = p1 = the expected number of keys for a given pair of nodes. In the
tables ‘RS’ means Reed-Solomon scheme that has been presented in [10] while ‘MB’ means the
present scheme. In the experiment we considered q = 49. So, total number of nodes in the
network is 492
= 2401. Now z = 4 i.e 4 nodes are merged together to form a new merged node.
This renders the following scheme.
N S=3 S=4 S=5 S=7 S=8 S=9 S=10
600 S=0.1697 0.1932 0.2109 0.2527 0.2715 0.2931 0.3164
2550 0.0657 .08374 0.1024 0.140 0.1592 0.1808 0.1997
Table 1. Simulation results for E(s) for N = 600, 2550 as s=number of nodes captured varies
9 Conclusion
In this paper a block merging technique is presented which is applied on key pre distribution
strategy using Reed Solomon code. Key pre distribution using reed Solomon code has several
drawbacks. So, in several situations direct communication is not possible when number of
common keys between two given node is 0. This causes indirect connection or hopping using a
intermediate node which increases system overhead. The merging block scheme in this paper
resolves this performance overhead greatly by increasing number of common keys between any
two given merged nodes while eliminating intra-node communication by reducing intra-node
common keys. Here in this paper the main goal is to achieve full communications within the
network keeping security intact if in some case some nodes get compromised. This block merging
strategy provides a very robust network ensuring full communication.
11. Computer Science & Information Technology (CS & IT) 399
10 Future Work
In thismerging block technique on Reed Solomon code is purely randomized.Whenever the blocks
are merged (where z is the number of nodes to merged together to form a new node) it is
impossible to determine participating blocks in a particular merged node (or block). So, the
control over this kind of model is pretty low. Moreover this whole merging is done during key
establishment. So, from the system administrator’s point of view, this can be a fatal situation.
This only can be resolved by a deterministic merging block technique. Because in deterministic
approach only those nodes are included in the newly formed node such that it generates no intra-
node common key. So, it can be clearly find out that deterministic approach is only the way to
tackle this minimized controlling factor.
Another future aspect of this randomized merging block technique is to tackle the primitive
requirement of Wireless Sensor Network (WSN) i.e. to reduced E(s) (mentioned earlier in this
paper) which improves resilient factor. In this probabilities merging block technique as the
number of common keys between any given pair of nodes is increased so there is a high chance
of intra node communication. So a better took is desirable to decrease the E(s) factor. As such if
the blocks can be merge deterministically prior to deployment, then we can think of applying a
novel black box scheme suggested recently by Sarkar et. al. [11] to the merged block design and
obtain much better resiliency.
Other than this, its is important to look KPD having full connectivity, high resiliency and is
equally scalable. In regards some Algebraic, Combinatorial or other Mathematical techniques
may be useful as has been proposed by Sarkar and Chowdhury in [15] and Bag and Ruj in [1].
Acknowledgement
We would like to heartily thank Ms. Amrita Saha, IIT, Bomay for discussion various aspects of
the paper. A special word of appreciation goes to Prof. Subhamoy Maitra, ISI, Kolkata for
motivating us to use their random block idea in the present case.
References
1. S. Bag and S. Ruj. Key Distribution in Wireless Sensor Networks using Finite Affine Plane. IEEE
Computer Society AINA-2011, pp. 436-442, 2011.
2. S. A. C¸ amtepe and B. Yener, Key distribution mechanisms for wireless sensor networks:A survey
2005. Technical Report, TR-05-07 Rensselaer Polytechnic Institute, Computer Science Department,
March 2005.
3. D. Chakrabarti, S. Maitra and B. Roy, A key pre-distribution scheme for wireless sensor networks:
merging blocks in combinatorial design, International Journal of Information Security, vol. 5, no. 2,
pp. 105–114, 2006.
4. L. Eschenauer and V. D. Gligor, A key-management scheme for distributed sensor networks, ACM
Conference on Computer and Communications Security, pp. 41–47., 2002
5. J. Y. Lee and D. R. Stinson, Deterministic key predistribution schemes for distributed sensor networks,
Selected Areas in Cryptography, ser. Lecture Notes in Computer Science, pp. 294–307, Springer,
2004.
12. 400 Computer Science & Information Technology (CS & IT)
6. J. Y. Lee and D. R. Stinson, A combinatorial approach to key predistribution for distributed sensor
networks, IEEE Wireless Communications and Networking Conference, WCNC 2005, New Orleans,
LA, USA, 2005.
7. J. Y. Lee and D. R. Stinson, On the construction of practical key predistribution schemes for
distributed sensor networks using combinatorial designs, ACM Trans. Inf. Syst. Secur., 11(2), 2008.
8. S. Ruj and B. Roy, Key predistribution using partially balanced designs in wireless sensor networks,
ISPA 2007, ser. Lecture Notes in Computer Science, Springer, Heidelberg, pp. 431–445, 2007.
9. S. Ruj and B. Roy, Revisiting key predistribution using transversal designs for a grid-based
deployment scheme, International Journal of Distributed Sensor Networks, IJDSN 5(6), pp:660–674,
2009.
10. S. Ruj and B. Roy, Key Predistribution Schemes Using Codes in Wireless Sensor Networks, Inscrypt
2008, LNCS 5487, Springer-Verlag Berlin Heidelberg., pp. 275–288, 2009.
11. P. Sarkar, A. Saha and M. U. Chowdhury. Secure Connectivity Model in Wireless Sensor Networks
Using First Order Reed-Muller Codes, MASS 2010, pp. 507–512, 2010.
12. P. Sarkar and A. Saha. Secure Connectivity Model in Wireless Sensor Networks Using First Order
Reed-Muller Codes, MASS 2010, pp. 507–512, 2010.
13. S. Bag, A. Saha and P. Sarkar. Highly Resilient Communication Using Affine Planes For Key
Predistribution And Reed Muller Codes For Connectivity InWireless Sensor Network, The Third
International Conference on Wireless & Mobile Networks (WiMo-2011), to be published, 2011.
14. S. Bag, A. Saha and P. Sarkar. Highly Resilient Key Predistribution Scheme Using Transversal
Designs And Reed Muller Codes For Wireless Sensor Network, The Fourth International Conference
on Network Security & Applications (CNSA-2011), to be published, 2011.
15. P. Sarkar and M. U. Chowdhury. Key Predistribution Scheme Using Finite Fields And Reed Muller
Codes, Accepted in SNPD 2011. Recommended for publication in ’Springers Studies in
Computational Science’, Springer, 2011.
16. D. R. Stinson Combinatorial Designs: Constructions and Analysis, Springer-Verlag, New
York, 2003.