The document describes a secure checkpointing approach for mobile environments. It proposes using elliptic curve cryptography combined with checkpointing to provide a low overhead, secure, fault tolerant system. Key points:
- Checkpointing is used to save system states to allow recovery from failures. Elliptic curve cryptography provides security by encrypting communication and generating digital signatures.
- The approach shifts cryptographic calculations to base stations to reduce mobile node overhead. Checkpoints and recovery information are stored at base stations.
- Mobile nodes save checkpoints and transfer them to the current base station they are connected to. A recovery algorithm allows processes to rollback and resume from the last saved checkpoint if a failure occurs.
A Novel Multipoint Relay based Secure Routing in MANETIJNSA Journal
Security in routing is a challenging issue in mobile ad-hoc (MANET) network because of its open nature, infrastructure less property, mobility and energy constraints. Messages typically roam in multi-hopped fashion and nodes may be powered by limited energy source and with limited physical security. So we proposed a new scheme which is significantly different from others available schemes to provide security during routing in mobile ad hoc networks. In this paper, our proposed scheme, Secure Multipoint Relay based Routing in MANET (SMRR) provides routing based on trust, which is an integer value that helps to select Multipoint Relay (administrator) inside the network for routing. We have also implemented the message confidentiality and integrity in our proposed scheme. Our simulation results show the robustness, reliability and trustworthiness of our scheme.
Optimized rationalize security and efficient data gathering in wireless senso...ijmnct
Wireless reprogramming during a wireless detector net- work (WSN) is that the method of propagating a
replacement code image or relevant commands to detector nodes. As a WSN is sometimes deployed in
hostile environments, secure reprogramming is and can continue to be a significant concern. Whereas all
existing insecure/secure reprogramming protocols square measure supported the centralized approach,
it\'s necessary to support distributed reprogramming during which multiple licensed network users will at
the same time and directly reprogram detector nodes while not involving the bottom station. Terribly
recently, a novel secure rationalize and distributed reprogramming protocol named SRDRP has been
planned, that is that the initial work of its kind. However, during this paper, we have a tendency to establish
associate inherent style weakness within the increased signature verification of SRDRP associated demonstrate
that it\'s at risk of associate impersonation attack by that an resister will simply impersonate any
licensed user to hold out reprogramming. Later on, we have a tendency to propose a straightforward
modification to mend the known security drawback while not losing any options of SRDRP. Our
experimental results demonstrate that it\'s able to eliminate the planning weakness by adding one-B
redundant information which the execution time of the prompt answer during a 1.6-GHz laptop personal
computer is not any quite one ms. Therefore, our answer is possible and secure for real-world applications.
Moreover, we have a tendency to show that, so as to additional improve the safety and potency of SRDRP;
any higher established identity-based position formula will be directly utilized in SRDRP. Supported
implementation results, we have a tendency to demonstrate potency improvement over the initial SRDRP
HARDWARE SECURITY IN CASE OF SCAN-BASED ATTACK ON CRYPTO-HARDWAREVLSICS Design
The latest innovation technology in computing devices has given a rise of compact, speedy and economical products which also embeds cryptography hardware on-chip. This device generally holds secret key and confidential information, more attention has been given to attacks on hardware which guards such secure information. The attacker may leak secret information from symmetric crypto-hardware (AES, DES etc.) using side-channel analysis, fault injection or exploiting existing test infrastructure. This paper examines various DFT based attack implementation method applied to cryptographic hardware. The paper contains an extensive analysis of attacks based on various parameters. The countermeasures are classified and analyzed in details.
Introduction: OSI Security Architecture, Security attacks, ,Security Services, Security
Mechanisms, Model for Network Security, Fundamentals of Abstract Algebra : Groups, Rings,
Fields, Modular Arithmetic, Euclidean Algorithm, Finite Fields of the form GF(p),Polynomial
Arithmetic, Finite Fields of the form GF(2n),Classical Encryption techniques, Block Ciphers and
Data Encryption Standard.
A Secure Data Communication System Using Cryptography and SteganographyIJCNCJournal
The information security has become one of the most significant problems in data communication. So it
becomes an inseparable part of data communication. In order to address this problem, cryptography and
steganography can be combined. This paper proposes a secure communication system. It employs
cryptographic algorithm together with steganography. The jointing of these techniques provides a robust
and strong communication system that able to withstand against attackers. In this paper, the filter bank
cipher is used to encrypt the secret text message, it provide high level of security, scalability and speed.
After that, a discrete wavelet transforms (DWT) based steganography is employed to hide the encrypted
message in the cover image by modifying the wavelet coefficients. The performance of the proposed system
is evaluated using peak signal to noise ratio (PSNR) and histogram analysis. The simulation results show
that, the proposed system provides high level of security.
Wireless Network Security Architecture with Blowfish Encryption ModelIOSR Journals
Abstract: In this research paper ,we developed a model for a large network, wireless nodes are interconnected and each can be considered as a node processor that offer services to other node processors connected to a specific network. A very high proportion of the nodes that offer services need to carry out an authentication process so as to make an access request to the node offering the service. In this context, an integrated reconfigurable network security architecture moved to the application layer has become the need of the day for secure wireless data sharing. The security schemes of the seven layer OSI architecture need to be placed intrinsically in the wireless node itself and should be capable of supporting the MAC layer, IP address based layer and the routing protocols of the network layer. This work focuses on the use of emulator and embedded hardware architectures for wireless network security. In this work, the individual nodes can have a unique security signature pattern maintained by respective wireless nodes using an encryption algorithm and this is made dynamic. The metrics includes latency, throughput, Scalability, Effects of data transfer operation on node processor and application data located in the processor Keywords:Wireless Network security, Embedded hardware, Reconfigurable architecture, blowfish algorithm
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.
A Novel Multipoint Relay based Secure Routing in MANETIJNSA Journal
Security in routing is a challenging issue in mobile ad-hoc (MANET) network because of its open nature, infrastructure less property, mobility and energy constraints. Messages typically roam in multi-hopped fashion and nodes may be powered by limited energy source and with limited physical security. So we proposed a new scheme which is significantly different from others available schemes to provide security during routing in mobile ad hoc networks. In this paper, our proposed scheme, Secure Multipoint Relay based Routing in MANET (SMRR) provides routing based on trust, which is an integer value that helps to select Multipoint Relay (administrator) inside the network for routing. We have also implemented the message confidentiality and integrity in our proposed scheme. Our simulation results show the robustness, reliability and trustworthiness of our scheme.
Optimized rationalize security and efficient data gathering in wireless senso...ijmnct
Wireless reprogramming during a wireless detector net- work (WSN) is that the method of propagating a
replacement code image or relevant commands to detector nodes. As a WSN is sometimes deployed in
hostile environments, secure reprogramming is and can continue to be a significant concern. Whereas all
existing insecure/secure reprogramming protocols square measure supported the centralized approach,
it\'s necessary to support distributed reprogramming during which multiple licensed network users will at
the same time and directly reprogram detector nodes while not involving the bottom station. Terribly
recently, a novel secure rationalize and distributed reprogramming protocol named SRDRP has been
planned, that is that the initial work of its kind. However, during this paper, we have a tendency to establish
associate inherent style weakness within the increased signature verification of SRDRP associated demonstrate
that it\'s at risk of associate impersonation attack by that an resister will simply impersonate any
licensed user to hold out reprogramming. Later on, we have a tendency to propose a straightforward
modification to mend the known security drawback while not losing any options of SRDRP. Our
experimental results demonstrate that it\'s able to eliminate the planning weakness by adding one-B
redundant information which the execution time of the prompt answer during a 1.6-GHz laptop personal
computer is not any quite one ms. Therefore, our answer is possible and secure for real-world applications.
Moreover, we have a tendency to show that, so as to additional improve the safety and potency of SRDRP;
any higher established identity-based position formula will be directly utilized in SRDRP. Supported
implementation results, we have a tendency to demonstrate potency improvement over the initial SRDRP
HARDWARE SECURITY IN CASE OF SCAN-BASED ATTACK ON CRYPTO-HARDWAREVLSICS Design
The latest innovation technology in computing devices has given a rise of compact, speedy and economical products which also embeds cryptography hardware on-chip. This device generally holds secret key and confidential information, more attention has been given to attacks on hardware which guards such secure information. The attacker may leak secret information from symmetric crypto-hardware (AES, DES etc.) using side-channel analysis, fault injection or exploiting existing test infrastructure. This paper examines various DFT based attack implementation method applied to cryptographic hardware. The paper contains an extensive analysis of attacks based on various parameters. The countermeasures are classified and analyzed in details.
Introduction: OSI Security Architecture, Security attacks, ,Security Services, Security
Mechanisms, Model for Network Security, Fundamentals of Abstract Algebra : Groups, Rings,
Fields, Modular Arithmetic, Euclidean Algorithm, Finite Fields of the form GF(p),Polynomial
Arithmetic, Finite Fields of the form GF(2n),Classical Encryption techniques, Block Ciphers and
Data Encryption Standard.
A Secure Data Communication System Using Cryptography and SteganographyIJCNCJournal
The information security has become one of the most significant problems in data communication. So it
becomes an inseparable part of data communication. In order to address this problem, cryptography and
steganography can be combined. This paper proposes a secure communication system. It employs
cryptographic algorithm together with steganography. The jointing of these techniques provides a robust
and strong communication system that able to withstand against attackers. In this paper, the filter bank
cipher is used to encrypt the secret text message, it provide high level of security, scalability and speed.
After that, a discrete wavelet transforms (DWT) based steganography is employed to hide the encrypted
message in the cover image by modifying the wavelet coefficients. The performance of the proposed system
is evaluated using peak signal to noise ratio (PSNR) and histogram analysis. The simulation results show
that, the proposed system provides high level of security.
Wireless Network Security Architecture with Blowfish Encryption ModelIOSR Journals
Abstract: In this research paper ,we developed a model for a large network, wireless nodes are interconnected and each can be considered as a node processor that offer services to other node processors connected to a specific network. A very high proportion of the nodes that offer services need to carry out an authentication process so as to make an access request to the node offering the service. In this context, an integrated reconfigurable network security architecture moved to the application layer has become the need of the day for secure wireless data sharing. The security schemes of the seven layer OSI architecture need to be placed intrinsically in the wireless node itself and should be capable of supporting the MAC layer, IP address based layer and the routing protocols of the network layer. This work focuses on the use of emulator and embedded hardware architectures for wireless network security. In this work, the individual nodes can have a unique security signature pattern maintained by respective wireless nodes using an encryption algorithm and this is made dynamic. The metrics includes latency, throughput, Scalability, Effects of data transfer operation on node processor and application data located in the processor Keywords:Wireless Network security, Embedded hardware, Reconfigurable architecture, blowfish algorithm
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.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Reference
“Secure and Efficient Data Transmission for Cluster-Based Wireless Sensor Networks” H. Lu; J. Li; M. Guizani
IEEE Transactions on Parallel and Distributed Systems
Permutation of Pixels within the Shares of Visual Cryptography using KBRP for...IDES Editor
The security of authentication of internet based
co-banking services should not be susceptible to high risks.
The passwords are highly vulnerable to virus attacks due to
the lack of high end embedding of security methods. In order
for the passwords to be more secure, people are generally
compelled to select jumbled up character based passwords
which are not only less memorable but are also equally prone
to insecurity. Multiple use of distributed shares has been
studied to solve the problem of authentication by algorithms
based on thresholding of pixels in image processing and visual
cryptography concepts where the subset of shares is considered
for the recovery of the original image for authentication using
correlation function[1][2].The main disadvantage in the above
study is the plain storage of shares and also one of the shares
is being supplied to the customer, which will lead to the
possibility of misuse by a third party. This paper proposes a
technique for scrambling of pixels by key based random
permutation (KBRP) within the shares before the
authentication has been attempted. Total number of shares to
be created is dependent on the multiplicity of ownership of
the account. By this method the problem of uncertainty among
the customers with regard to security, storage, retrieval of
holding of half of the shares is minimized.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Cluster Based Misbehaviour Detection and Authentication Using Threshold Crypt...CSCJournals
In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resulting in damage of other nodes. In order to establish secure communication with the group members of a network, use of a shared group key for confidentiality and authentication is required. Distributing the shares of secret group key to the group members securely is another challenging task in MANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authentication scheme using threshold cryptography in MANET. For secure data transmission, when any node requests a certificate from a cluster head (CH), it utilizes a threshold cryptographic technique to issue the certificate to the requested node for authentication. The certificate of a node is renewed or rejected by CH, based on its trust counter value. An acknowledgement scheme is also included to detect and isolate the misbehaving nodes. By simulation results, we show that the proposed approach reduces the overhead.
A Technique by using Neuro-Fuzzy Inference System for Intrusion Detection and...IJMER
—This paper proposes a technique uses decision tree for dataset and to find the basic
parameters for creating the membership functions of fuzzy inference system for Intrusion Detection and
Forensics. Approach of generating rules using clustering methods is limited to the problems of
clustering techniques. To trait to solve this problem, several solutions have been proposed using
various Techniques. One such Technique is proposed to be applied here, for an analysis to Intrusion
Detection and Forensics. . Fuzzy Inference approach and decision algorithms are investigated in this
work. Decision tree is used to identify the parameters to create the fuzzy inference system. Fuzzy
inference system used as an input and the final ANFIS structure is generated for intrusion detection
and forensics. The experiments and evaluations of the proposed method were done with NSL-KDD
intrusion detection dataset.
Automatic Synthesis and Formal Verification of Interfaces Between Incompatibl...IDES Editor
In this work, we are concerned with automatic
synthesis and formal verification of interfaces between
incompatible soft intellectual properties (IPs) for System On
Chip (SOC) design. IPs Structural and dynamic aspects are
modeled via UML2.x diagrams such as structural, timing and
Statecharts diagrams. From these diagrams, interfaces are
generated automatically between incompatible IPs following
an interface synthesis algorithm. Interfaces behaviors
verification is performed by the model checker that is
integrated in Maude language. A Maude specification
including interface specification and properties for verification
are generated automatically from UML diagrams.
A SURVEY ON WIRELESS SENSOR NETWORKS SECURITY WITH THE INTEGRATION OF CLUSTER...cscpconf
Keying technique in Wireless Sensor Networks(WSNs) is one of the most emerging fields ofWSN security. In order to provide security on WSN, the role of Key distribution technique is
considered to be very significant and thus the key management plays a crucial and fundamentalroles in the security service of WSNs. This paper reviews pairwise key establishment techniquealong with the architecture and the environment of WSN. The cluster based group key
agreement protocols for infrastructure base WSN are discussed in this paper. This paper also
reviews how the security can be provided to WSNs with the integration of clustering and keying
techniques. The survey also provides a more detailed discussion on the comparison between different cluster based group key agreement protocols.
A survey on wireless sensor networks security with the integration of cluster...csandit
Keying technique in Wireless Sensor Networks(WSNs) is one of the most emerging fields of
WSN security. In order to provide security on WSN, the role of Key distribution technique is
considered to be very significant and thus the key management plays a crucial and fundamental
roles in the security service of WSNs. This paper reviews pairwise key establishment technique
along with the architecture and the environment of WSN. The cluster based group key
agreement protocols for infrastructure base WSN are discussed in this paper. This paper also
reviews how the security can be provided to WSNs with the integration of clustering and keying
techniques. The survey also provides a more detailed discussion on the comparison between
different cluster based group key agreement protocols.
Hybrid Technique for Detection of Denial of Service (DOS) Attack in Wireless ...Eswar Publications
Wireless Sensor Network (WSNs) are deployed at aggressive environments which are vulnerable to various security attacks such as Wormholes, Denial of Attacks and Sybil Attacks. There are various intrusion detection techniques that are used to identify attacks in a network with high accuracy level. This paper has focused on Denial of Service attack, since it is the most common attack that affects the environment severely. Therefore a new hybrid technique combining Hidden Markov Model with Ant Colony Optimization (HMM+ACO) has been
proposed that gives improved performance than the other techniques.
Full Communication in a Wireless Sensor Network by Merging Blocks of a Key Pr...cscpconf
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
SECURITY V/S QOS FOR LTE AUTHENTICATION AND KEY AGREEMENT PROTOCOLIJNSA Journal
Protocol and technology convergence, the core of near future communication, will soon be forming the interoperating heterogeneous networks. Attaining a strict secure authentication without risking the QoS performance and call success rates is a major concern when it comes to wireless heterogeneous
networks. In order to achieve this, a generic, fast and secure, Authentication and Key Agreement protocol is to be used; a version of which is to be implemented between each two technologies. In this research, different existing EPS-EPS AKA protocols will be compared with our proposed protocol EC-AKA
(Ensure Confidentiality Authentication and Key Agreement) based on security, cost effectiveness, signaling overhead, delay and performance. It is proven that EC-AKA is the exclusive protocol satisfying the New Generation Network’s KPIs and it will be promoted as the target generic AKA protocol in
heterogeneous networks.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Reference
“Secure and Efficient Data Transmission for Cluster-Based Wireless Sensor Networks” H. Lu; J. Li; M. Guizani
IEEE Transactions on Parallel and Distributed Systems
Permutation of Pixels within the Shares of Visual Cryptography using KBRP for...IDES Editor
The security of authentication of internet based
co-banking services should not be susceptible to high risks.
The passwords are highly vulnerable to virus attacks due to
the lack of high end embedding of security methods. In order
for the passwords to be more secure, people are generally
compelled to select jumbled up character based passwords
which are not only less memorable but are also equally prone
to insecurity. Multiple use of distributed shares has been
studied to solve the problem of authentication by algorithms
based on thresholding of pixels in image processing and visual
cryptography concepts where the subset of shares is considered
for the recovery of the original image for authentication using
correlation function[1][2].The main disadvantage in the above
study is the plain storage of shares and also one of the shares
is being supplied to the customer, which will lead to the
possibility of misuse by a third party. This paper proposes a
technique for scrambling of pixels by key based random
permutation (KBRP) within the shares before the
authentication has been attempted. Total number of shares to
be created is dependent on the multiplicity of ownership of
the account. By this method the problem of uncertainty among
the customers with regard to security, storage, retrieval of
holding of half of the shares is minimized.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Cluster Based Misbehaviour Detection and Authentication Using Threshold Crypt...CSCJournals
In mobile ad hoc networks, the misbehaving nodes can cause dysfunction in the network resulting in damage of other nodes. In order to establish secure communication with the group members of a network, use of a shared group key for confidentiality and authentication is required. Distributing the shares of secret group key to the group members securely is another challenging task in MANET. In this paper, we propose a Cluster Based Misbehavior Detection and Authentication scheme using threshold cryptography in MANET. For secure data transmission, when any node requests a certificate from a cluster head (CH), it utilizes a threshold cryptographic technique to issue the certificate to the requested node for authentication. The certificate of a node is renewed or rejected by CH, based on its trust counter value. An acknowledgement scheme is also included to detect and isolate the misbehaving nodes. By simulation results, we show that the proposed approach reduces the overhead.
A Technique by using Neuro-Fuzzy Inference System for Intrusion Detection and...IJMER
—This paper proposes a technique uses decision tree for dataset and to find the basic
parameters for creating the membership functions of fuzzy inference system for Intrusion Detection and
Forensics. Approach of generating rules using clustering methods is limited to the problems of
clustering techniques. To trait to solve this problem, several solutions have been proposed using
various Techniques. One such Technique is proposed to be applied here, for an analysis to Intrusion
Detection and Forensics. . Fuzzy Inference approach and decision algorithms are investigated in this
work. Decision tree is used to identify the parameters to create the fuzzy inference system. Fuzzy
inference system used as an input and the final ANFIS structure is generated for intrusion detection
and forensics. The experiments and evaluations of the proposed method were done with NSL-KDD
intrusion detection dataset.
Automatic Synthesis and Formal Verification of Interfaces Between Incompatibl...IDES Editor
In this work, we are concerned with automatic
synthesis and formal verification of interfaces between
incompatible soft intellectual properties (IPs) for System On
Chip (SOC) design. IPs Structural and dynamic aspects are
modeled via UML2.x diagrams such as structural, timing and
Statecharts diagrams. From these diagrams, interfaces are
generated automatically between incompatible IPs following
an interface synthesis algorithm. Interfaces behaviors
verification is performed by the model checker that is
integrated in Maude language. A Maude specification
including interface specification and properties for verification
are generated automatically from UML diagrams.
A SURVEY ON WIRELESS SENSOR NETWORKS SECURITY WITH THE INTEGRATION OF CLUSTER...cscpconf
Keying technique in Wireless Sensor Networks(WSNs) is one of the most emerging fields ofWSN security. In order to provide security on WSN, the role of Key distribution technique is
considered to be very significant and thus the key management plays a crucial and fundamentalroles in the security service of WSNs. This paper reviews pairwise key establishment techniquealong with the architecture and the environment of WSN. The cluster based group key
agreement protocols for infrastructure base WSN are discussed in this paper. This paper also
reviews how the security can be provided to WSNs with the integration of clustering and keying
techniques. The survey also provides a more detailed discussion on the comparison between different cluster based group key agreement protocols.
A survey on wireless sensor networks security with the integration of cluster...csandit
Keying technique in Wireless Sensor Networks(WSNs) is one of the most emerging fields of
WSN security. In order to provide security on WSN, the role of Key distribution technique is
considered to be very significant and thus the key management plays a crucial and fundamental
roles in the security service of WSNs. This paper reviews pairwise key establishment technique
along with the architecture and the environment of WSN. The cluster based group key
agreement protocols for infrastructure base WSN are discussed in this paper. This paper also
reviews how the security can be provided to WSNs with the integration of clustering and keying
techniques. The survey also provides a more detailed discussion on the comparison between
different cluster based group key agreement protocols.
Hybrid Technique for Detection of Denial of Service (DOS) Attack in Wireless ...Eswar Publications
Wireless Sensor Network (WSNs) are deployed at aggressive environments which are vulnerable to various security attacks such as Wormholes, Denial of Attacks and Sybil Attacks. There are various intrusion detection techniques that are used to identify attacks in a network with high accuracy level. This paper has focused on Denial of Service attack, since it is the most common attack that affects the environment severely. Therefore a new hybrid technique combining Hidden Markov Model with Ant Colony Optimization (HMM+ACO) has been
proposed that gives improved performance than the other techniques.
Full Communication in a Wireless Sensor Network by Merging Blocks of a Key Pr...cscpconf
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
SECURITY V/S QOS FOR LTE AUTHENTICATION AND KEY AGREEMENT PROTOCOLIJNSA Journal
Protocol and technology convergence, the core of near future communication, will soon be forming the interoperating heterogeneous networks. Attaining a strict secure authentication without risking the QoS performance and call success rates is a major concern when it comes to wireless heterogeneous
networks. In order to achieve this, a generic, fast and secure, Authentication and Key Agreement protocol is to be used; a version of which is to be implemented between each two technologies. In this research, different existing EPS-EPS AKA protocols will be compared with our proposed protocol EC-AKA
(Ensure Confidentiality Authentication and Key Agreement) based on security, cost effectiveness, signaling overhead, delay and performance. It is proven that EC-AKA is the exclusive protocol satisfying the New Generation Network’s KPIs and it will be promoted as the target generic AKA protocol in
heterogeneous networks.
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.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A Key Management Approach For Wireless Sensor NetworksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
A Key Management Approach For Wireless Sensor NetworksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
Review and Performance Comparison of Distributed Wireless Reprogramming Proto...IOSR Journals
Abstract:A Reprogramming service should be efficient, reliable and secured in Wireless sensor network.
Wireless reprogramming for wireless sensor network emphasize over the process of changing or improving the
functionality of simulation or existing code. For challenging and on demand security purpose, secure and
distributed routing protocols such as SDRP and ISDRP were developed. This paper reviews and compares the
propagation delay for two reprogramming protocols, SDRP and ISDRP, which based on hierarchy of energies
in network. Both are based on identity-based cryptography. But in the improved protocol the keys are
distributed to the network as per the sorting and communication capabilities to improve the broadcast or
communication nature of the network. Moreover, ISDRP demonstrates the security concepts, which deals over
the key encryption properties using heap sort algorithm and the confidentiality parameter is enhanced by
changing the private key values after certain interval of time for cluster head in respect to different public keys.
The ISDRP shows high efficiency rate clearly with the throughput and propagation results by implementation in
practice over SRDP.
Keywords: identity-based cryptography,ISDRP, heapsort algorithm, Reprogramming, SDRP, Wireless sensor
network.
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.
A key management approach for wireless sensor networksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
Pairing Based Elliptic Curve Cryptosystem for Message AuthenticationIJTET Journal
Abstract— Elliptical curve cryptography (ECC) is a public key encryption technique based on elliptic curve theory that can be used to create faster, smaller, and more efficient cryptographic keys. ECC generates keys through the properties of the elliptic curve equation instead of the traditional method of generation as the product of very large prime numbers. Because ECC helps to establish equivalent security with lower computing power and battery resource usage, it is becoming widely used for mobile applications. Recently the bilinear pairing such as Weil Pairing or Tate Pairing on elliptic curves and hyper elliptic curves has been found various applications in cryptography. Several identity-based cryptosystems using bilinear pairings of elliptic curves or hyper elliptic curves were presented. Blind signature and ring signature are very useful to provide the user’s anonymity and the signer’s privacy. The proposed method focuses an ID-based ring signature scheme which is based on the pairings with elliptic curve cryptography. The proposed method is used to reduce the number of computation of the pairing for the verification of the id based signature and also decoding of the id based public key cryptosystems with authentication by factor of 2.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
Advanced Data Protection and Key Organization Framework for Mobile Ad-Hoc Net...AM Publications,India
Key organization and protect routing are two major subjects for Mobile Ad-hoc Networks nonetheless preceding explanations tend to contemplate them distinctly. This indicates to Key organization and protects routing inters dependency cycle problem. In this paper, we recommend a Key organization and protection of routing integrated scheme that speeches Key organization and protection of routing inter dependency cycle problem. By using identity based cryptography this scheme delivers produced including confidentiality, honesty, verification, cleanness, and non-repudiation. Connected to symmetric cryptography and conventional asymmetric cryptography as well as preceding IBC arrangements, this arrangement has developments in many features. We deliver hypothetical resistant of the refuge of the scheme and validate the efficiency of the scheme with applied simulation.
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
Similar to Secure Checkpointing Approach for Mobile Environment (20)
Now-a-days, Internet has become an important part of human’s life, a person
can shop, invest, and perform all the banking task online. Almost, all the organizations have
their own website, where customer can perform all the task like shopping, they only have to
provide their credit card details. Online banking and e-commerce organizations have been
experiencing the increase in credit card transaction and other modes of on-line transaction.
Due to this credit card fraud becomes a very popular issue for credit card industry, it causes
many financial losses for customer and also for the organization. Many techniques like
Decision Tree, Neural Networks, Genetic Algorithm based on modern techniques like
Artificial Intelligence, Machine Learning, and Fuzzy Logic have been already developed for
credit card fraud detection. In this paper, an evolutionary Simulated Annealing algorithm is
used to train the Neural Networks for Credit Card fraud detection in real-time scenario.
This paper shows how this technique can be used for credit card fraud detection and
present all the detailed experimental results found when using this technique on real world
financial data (data are taken from UCI repository) to show the effectiveness of this
technique. The algorithm used in this paper are likely beneficial for the organizations and
for individual users in terms of cost and time efficiency. Still there are many cases which are
misclassified i.e. A genuine customer is classified as fraud customer or vise-versa.
Wireless sensor networks (WSN) have been widely used in various applications.
In these networks nodes collect data from the attached sensors and send their data to a base
station. However, nodes in WSN have limited power supply in form of battery so the nodes
are expected to minimize energy consumption in order to maximize the lifetime of WSN. A
number of techniques have been proposed in the literature to reduce the energy
consumption significantly. In this paper, we propose a new clustering based technique
which is a modification of the popular LEACH algorithm. In this technique, first cluster
heads are elected using the improved LEACH algorithm as usual, and then a cluster of
nodes is formed based on the distance between node and cluster head. Finally, data from
node is transferred to cluster head. Cluster heads forward data, after applying aggregation,
to the cluster head that is closer to it than sink in forward direction or directly to the sink.
This reduction in distance travelled improves the performance over LEACH algorithm
significantly.
The next generation wireless networks comprises of mobile users moving
between heterogeneous networks, using terminals with multiple access interfaces and
services. The most important issue in such environment is ABC (Always Best Connected) i.e.
allowing the best connectivity to applications anywhere at any time. For always best
connectivity requirement various vertical handover strategies for decision making have
been proposed. This paper provides an overview of the most interesting and recent
strategies.
This paper presents the design and performance comparison of a two stage
operational amplifier topology using CMOS and BiCMOS technology. This conventional op
amp circuit was designed by using RF model of BSIM3V3 in 0.6 μm CMOS technology and
0.35 μm BiCMOS technology. Both the op amp circuits were designed and simulated,
analyzed and performance parameters are compared. The performance parameters such as
gain, phase margin, CMRR, PSRR, power consumption etc achieved are compared. Finally,
we conclude the suitability of CMOS technology over BiCMOS technology for low power
RF design.
In Cognitive Radio Networks (CRN), Cooperative Spectrum Sensing (CSS) is
used to improve performance of spectrum sensing techniques used for detection of licensed
(Primary) user’s signal. In CSS, the spectrum sensing information from multiple unlicensed
(Secondary) users are combined to take final decision about presence of primary signal. The
mixing techniques used to generate final decision about presence of PU’s signal are also
called as Fusion techniques / rules. The fusion techniques are further classified as data
fusion and decision fusion techniques. In data fusion technique all the secondary users
(SUs) share their raw information of spectrum detection like detected energy or other
statistical information, while in decision fusion technique all the SUs take their local
decisions and share the decision by sending ‘0’ or ‘1’ corresponding to absence and presence
of PU’s signal respectively. The rules used in decision fusion techniques are OR rule, AND
rule and K-out-of-N rule. The CSS is further classified as distributed CSS and centralized
CSS. In distributed CSS all the SUs share the spectrum detection information with each
other and by mixing the shared information; all the SUs take final decision individually. In
centralized CSS all the SUs send their detected information to a secondary base station /
central unit which combines the shared information and takes final decision. The secondary
base station shares the final decision with all the SUs in the CRN. This paper covers
overview of information fusion methods used for CSS and analysis of decision fusion rules
with simulation results.
ZigBee has been developed to support lower data rates and low power consuming
applications. This paper targets to analyze various parameters of ZigBee physical (PHY).
Performance of ZigBee PHY is evaluated on the basis of energy consumption in
transmitting and receiving mode and throughput. Effect of variation in network size is
studied on these performance attributes. Some modulation schemes are also compared and
the best modulation scheme is suggested with tradeoffs between different performance
metrics.
This paper gives a brief idea of the moving objects tracking and its application.
In sport it is challenging to track and detect motion of players in video frames. Task
represents optical flow analysis to do motion detection and particle filter to track players
and taking consideration of regions with movement of players in sports video. Optical flow
vector calculation gives motion of players in video frame. This paper presents improved
Luacs Kanade algorithm explained for optical flow computation for large displacement and
more accuracy in motion estimation.
A rapid progress is seen in the field of robotics both in educational and industrial
automation sectors. The Robotics education in particular is gaining technological advances
and providing more learning opportunities. In automotive sector, there is a necessity and
demand to automate daily human activities by robot. With such an advancement and
demand for robotics, the realization of a popular computer game will help students to learn
and acquire skills in the field of robotics. The computer game such as Pacman offers
challenges on both software and hardware fronts. In software, it provides challenges in
developing algorithms for a robot to escape from the pool of attacking robots and to develop
algorithms for multiple ghost robots to attack the Pacman. On the hardware front, it
provides a challenge to integrate various systems to realize the game. This project aims to
demonstrate the pacman game in real world as well as in simulation. For simulation
purpose Player/Stage is used to develop single-client and multi-client architectures. The
multi- client architecture in player/stage uses one global simulation proxy to which all the
robot models are connected. This reduces the overhead to manage multiple robots proxy.
The single-client architecture enables only two robot models to connect to the simulation
proxy. Multi-client approach offers flexibility to add sensors to each port which will be used
distinctly by the client attached to the respective robot. The robots are named as Pacman
and Ghosts, which try to escape and attack respectively. Use of Network Camera has been
done to detect the global positions of the robots and data is shared through inter-process
communication.
In Content-Based Image Retrieval (CBIR) systems, the visual contents of the
images in the database are took out and represented by multi-dimensional characteristic
vectors. A well known CBIR system that retrieves images by unsupervised method known
as cluster based image retrieval system. For enhancing the performance and retrieval rate
of CBIR system, we fuse the visual contents of an image. Recently, we developed two
cluster-based CBIR systems by fusing the scores of two visual contents of an image. In this
paper, we analyzed the performance of the two recommended CBIR systems at different
levels of precision using images of varying sizes and resolutions. We also compared the
performance of the recommended systems with that of the other two existing CBIR systems
namely UFM and CLUE. Experimentally, we find that the recommended systems
outperform the other two existing systems and one recommended system also comparatively
performed better in every resolution of image.
Information Systems and Networks are subjected to electronic attacks. When
network attacks hit, organizations are thrown into crisis mode. From the IT department to
call centers, to the board room and beyond, all are fraught with danger until the situation is
under control. Traditional methods which are used to overcome these threats (e.g. firewall,
antivirus software, password protection etc.) do not provide complete security to the system.
This encourages the researchers to develop an Intrusion Detection System which is capable
of detecting and responding to such events. This review paper presents a comprehensive
study of Genetic Algorithm (GA) based Intrusion Detection System (IDS). It provides a
brief overview of rule-based IDS, elaborates the implementation issues of Genetic Algorithm
and also presents a comparative analysis of existing studies.
Step by step operations by which we make a group of objects in which attributes
of all the objects are nearly similar, known as clustering. So, a cluster is a collection of
objects that acquire nearly same attribute values. The property of an object in a cluster is
similar to other objects in same cluster but different with objects of other clusters.
Clustering is used in wide range of applications like pattern recognition, image processing,
data analysis, machine learning etc. Nowadays, more attention has been put on categorical
data rather than numerical data. Where, the range of numerical attributes organizes in a
class like small, medium, high, and so on. There is wide range of algorithm that used to
make clusters of given categorical data. Our approach is to enhance the working on well-
known clustering algorithm k-modes to improve accuracy of algorithm. We proposed a new
approach named “High Accuracy Clustering Algorithm for Categorical datasets”.
Brain tumor is a malformed growth of cells within brain which may be
cancerous or non-cancerous. The term ‘malformed’ indicates the existence of tumor. The
tumor may be benign or malignant and it needs medical support for further classification.
Brain tumor must be detected, diagnosed and evaluated in earliest stage. The medical
problems become grave if tumor is detected at the later stage. Out of various technologies
available for diagnosis of brain tumor, MRI is the preferred technology which enables the
diagnosis and evaluation of brain tumor. The current work presents various clustering
techniques that are employed to detect brain tumor. The classification involves classification
of images into normal and malformed (if detected the tumor). The algorithm deals with
steps such as preprocessing, segmentation, feature extraction and classification of MR brain
images. Finally, the confirmatory step is specifying the tumor area by technique called
region of interest.
A Proxy signature scheme enables a proxy signer to sign a message on behalf of
the original signer. In this paper, we propose ECDLP based solution for chen et. al [1]
scheme. We describe efficient and secure Proxy multi signature scheme that satisfy all the
proxy requirements and require only elliptic curve multiplication and elliptic curve addition
which needs less computation overhead compared to modular exponentiations also our
scheme is withstand against original signer forgery and public key substitution attack.
Water marking has been proposed as a method to enhance data security. Text
water marking requires extreme care when embedding additional data within the images
because the additional information must not affect the image quality. Digital water marking
is a method through which we can authenticate images, videos and even texts. Add text
water mark and image water mark to your photos or animated image, protect your
copyright avoid unauthorized use. Water marking functions are not only authentication, but
also protection for such documents against malicious intentions to change such documents
or even claim the rights of such documents. Water marking scheme that hides water
marking in method, not affect the image quality. In this paper method of hiding a data using
LSB replacement technique is proposed.
Today among various medium of data transmission or storage our sensitive data
are not secured with a third-party, that we used to take help of. Cryptography plays an
important role in securing our data from malicious attack. This paper present a partial
image encryption based on bit-planes permutation using Peter De Jong chaotic map for
secure image transmission and storage. The proposed partial image encryption is a raw data
encryption method where bits of some bit-planes are shuffled among other bit-planes based
on chaotic maps proposed by Peter De Jong. By using the chaotic behavior of the Peter De
Jong map the position of all the bit-planes are permuted. The result of the several
experimental, correlation analysis and sensitivity test shows that the proposed image
encryption scheme provides an efficient and secure way for real-time image encryption and
decryption.
This paper presents a survey of Dependency Analysis of Service Oriented
Architecture (SOA) based systems. SOA presents newer aspects of dependency analysis due
to its different architectural style and programming paradigm. This paper surveys the
previous work taken on dependency analysis of service oriented systems. This study shows
the strengths and weaknesses of current approaches and tools available for dependency
analysis task in context of SOA. The main motivation of this work is to summarize the
recent approaches in this field of research, identify major issue and challenges in
dependency analysis of SOA based systems and motivate further research on this topic.
In this paper, proposed a novel implementation of a Soft-Core system using
micro-blaze processor with virtex-5 FPGA. Till now Hard-Core processors are used in
FPGA processor cores. Hard cores are a fixed gate-level IP functions within the FPGA
fabrics. Now the proposed processor is Soft-Core Processor, this is a microprocessor fully
described in software, usually in an HDL. This can be implemented by using EDK tool. In
this paper, developed a system which is having a micro-blaze processor is the combination
of both hardware & Software. By using this system, user can control and communicate all
the peripherals which are in the supported board by using Xilinx platform to develop an
embedded system. Implementing of Soft-Core process system with different peripherals like
UART interface, SPA flash interface, SRAM interface has to be designed using Xilinx
Embedded Development Kit (EDK) tools.
The article presents a simple algorithm to construct minimum spanning tree and
to find shortest path between pair of vertices in a graph. Our illustration includes the proof
of termination. The complexity analysis and simulation results have also been included.
Wimax technology has reshaped the framework of broadband wireless internet
service. It provides the internet service to unconnected or detached areas such as east South
Africa, rural areas of America and Asia region. Full duplex helpers employed with one of
the relay stations selection and indexing method that is Randomized Distributed Space Time
are used to expand the coverage area of primary Wimax station. The basic problem was
identified at cell edge due to weather conditions (rain, fog), insertion of destruction because
of multiple paths in the same communication channel and due to interference created by
other users in that communication. It is impractical task for the receiver station to decode
the transmitted signal successfully at the cell edges, which increases the high packet loss and
retransmissions. But Wimax is a outstanding technology which is used for improving the
quality of internet service and also it offers various services like Voice over Internet
Protocol, Video conferencing and Multimedia broadcast etc where a little delay in packet
transmission can cause a big loss in the communication. Even setup and initialization of
another Wimax station nearer to each other is not a good alternate, where any mobile
station can easily handover to another base station if it gets a strong signal from other one.
But in rural areas, for few numbers of customers, installation of base station nearer to each
other is costlier task. In this review article, we present a scheme using R-DSTC technique to
choose and select helpers (relay nodes) randomly to expand the coverage area and help to
mobile station as a helper to provide secure communication with base station. In this work,
we use full duplex helpers for better utilization of bandwidth.
Radio Frequency identification (RFID) technology has become emerging
technique for tracking and items identification. Depend upon the function; various RFID
technologies could be used. Drawback of passive RFID technology, associated to the range
of reading tags and assurance in difficult environmental condition, puts boundaries on
performance in the real life situation [1]. To improve the range of reading tags and
assurance, we consider implementing active backscattering tag technology. For making
mobiles of multiple radio standards in 4G network; the Software Defined Radio (SDR)
technology is used. Restrictions in Existing RFID technologies and SDR technology, can be
eliminated by the development and implementation of the Software Defined Radio (SDR)
active backscattering tag compatible with the EPC global UHF Class 1 Generation 2 (Gen2)
RFID standard. Such technology can be used for many of applications and services.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
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. information. After getting the information the initiator calculate the recovery line and broadcast a rollback
request message along with recovery line. After receiving it the process whose current state belongs to the
recovery line simply resumes execution or roll it back to earlier checkpoint as indicated at recovery line.
Some important standards for data communications and its security associations are introduced in [3]. The
network provider identifies the user. The network provider checks if the user knows the IMSI and the user
key Ki. Many times the user sends the TIMSI (temporary IMSI) to the base station, to hide the identity of the
MS. Though data is transferred through the air, there is a high chance to attack the data using radio receiver
by the attacker. So encryption of data is needed to make it secure during communication. Confidentiality,
integrity, authentication and non-repudiation of transmitted data define the communication security in [5].
The authentication protocols are discussed in [6]. Vulnerability can be defined as a flaw or weakness in
system security procedures, design, implementation, or internal controls as [4]. In [4] Bharat Bhargava et. al.
discussed 4 mechanisms to reduce the vulnerabilities and threats of a system. To recover from security
attacks at the time of communication we have concentrate on some cryptography[12] mechanisms. One of
the Public key cryptosystem ECC is a low overhead cryptography technique.
According to the works presented in [8], [9], [10] it is proved that ECC has better performance than other
public key cryptography. In [8] software implementations of DSA and RSA digital signature scheme is
compared with ECDSA. Experiments were performed on both PC’s and mobile devices. A signature
operation includes key generation, sign of document, and verification of signature. This is concluded from [8]
by Wendy Chou that verification process of RSA is faster than ECDSA, but signature operation of ECDSA is
faster than RSA and DSA. For DSA verification process itself is much longer than the total process time of
ECDSA. ECDSA performs well for mobile environment than other public key cryptography.
Our main attention is on secure checkpointing. Two models of secure checkpointing are discussed, one is
distributed checkpointing [2] and another model is probabilistic checkpointing [7]. In [7] the described model
is a combination of key agreement model and the secure probabilistic checkpointing scheme. There are two
types of nodes, checkpoint nodes and recovery nodes. Number of recovery node is small and used for
recovery when checkpoint nodes fail. Here DES algorithm is used for authentication and cryptography.
III. PROBLEM
IDENTIFICATION
Studying related papers discussed so far existing secure checkpointing algorithm [7] implements secret key
cryptography. Secret key cryptography ensures authentication and data confidentiality. Security threats to
data integrity and non repudiation are a big concern. We address all these issues in our work. As a solution
we combine Elliptic curve cryptography with checkpointing. We chose ECC because it is a low overhead
public key cryptography algorithm which is suitable for resource constrained mobile computing system.
A. Design Issues
Design of low overhead secure fault tolerant mobile computing system includes following design issues:
To reduce computation and storage overhead of mobile nodes: calculations related to cryptography
are shifted to base stations, recovery information, checkpoints logs are saved in base stations
To secure communication: always encrypted data is transferred through wired and wireless links
To ensure trusted computing: trust = fault tolerance (checkpointing) + secure(cryptography)
Mobile nodes save checkpoint and transfers to current base stations.
IV. THE
PROPOSED SECURE CHECKPOINTING ALGORITHM
A. System Model And Assumptions
In system model (Fig. 1) there are large number of mobile nodes and few base stations. The mobile nodes
communicate through a wireless network. There is no concept of shared memory. The mobile nodes
communicate with others through message passing. The mobile nodes communicate, send and receive
message through the base stations. The base stations are more secure than the mobile nodes .A mobile node is
indicated by a process running on it.
The assumptions of the system model are:
Failures can be link failure, node failure etc. Here failure is mainly node failure until stated
otherwise.
Mobile nodes connected to same base station are local to each other and mobile nodes connected to
different base stations are remote to each other.
12
3. Fault tolerance is considered here at operating system level only.
B. Data Structure And Notation
Sn: sender; Rc: receiver; pb: public key; pr: private key; pbsn: public key of sender; prsn: private key of
sender; pbrc: public key of receiver; prrc: private key of receiver; pr1, pr2, pr3,…,pri: i number of processes;
BSq: qth base station; MNoq: oth mobile node of qth base station; BS[u]: array of u number of element
maintained by base station,(BS[1]=keep the base station number; BS [2, 3, 4, 5,…,u]=keep the track of
mobile nodes attached with it); MNpri[v]: array of v number of elements maintained by each mobile
node,(MNpri[1]=keep its own base station number; MNpri[2, 3,…,v]: hold its base station number it
traversed already); IDMNoq: identification number of oth mobile node of qth base station; PWDMNoq:
password of oth mobile node of qth base station; RP(pri): set of restart points; T= (p, a, b, G, n, h) or (m, f(x),
a, b, G, n, h): Domain parameter of ECC over prime field or binary field;
Figure 1. System Model
p: specifying the number of element of finite field; m: defined the finite field over (2m); f(x): irreducible
polynomial; a and b: two elements specifying elliptic curve; G: generator point [(xg, yg) a point on the
elliptic curve for cryptographic operation]; n: order of elliptic curve; h: cofactor [ h= #E(p)/n; #E(p) =
number of points on elliptic curve]; F(p): the finite field; Fp: prime field; F2m: binary field; P: point of
elliptic curve; O: point of elliptic curve which is in infinity; Msg: message (contain: sender, MNpri[v],
receiver, MNpri[v], message body); Cpt: chipertext; E_msg: encrypted form of Msg; MAC: chosen MAC
scheme [SHA-1-160 or SHA-1-180]; En_schm: symmetric encryption scheme such as AES or DEC;
Mc_schm: message authentication code algorithm such as HMAC; Dn_schm: symmetric decryption scheme;
enky: encryption key; dcky: decryption key; mcky: MAC key; tg: tag; Hash: chosen hash function SHA1;CP: checkpoint; TCPprijk: jth temporary checkpoint of process pri of base station k; PCPprijk: jth
permanent checkpoint of process pri of base station k; CPprijk-1-CPprijk: checkpoint interval; Ip_I_Tprik:
Input information table of process pri of base station k; tlpri: local clock; Thrl: threshold value of local clock;
Thrc: a constant threshold value of each process; snd_sq_noprik: send sequence number; rcv_sq_noprik:
receive sequence number; Mlog_T: table to maintain the send sequence number along with receive sequence
number.
C. Secure Checkpointing Algorithm
Secure_checkpointing_algorithm ()
Step1: the processes are authenticated using Authenticate().
Step2: after authentication the processes start communication by sending messages and logging messages in
its volatile
memory and maintain snd_sq_noprik.
Step3: check
If MNpri[1] of sender is equal to MNpri[1] of receiver
Then the process encrypt the message using Encrypt_msg() and send;
Else the process will generate signature for that message using Signature_gn() and send;
Step 4: when a process receive a message it return an acknowledgement along with rcv_sq_noprik.
Step5: if MNpri[1] of receiver is equal to MNpri[1] of sender
Then the process decrypts the message using Decrypt_msg() and save it to local stable storage;
13
4. Else the base station will verify the signature of the message Verify_sig() and then send the
encrypted message to the process and the process decrypt the message using Decrypt_msg() and
save it in stable storage;
Step6: the processes will take checkpoint using Checkpoint ().
Authenticate ()
Note: the message digests form of passwords will be saved in the base station’s database.
Step1: before starting communication the MNoq will send it IDMNo q and PWDMNoq to the attached base station
BSq.
Step2: the BSq will check its own database to find the PWDMNoq which is sent by MNoq.
If PWDMNoq is present in its own database
Then BSq will send an authentication successful message to MNoq;
Else the BSq will broadcast that PWDMNoq to other base stations;
step3: if PWDMNoq is present in database of other base stations
Then they will send a positive message to the sender base station and BSq will send an
authentication successful message to MNoq;
Else they will send a negative message to the sender base station and BSq will send an
authentication unsuccessful message to MNoq;
Encrypt_msg ()
INPUT: Domain parameters T= (p, a, b, G, n, h), public key pbsn, plaintext Msg.
OUTPUT: Encrypted message E_msg.
Step1: Select prsn from [1, n-1].
Step2: Compute pbsn=prsn.G and Z= h.prsn.pbsn. If Z=
Step3: (enky, mcky)
coordinate of Z.
Z , pbsn), where xZ is the xStep4: Compute Cpt = En_schmenky(Msg) and tg = Mc_schmmcky(Cpt).
Step5: Return E_msg = (pbsn, Cpt, tg).
Decrypt_msg ()
INPUT: Domain parameters T= (p, a, b, G, n, h), private key prrc, Encrypted message E_msg.
OUTPUT: Plaintext Msg or rejection of the ciphertext.
Step1: Perform an embedded public key validation of pbsn. If the validation fails then return (“Reject the
ciphertext”).
Step2: Compute Z= h.prrc.pbsn. If Z =
the ciphertext”).
Step3: (enky, mcky)
coordinate of Z.
Z , pbsn), where xZ is the xStep4: Compute tg `= MACmcky(Cpt). If tg`
return (“Reject the ciphertext”).
Step5: Compute Msg = Dn_schm(Cpt).
Step6: Return (Msg).
Signature_gn ()
INPUT: domain parameters T=(p, a, b, G, n, h), public key pb and private key pr, the message Msg .
OUTPUT: the signature along with the message.
– 1]
Step2. Computes Point kG = (x, y) and r = x mod n, if r = 0 then go to 1.
Step3: Compute t = k–1 mod n.
Step4: Compute e = SHA-1(m), where SHA-1 denotes the
160 bit hash function.
Step5: Compute s = k– 1 (e + prsn *r) mod n, if s = 0 goto Step 1.
Step6: The signature of message Msg is the pair (r, s).
Step7: Sends (Msg, r, s).
Verify _sig()
INPUT: (receiver knows the domain parameters T and sender’s public key pb ).
OUTPUT: accept message if valid signature.
Step1: Verify r and s are integers in the range [1, n – 1].
Step2: Compute e = SHA-1(Msg).
Step3: Compute w = s–1 mod n.
Step4: Compute u1 = e.w and u2 = r.w .
Step5: Compute Point X = (x1, y1) = u1G + u2pb.
Step6: If X = O, then reject the signature Else compute v =
x1 mod n.
14
5. Step7: Accept signature iff v = r.
Checkpoint()
{
For each process pr1, pr2, pr3… pri
{
Initiate local clock t lpri;
Execute normal execution;
If (tlpri = = Thrl)
{
Take checkpoint TCPprijk;
Maintain Ip_I_Tprik;
}
}
Choose initiator from base stations let say pr1
For each TCPpr1 jk = Thrc
{
Broadcast TCPpr1jk as tentative checkpoint to all other processes;
If all other processes send reply
{
Then pr1 broadcast commit message and take TCPpr1jk as PCPpr1jk;
Refresh Ip_I_Tprik;
Discard all previous temporary checkpoints;
}
Else continue normal execution;
}
}
D. Recovery Algorithm
If a process fails, recovery is needed to resume computation from last saved state. If process pri fails before
taking TCPprijk, it restore the checkpoint TCPpri(j-1)k and include it to RP(pri) maintained by its respective base
station BSq. Base station sends the failure message to the communicating processes through their base
stations. Those processes stop execution and send their Ip_I_Tprik to their respective base stations. These base
stations send all these tables to BSq of failed process. BSq draws a dependency graph using the information
of Ip_I_Tprik and calculate the restart point and include it in RP(pri). BSq of failed process send the rollback
message to the communicating processes along with RP(pri). These processes will rollback and resume
execution.
E. Working Example
In the Fig. 2 there are four processes. Each process sends messages, logs messages, takes tentative
checkpoints and makes tentative checkpoints permanent.
Every process pr1, pr2, pr3, pr4 first send their identification number and password to their corresponding base
stations. After successful authentication they start their execution. The local clocks t lpri also start for each
process. Process pr1 generate snd_sq_noprik and logged message Msg1 to its volatile log. Msg1 consist (pr1,
MNpr1[v], pr3, MNpr3[v], message body). Then sender pr 1 check if MNpr1[1]= MNpr3[1], if they are equal then
encrypt the message and send the message to pr3.
If they are not equal then pr1 generate the signature and encrypt the message and send the encrypted message
along with signature to pr3. After receiving Msg1 process pr3 send rcv_sq_noprik to pr1. Then receiver pr 3
check if MNpr3[1] = MNpr1[1], if they are equal receiver decrypt the message and save into its stable storage.
If they are not equal then the respective base station of pr3 verifies the signature and sends the encrypted
message to pr3. Then pr3 decrypts the message and saves into its stable storage. In this way all the messages
send and received. After receiving message input information table is updated by the receiver. The columns
of the table are the processes and the rows contain the checkpoints of that process. For example the Ip_I_Tprik
is given above for processes pr1. In the meantime when the local clock value of each process meets the
15
6. Figure 2. Checkpointing Process
Figure 3. Calculation of restart point
threshold value of local clock take tentative checkpoint TCPprijk. Process pr1 take the temporary checkpoint
TCPpr111 which means that it is a 1st temporary checkpoint of process 1 of base station 1. After taking
TCPpr121 process pr1 send a request to all other processes to take that tentative checkpoint as permanent
checkpoint. When all other processes send reply message to pr1 then TCPpr121 becomes PCPpr121 and TCPpr221
becomes PCPpr221 and so on and refresh the input information table and discard the previous temporary
checkpoints. If pr1 did not get the reply message from all other processes the temporary checkpoint is not
changed into permanent checkpoint.
Calculation of restart point is shown in Fig. 3. The process pr 1 fails after TCPpr114 and sends the failure
message to its base station BS1. After receiving the failure message from pr1, BS1 calculates a dependency
graph based on Input Information Table of pr1 (Table I) .After getting the information it will rollback the
message to process previous temporary checkpoint. In the Fig. 3 process pr1 fails after TCPpr114 so all the
information available till that point. The message will be rolled back to this checkpoint and it will be treated
as rollback point. Similarly for pr3 lost Msg8 because of pr1 failure so it will also treat TCPpr334 as rollback
point. Hence, both TCPpr114 and TCPpr334 together treated as restart point.
We have shown here a single failure. Our system is can recover from multiple failures which are described
following.
16
7. TABLE I. EXAMPLE OF INPUT INFORMATION TABLE OF PR1
Pr 1
Processes
Pr2
Pr3
Pr4
CPpr101
CPpr111
CPpr121
CPpr131
CPpr141
CPpr231
Figure 4. Checkpointing Process
Figure 5. Calculation of restart point (multiple failure)
In Fig. 4 there are four processes, each process sends messages, logs messages, takes tentative checkpoints
and makes tentative checkpoint permanent as described earlier. In Fig. 5 we describe multiple failures,
process pr1 and pr3 fail and it is denoted as F1 and F2. The process pr1 fails after TCPpr114 and pr3 fails after
TCPpr334. Both of them send failure message to their respective Base station. After getting the information
Base station will calculate the dependency graph based on Input Information table. The Input Information
table of different process is shown following. Table II, Table III, Table IV, and Table V is describing input
information for process pr1, pr2, pr3, pr4 respectively. In Fig. 5 it shows that process pr1 fails after TCPpr114 so
all the information is still available to this temporary checkpoint. The process will be rolled back to this point
and this will be treated as rollback point for this process. Similarly for process pr 3 TCPpr334 temporary
checkpoint will be treated as rollback point. In the Fig. 5 it shows that process pr4 sends a message Msg5 to
pr3 but it lost due to pr 3 failure so pr4 also lost the message after TCPpr444. Hence pr4 will rollback to TCPpr444
and this temporary checkpoint will be treated as rollback point for this process. This three temporary
checkpoint TCPpr114, TCPpr334 and TCPpr444 together called as restart point for this multiple failure.
TABLE II. EXAMPLE OF INPUT INFORMATION TABLE
OF pr1
TABLE III. EXAMPLE OF INPUT INFORMATION TABLE OF pr2
Processes
Processes
Pr1
Pr2
Pr3
Pr1
Pr4
Pr2
Pr3
Pr4
CPpr202
CPpr101
CPpr111
CPpr111
CPpr212
CPpr2
31
CPpr1
CPpr131
CPpr141
17
22
CPpr2
CPpr121
32
CPpr242
13
CPpr3
8. T ABLE IV. E XAMPLE OF INPUT INFORMATION TABLE OF PR3
TABLE V.
OF PR4
Processes
Pr1
Pr2
EXAMPLE OF INPUT INFORMATION TABLE
Processes
Pr3
Pr4
Pr1
Pr2
CPpr303
Pr3
Pr4
CPpr404
CPpr313
CPpr414
CPpr323
CPpr222
CPpr424
CPpr333
CPpr434
43
CPpr3
CPpr232
CPpr444
V. CONCLUSIONS
In recent day use of mobile devices are increasing in applications such as e-commerce, banking, stock trading
etc. So to provide the proper functionality and provide the security is an alarming issue. To make a system
fault tolerant checkpointing is used. Here we are concentrating on the secure checkpointing methods. We are
proposing a secure checkpointing algorithm which mainly concentrates on the communication security. Our
algorithm used more consistent checkpointing processes and low overhead public key cryptosystem. We are
not comparing our algorithm with any existing work because there is no such existing work of secure
checkpointing using public key cryptosystem. Our algorithm is based on coordinated checkpointing along
with low overhead public key cryptosystem ECC. So we can conclude that secure checkpointing with public
key cryptosystem is possible in mobile environment.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
E.N. (Mootaz) Elnozahy, L.Alvisi, Yi-min Wang and D. B. Johnson, “A Survey of Rollback Recovery Protocol in
Message Passing System,” ACM Comput. Surv., Vol. 34, No.3. pp. 375-408 September 2002.
S. Zang and T. Yuan, “Secure Fault Tolerance in Wireless Sensor Network,” Proc. IEEE 8th International
Conference on Computer and Information Technology Workshops, IEEE Computer Society Washington, DC, USA,
2008, pp. 477-482, doi 10.1109CIT.2008.Workshop.26.
J. Pelzl and T. Wollinger, “Security Aspect of Mobile Communication Systems,”2005 pp.168-185.
Bhargava and L. Lilien, “Vulnerabilities and Threats in Distributed Systems,” Distributed Computing and Internet
Technology, First International Conference, ICDCIT 2004, Bhubaneswar, India, LNCS 3347, pp.146-157, 2004.
A. Josang and G. Sanderud, “Security in Mobile Communication: Challenges and Opportunities,” Proc. of the
Australasian information security workshop conference on ACSW frontiers 2003, Volume 21.
H. Lin, L. Harn and V. Kumar, “Authentication Protocols in Wireless Communications,” 1995.
H. Nam, J. Kim, S.J. Hong, and S. Lee, "Secure checkpointing", presented at Journal of Systems Architecture,
pp.237-254, 2003.
W. Chou, “Elliptic curve cryptography and its application to mobile devices”, Federal Information Processing
Standards Publications, Prentice Hall, 2003.
N. Gura, A. Patel, A. Wander, H. Eberle, and S. C. Shantz, “Comparing Elliptic curve cryptography and RSA on 8bit CPUs”, Proc. CHES, pp.119-132 2004.
A. Wander, N. Gura, H. Eberle, V. Gupta and S. C. Shantz, “Energy analysis for public key cryptography for
Wireless Sensor Network” Proc. IEEE 3rd International Conference on Pervasive Computing and Communication,
pp. 324-328, March 2005.
Mobile Communications by Jochen Schiller, Second Edition, Pearson Education 2003 edition.
Cryptography and Network Security by Atul Kahate, Second Edition, Tata McGraw-Hill Publishing Company
Limited,2007 publication.
Guide to Elliptic Curve Cryptography by Darrel Hankerson, Alfred Menezes, Scott Vanstone, Springer,2004
publication.
18