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.
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
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.
Prevention of Packet Hiding Methods In Selective Jamming AttackIJCERT
The sharing nature of wireless medium provides various challenging features among various set of users. It is very important in real world and it provides better transfer rate but authentication is ignored. The limitations of existing wired network are overcome by wireless network. These networks act as source for various types of jamming attacks. In analysis and detection of jamming attack various methods are available but sometime they fail. In case of external threat the analysis and reporting of jamming attack is very easy model but it is quite difficult in terms of internal threat model, these internal term uses the knowledge about network secrets and network protocols to launch various attacks with very low effort. Various cryptographic techniques are implemented to prevent these attacks. The main goal of this project is to prevent the information at the wireless physical layer and allowed the safe transmission among communicated nodes although the attacker is present.
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.
List of Parallel and Distributed System IEEE 2014 Projects. It Contains the IEEE Projects in the Domain Parallel and Distributed System for the year 2014
Parallel and Distributed System IEEE 2014 ProjectsVijay Karan
List of Parallel and Distributed System IEEE 2014 Projects. It Contains the IEEE Projects in the Domain Parallel and Distributed System for the year 2014
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
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.
Prevention of Packet Hiding Methods In Selective Jamming AttackIJCERT
The sharing nature of wireless medium provides various challenging features among various set of users. It is very important in real world and it provides better transfer rate but authentication is ignored. The limitations of existing wired network are overcome by wireless network. These networks act as source for various types of jamming attacks. In analysis and detection of jamming attack various methods are available but sometime they fail. In case of external threat the analysis and reporting of jamming attack is very easy model but it is quite difficult in terms of internal threat model, these internal term uses the knowledge about network secrets and network protocols to launch various attacks with very low effort. Various cryptographic techniques are implemented to prevent these attacks. The main goal of this project is to prevent the information at the wireless physical layer and allowed the safe transmission among communicated nodes although the attacker is present.
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.
List of Parallel and Distributed System IEEE 2014 Projects. It Contains the IEEE Projects in the Domain Parallel and Distributed System for the year 2014
Parallel and Distributed System IEEE 2014 ProjectsVijay Karan
List of Parallel and Distributed System IEEE 2014 Projects. It Contains the IEEE Projects in the Domain Parallel and Distributed System for the year 2014
Blind Key Steganography Based on Multilevel Wavelet and CSF irjes
- Steganography is the art and science of invisible communication as it hides the information message
inside cover image In This paper the cover image is decomposed using multilevel wavelet transform and theses
wavelet coefficients are statistically weighted according to their perceptual importance (CSF weights) to identify
the regions of interest for the embedding. The hiding image is encrypted using secret key based on wavelet
coefficients on the last approximation level. Then the encrypted watermark is embedded using CSF weights in
the wavelet domain into the cover image. Experimental results denote the feasibility of the proposed method as
the stego images has high PSNR and subjective quality which declare that the algorithm gains a good
performance in transparency and robustness against noise attacks.
Hungarian-Puzzled Text with Dynamic Quadratic Embedding SteganographyIJECEIAES
Least-Significant-Bit (LSB) is one of the popular and frequently used steganography techniques to hide a secret message in a digital medium. Its popularity is due to its simplicity in implementation and ease of use. However, such simplicity comes with vulnerabilities. An embedded secret message using the traditional LSB insertion is easily decodable when the stego image is suspected to be hiding a secret message. In this paper, we propose a novel secure and high quality LSB embedding technique. The security of the embedded payload is employed through introducing a novel quadratic embedding sequence. The embedding technique is also text dependent and has non-bounded inputs, making the possibilities of decoding infinite. Due to the exponential growth of and quadratic embedding, a novel cyclic technique is also introduced for the sequence that goes beyond the limits of the cover medium. The proposed method also aims to reduce the noise arising from embedding the secret message by reducing bits changed. This is done by partitioning the cover medium and the secret message into N partitions and artificially creating an assignment problem based on bit change criteria. The assignment problem will be solved using the Hungarian algorithm that will puzzle the secret message partition for an overall least bit change.
A Novel Framework for Short Tandem Repeats (STRs) Using Parallel String MatchingIJERA Editor
Short tandem repeats (STRs) have become important molecular markers for a broad range of applications, such
as genome mapping and characterization, phenotype mapping, marker assisted selection of crop plants and a
range of molecular ecology and diversity studies. These repeated DNA sequences are found in both Plants and
bacteria. Most of the computer programs that find STRs failed to report its number of occurrences of the
repeated pattern, exact position and it is difficult task to obtain accurate results from the larger datasets. So we
need high performance computing models to extract certain repeats. One of the solution is STRs using parallel
string matching, it gives number of occurrences with corresponding line number and exact location or position
of each STR in the genome of any length. In this, we implemented parallel string matching using JAVA Multithreading
with multi core processing, for this we implemented a basic algorithm and made a comparison with
previous algorithms like Knuth Morris Pratt, Boyer Moore and Brute force string matching algorithms and from
the results our new basic algorithm gives better results than the previous algorithms. We apply this algorithm in
parallel string matching using multi-threading concept to reduce the time by running on multicore processors.
From the test results it is shown that the multicore processing is a remarkably efficient and powerful compared
to lower versions and finally this proposed STR using parallel string matching algorithm is better than the
sequential approaches.
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.
Quantum cryptography for secured communication networksIJECEIAES
Quantum cryptography is a method for accessing data with the cryptosystem more efficiently. The network security and the cryptography are the two major properties in securing the data in the communication network. The quantum cryptography uses the single photon passing through the polarization of a photon. In Quantum Cryptography, it's impossible for the eavesdropper to copy or modify the encrypted messages in the quantum states in which we are sending through the optical fiber channels. Cryptography performed by using the protocols BB84 and B92 protocols. The two basic algorithms of quantum cryptography are Shor’s algorithm and the Grover’s’s algorithm. For finding the number of integer factorization of each photon, Shor’s algorithm is used. Grover’s’s algorithm used for searching the unsorted data. Shor’s algorithm overcomes RSA algorithm by high security. By the implementation of quantum cryptography, we are securing the information from the eavesdropper and thereby preventing data in the communication channel.
Utilisation of l-Diversity and Differential Privacy in the Anonymisation of N...Shankar Lal
Noise addition for anonymisation is a known technique for increasing the privacy of a data sets. However this technique is often presented as individual and independent, or, just stated as techniques to be applied. This increases the danger of
misapplication of these techniques and a resulting anonymised data set that is open to relatively easy re-identification or reconstruction. To better understand the application of these techniques we demonstrate their application to a specific domain - that of network trace anonymisation.
A Survey on Topology Control and Maintenance in Wireless Sensor Networksijeei-iaes
Wireless Sensor Networks (WSNs) consist of devices equipped with radio transceivers that cooperate to form and maintain a fully connected network of sensor nodes. WSNs do not have a fixed infrastructure and do not use centralized methods for organization. This flexibility enables them to be used whenever a fixed infrastructure is unfeasible or inconvenient, hence making them attractive for numerous applications ranging from military, civil, industrial or health. Because of their unique structure, and limited energy storage, computational and memory resources, many of the existing protocols and algorithms designed for wired or wireless ad hoc networks cannot be directly used in WSNs. Beside this, they offer a flexible low cost solution to the problem of event monitoring, especially in places with limited accessibility or that represent danger to humans. Applications of large scale WSNs are becoming a reality example are being a Smart Grid, Machine to Machine communication networks and smart environment. It is expected that a topology control techniques will play an important role in managing the complexity of such highly complicated and distributed systems through self-organization capabilities. WSNs are made of resource constrained wireless devices, which require energy efficient mechanisms, algorithm/protocol. Control on topology is very important for efficient utilization of networks and is composed of two mechanisms, Topology Construction (TC) and Topology Maintenance (TM). By using these mechanism various protocols/algorithm have came into existence, like: A3, A3-Coverage (A3-Cov), Simple Tree, Just Tree, etc. This paper provides a full view of the studies of above mentioned algorithms and also provides an analysis of their merits and demerits.
NEW ALGORITHM FOR WIRELESS NETWORK COMMUNICATION SECURITYijcisjournal
This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid
algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations
Writing long sentences is bit boring, but with text prediction in the keyboard technology has made
this simple. Learning technology behind the keyboard is developing fast and has become more accurate.
Learning technologies such as machine learning, deep learning here play an important role in predicting the
text. Current trending techniques in deep learning has opened door for data analysis. Emerging technologies
such has Region CNN, Recurrent CNN have been under consideration for the analysis. Many techniques have
been used for text sequence prediction such as Convolutional Neural Networks (CNN), Recurrent Neural
Networks (RNN), and Recurrent Convolution Neural Networks (RCNN). This paper aims to provide a
comparative study of different techniques used for text prediction.
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.
A NOVEL SECURE COSINE SIMILARITY COMPUTATION SCHEME WITH MALICIOUS ADVERSARIESIJNSA Journal
Similarity coefficients play an important role in many aspects. Recently, several schemes were proposed, but these schemes aimed to compute the similarity coefficients of binary data. In this paper, a novel scheme
which can compute the coefficients of integer is proposed. To the best knowledge of us, this is the first scheme which canesist malicious adversaries attack.
A New Approach of Cryptographic Technique Using Simple ECC & ECFIJAEMSJORNAL
Cryptography is the technique in which usually a file is converted into unreadable format by using public key and private key system called as public key cryptosystem. Then as per the user requirement that file is send to another user for secure data transmission. In this paper we purposed an image based cryptography that Elliptic Curve Function (ECF) techniques and pseudo random encoding technique on images to enhance the security of RFID communication. In the ECF approach, the basic idea is to replace the Elliptic Curve Function (ECF) of the cover image with the Bits of the messages to be hidden without destroying the property of the cover image significantly. The ECF based technique is the most challenging one as it is difficult to differentiate between the cover object and Crypto object if few ECF bits of the cover object are replaced. In Pseudo Random technique, a random key is used as seed for the Pseudo Random Number Generator in needed in the embedding process. Both the techniques used a Crypto key while embedding messages inside the cover image. By using the key, the chance of getting attacked by the attacker is reduced.
Blind Key Steganography Based on Multilevel Wavelet and CSF irjes
- Steganography is the art and science of invisible communication as it hides the information message
inside cover image In This paper the cover image is decomposed using multilevel wavelet transform and theses
wavelet coefficients are statistically weighted according to their perceptual importance (CSF weights) to identify
the regions of interest for the embedding. The hiding image is encrypted using secret key based on wavelet
coefficients on the last approximation level. Then the encrypted watermark is embedded using CSF weights in
the wavelet domain into the cover image. Experimental results denote the feasibility of the proposed method as
the stego images has high PSNR and subjective quality which declare that the algorithm gains a good
performance in transparency and robustness against noise attacks.
Hungarian-Puzzled Text with Dynamic Quadratic Embedding SteganographyIJECEIAES
Least-Significant-Bit (LSB) is one of the popular and frequently used steganography techniques to hide a secret message in a digital medium. Its popularity is due to its simplicity in implementation and ease of use. However, such simplicity comes with vulnerabilities. An embedded secret message using the traditional LSB insertion is easily decodable when the stego image is suspected to be hiding a secret message. In this paper, we propose a novel secure and high quality LSB embedding technique. The security of the embedded payload is employed through introducing a novel quadratic embedding sequence. The embedding technique is also text dependent and has non-bounded inputs, making the possibilities of decoding infinite. Due to the exponential growth of and quadratic embedding, a novel cyclic technique is also introduced for the sequence that goes beyond the limits of the cover medium. The proposed method also aims to reduce the noise arising from embedding the secret message by reducing bits changed. This is done by partitioning the cover medium and the secret message into N partitions and artificially creating an assignment problem based on bit change criteria. The assignment problem will be solved using the Hungarian algorithm that will puzzle the secret message partition for an overall least bit change.
A Novel Framework for Short Tandem Repeats (STRs) Using Parallel String MatchingIJERA Editor
Short tandem repeats (STRs) have become important molecular markers for a broad range of applications, such
as genome mapping and characterization, phenotype mapping, marker assisted selection of crop plants and a
range of molecular ecology and diversity studies. These repeated DNA sequences are found in both Plants and
bacteria. Most of the computer programs that find STRs failed to report its number of occurrences of the
repeated pattern, exact position and it is difficult task to obtain accurate results from the larger datasets. So we
need high performance computing models to extract certain repeats. One of the solution is STRs using parallel
string matching, it gives number of occurrences with corresponding line number and exact location or position
of each STR in the genome of any length. In this, we implemented parallel string matching using JAVA Multithreading
with multi core processing, for this we implemented a basic algorithm and made a comparison with
previous algorithms like Knuth Morris Pratt, Boyer Moore and Brute force string matching algorithms and from
the results our new basic algorithm gives better results than the previous algorithms. We apply this algorithm in
parallel string matching using multi-threading concept to reduce the time by running on multicore processors.
From the test results it is shown that the multicore processing is a remarkably efficient and powerful compared
to lower versions and finally this proposed STR using parallel string matching algorithm is better than the
sequential approaches.
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.
Quantum cryptography for secured communication networksIJECEIAES
Quantum cryptography is a method for accessing data with the cryptosystem more efficiently. The network security and the cryptography are the two major properties in securing the data in the communication network. The quantum cryptography uses the single photon passing through the polarization of a photon. In Quantum Cryptography, it's impossible for the eavesdropper to copy or modify the encrypted messages in the quantum states in which we are sending through the optical fiber channels. Cryptography performed by using the protocols BB84 and B92 protocols. The two basic algorithms of quantum cryptography are Shor’s algorithm and the Grover’s’s algorithm. For finding the number of integer factorization of each photon, Shor’s algorithm is used. Grover’s’s algorithm used for searching the unsorted data. Shor’s algorithm overcomes RSA algorithm by high security. By the implementation of quantum cryptography, we are securing the information from the eavesdropper and thereby preventing data in the communication channel.
Utilisation of l-Diversity and Differential Privacy in the Anonymisation of N...Shankar Lal
Noise addition for anonymisation is a known technique for increasing the privacy of a data sets. However this technique is often presented as individual and independent, or, just stated as techniques to be applied. This increases the danger of
misapplication of these techniques and a resulting anonymised data set that is open to relatively easy re-identification or reconstruction. To better understand the application of these techniques we demonstrate their application to a specific domain - that of network trace anonymisation.
A Survey on Topology Control and Maintenance in Wireless Sensor Networksijeei-iaes
Wireless Sensor Networks (WSNs) consist of devices equipped with radio transceivers that cooperate to form and maintain a fully connected network of sensor nodes. WSNs do not have a fixed infrastructure and do not use centralized methods for organization. This flexibility enables them to be used whenever a fixed infrastructure is unfeasible or inconvenient, hence making them attractive for numerous applications ranging from military, civil, industrial or health. Because of their unique structure, and limited energy storage, computational and memory resources, many of the existing protocols and algorithms designed for wired or wireless ad hoc networks cannot be directly used in WSNs. Beside this, they offer a flexible low cost solution to the problem of event monitoring, especially in places with limited accessibility or that represent danger to humans. Applications of large scale WSNs are becoming a reality example are being a Smart Grid, Machine to Machine communication networks and smart environment. It is expected that a topology control techniques will play an important role in managing the complexity of such highly complicated and distributed systems through self-organization capabilities. WSNs are made of resource constrained wireless devices, which require energy efficient mechanisms, algorithm/protocol. Control on topology is very important for efficient utilization of networks and is composed of two mechanisms, Topology Construction (TC) and Topology Maintenance (TM). By using these mechanism various protocols/algorithm have came into existence, like: A3, A3-Coverage (A3-Cov), Simple Tree, Just Tree, etc. This paper provides a full view of the studies of above mentioned algorithms and also provides an analysis of their merits and demerits.
NEW ALGORITHM FOR WIRELESS NETWORK COMMUNICATION SECURITYijcisjournal
This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid
algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations
Writing long sentences is bit boring, but with text prediction in the keyboard technology has made
this simple. Learning technology behind the keyboard is developing fast and has become more accurate.
Learning technologies such as machine learning, deep learning here play an important role in predicting the
text. Current trending techniques in deep learning has opened door for data analysis. Emerging technologies
such has Region CNN, Recurrent CNN have been under consideration for the analysis. Many techniques have
been used for text sequence prediction such as Convolutional Neural Networks (CNN), Recurrent Neural
Networks (RNN), and Recurrent Convolution Neural Networks (RCNN). This paper aims to provide a
comparative study of different techniques used for text prediction.
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.
A NOVEL SECURE COSINE SIMILARITY COMPUTATION SCHEME WITH MALICIOUS ADVERSARIESIJNSA Journal
Similarity coefficients play an important role in many aspects. Recently, several schemes were proposed, but these schemes aimed to compute the similarity coefficients of binary data. In this paper, a novel scheme
which can compute the coefficients of integer is proposed. To the best knowledge of us, this is the first scheme which canesist malicious adversaries attack.
A New Approach of Cryptographic Technique Using Simple ECC & ECFIJAEMSJORNAL
Cryptography is the technique in which usually a file is converted into unreadable format by using public key and private key system called as public key cryptosystem. Then as per the user requirement that file is send to another user for secure data transmission. In this paper we purposed an image based cryptography that Elliptic Curve Function (ECF) techniques and pseudo random encoding technique on images to enhance the security of RFID communication. In the ECF approach, the basic idea is to replace the Elliptic Curve Function (ECF) of the cover image with the Bits of the messages to be hidden without destroying the property of the cover image significantly. The ECF based technique is the most challenging one as it is difficult to differentiate between the cover object and Crypto object if few ECF bits of the cover object are replaced. In Pseudo Random technique, a random key is used as seed for the Pseudo Random Number Generator in needed in the embedding process. Both the techniques used a Crypto key while embedding messages inside the cover image. By using the key, the chance of getting attacked by the attacker is reduced.
http://inarocket.com
Learn BEM fundamentals as fast as possible. What is BEM (Block, element, modifier), BEM syntax, how it works with a real example, etc.
How to Build a Dynamic Social Media PlanPost Planner
Stop guessing and wasting your time on networks and strategies that don’t work!
Join Rebekah Radice and Katie Lance to learn how to optimize your social networks, the best kept secrets for hot content, top time management tools, and much more!
Watch the replay here: bit.ly/socialmedia-plan
Content personalisation is becoming more prevalent. A site, it's content and/or it's products, change dynamically according to the specific needs of the user. SEO needs to ensure we do not fall behind of this trend.
Lightning Talk #9: How UX and Data Storytelling Can Shape Policy by Mika Aldabaux singapore
How can we take UX and Data Storytelling out of the tech context and use them to change the way government behaves?
Showcasing the truth is the highest goal of data storytelling. Because the design of a chart can affect the interpretation of data in a major way, one must wield visual tools with care and deliberation. Using quantitative facts to evoke an emotional response is best achieved with the combination of UX and data storytelling.
Succession “Losers”: What Happens to Executives Passed Over for the CEO Job?
By David F. Larcker, Stephen A. Miles, and Brian Tayan
Stanford Closer Look Series
Overview:
Shareholders pay considerable attention to the choice of executive selected as the new CEO whenever a change in leadership takes place. However, without an inside look at the leading candidates to assume the CEO role, it is difficult for shareholders to tell whether the board has made the correct choice. In this Closer Look, we examine CEO succession events among the largest 100 companies over a ten-year period to determine what happens to the executives who were not selected (i.e., the “succession losers”) and how they perform relative to those who were selected (the “succession winners”).
We ask:
• Are the executives selected for the CEO role really better than those passed over?
• What are the implications for understanding the labor market for executive talent?
• Are differences in performance due to operating conditions or quality of available talent?
• Are boards better at identifying CEO talent than other research generally suggests?
Creation of smart spaces and scaling of devices to achieve miniaturization in pervasive computing environments has put forth a question on the degree of security of such devices. Security being a unique challenge in such environments, solution demands scalability, access control, heterogeneity, trust. Most of the existing cryptographic solutions widely in use rely on the hardness of factorization and number theory
problems. With the increase in cryptanalytic attacks these schemes will soon become insecure. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this work, we discuss the aspects of Lattice based cryptography as a new dimension of providing security whose strength lies in the hardness of lattice problems. We discuss about a cryptosystem whose security relies on high lattice dimension.
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.
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.
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.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
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.
Balancing Trade-off between Data Security and Energy Model for Wireless Senso...IJECEIAES
An extensive effort to evolve various routing protocol to ensure optimal data delivery in energy efficient way is beneficial only if there is additional means of security process is synchronized. However, the security process consideration introduces additional overhead thus a security mechanism is needed to accomplish an optimal trade-off that exists in-between security as well as resource utilization especially energy. The prime purpose of this paper is to develop a process of security in the context of wireless sensor networks (WSN) by introducing two types of sensor node deployed with different capabilities. The proposed algorithm Novel Model of Secure Paradigm (N-MSP) which is further integrated with WSN. However, this algorithm uses a Hash-based Message Authentication Code (HMAC) authentication followed by pairwise key establishment during data aggregation process in a WSN. The extensive simulation carried out in a numerical platform called MATLAB that depicts that the proposed N-MSP achieves optimal processing time along with energy efficient pairwise key establishment during data aggregation process.
SECURE TRANSMISSION OF DATA IN SMART GRID WITH THE AID OF ELLIPTIC CURVE CRYP...IAEME Publication
A smart grid represents a straightforward improvement of a power grid, which effectively hands over electricity from suppliers to clients. It generally uses a two-way digital communication with an eye on managing the devices at client households. They are also competent to conserve energy, scale down overhead costs and to enhance consistency and lucidity. It is home to smart meters, which pave the way for communication with the main central system. As against home energy monitors, smart meters are capable of collecting data for distant reporting. The distribution or receipt of the data is very safely carried out to safeguard the confidentiality of the client power utilization and also to ensure continuous power distribution. Therefore, the cryptography technique is effectively used for increasing the safety and for furnishing the consistent power supply for the uninterrupted power distribution.
A Secure Data Transmission Scheme using Asymmetric Semi-Homomorphic Encryptio...IJAAS Team
The compressive detecting based information accumulation accomplishes with high exactness in information recuperation from less inspection which is available in sensor nodes. In this manner, the existing methods available in the literature diminish the information gathering cost and delays the existence cycle of WSNs. In this paper, a strong achievable security model for sensor network applications was initially proposed. At that point, a secure data collection conspire was displayed based on compressive detecting, which improves the information protection by the asymmetric semi-homomorphic encryption scheme, and decreases the calculation cost by inadequate compressive grid. In this case, particularly the asymmetric mechanism decreases the trouble of mystery key circulation and administration. The proposed homomorphic encryption permits the in-arrange accumulation in cipher domain, and in this manner improves the security and accomplishes the adjustment in system stack. Further, this paper focuses on estimating various network performances such as the calculation cost and correspondence cost, which remunerates the expanding cost caused by the homomorphic encryption. A real time validation on the proposed encryption scheme using AVISPA was additionally performed and the results are satisfactory.
The rapid need of wireless demands a great deal of security and reliable routing in order to keep all the data sources and equipments secure. In order to develop efficient and robust protocols, it is essential to understand the inherent characteristics of wireless networks such as connectivity, coverage and varying channel conditions. Wireless LAN introduces the concept that use can connect to any one at any place at anytime by using various mobile appliances that can be carried at any place. Now Communication is no longer limited to a one place by holding wired phones. This is the big boom to the I.T industry but it also brings a lot of opportunities and challenges for the Network Administrator who is looking after the Wireless LANs (WLAN). WLAN traffic travels over radio waves that cannot be constrained by the walls or any Simranjeet Kaur"Reliable and Efficient Routing in WLAN" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-6 , October 2017, URL: http://www.ijtsrd.com/papers/ijtsrd3585.pdf http://www.ijtsrd.com/computer-science/computer-network/3585/reliable-and-efficient-routing-in-wlan/simranjeet-kaur
AN EFFICIENT SECURE CRYPTOGRAPHY SCHEME FOR NEW ML-BASED RPL ROUTING PROTOCOL...IJNSA Journal
Internet of Things (IoT) offers reliable and seamless communication for the heterogeneous dynamic lowpower and lossy network (LLNs). To perform effective routing in IoT communication, LLN Routing Protocol (RPL) is developed for the tiny nodes to establish connection by using deflaut objective functions: OF0, MRHOF, for which resources are constraints like battery power, computation capacity, memory communication link impacts on varying traffic scenarios in terms of QoS metrics like packet delivery ratio, delay, secure communication channel. At present, conventional Internet of Things (IoT) are having secure communication channels issue for transmission of data between nodes. To withstand those issues, it is necessary to balance resource constraints of nodes in the network. In this paper, we developed a security algorithm for IoT networks with RPL routing. Initially, the constructed network in corporates optimizationbased deep learning (reinforcement learning) for route establishment in IoT. Upon the establishment of the route, the ClonQlearn based security algorithm is implemented for improving security which is based onaECC scheme for encryption and decryption of data. The proposed security technique incorporates reinforcement learning-based ClonQlearnintegrated with ECC (ClonQlearn+ECC) for random key generation. The proposed ClonQlearn+ECCexhibits secure data transmission with improved network performance when compared with the earlier works in simulation. The performance of network expressed that the proposed ClonQlearn+ECC increased the PDR of approximately 8% - 10%, throughput of 7% - 13%, end-to-end delay of 5% - 10% and power consumption variation of 3% - 7%.
Dual method cryptography image by two force secure and steganography secret m...TELKOMNIKA JOURNAL
With the go on the evolution of both computer and internet technology, videos, sounds, and scripts are used more and more often. It can be used in sundry techniques in ciphering and data concealing. The objective of this paper is leading to the suggestion of a new method of the combination between encryption and concealment of information so as to make it difficult to identify the transmitted datavia networks. This study has used two force secure (2FS) to encrypt the images, in other words, the SF is frequent twice on the image, to obtain powerful encryption then the concealing of the secret message is done inside the cryptography of the image has been performed using a secret key (cosine curve), and this stego-encryption image has been transformed forthe Internet of things storage in the database in IoT (data flow), when the user needs any information can be access inviaof internet of things (IoTs). The outcome of the proposed system is obtained tobe evaluated through different measures, such aspeak signal noise ratio (PSNR), mean square error (MSE), entropy,correlation coefficient, and histogram. The proposed system is good, efficient, fast, has high security, robustness, and transparency.
An energy-efficient cluster head selection in wireless sensor network using g...TELKOMNIKA JOURNAL
Clustering is considered as one of the most prominent solutions to preserve theenergy in the wireless sensor networks. However, for optimal clustering, anenergy efficient cluster head selection is quite important. Improper selectionofcluster heads(CHs) consumes high energy compared to other sensor nodesdue to the transmission of data packets between the cluster members and thesink node. Thereby, it reduces the network lifetime and performance of thenetwork. In order to overcome the issues, we propose a novelcluster headselection approach usinggrey wolf optimization algorithm(GWO) namelyGWO-CH which considers the residual energy, intra-cluster and sink distance.In addition to that, we formulated an objective function and weight parametersfor anefficient cluster head selection and cluster formation. The proposedalgorithm is tested in different wireless sensor network scenarios by varyingthe number of sensor nodes and cluster heads. The observed results conveythat the proposed algorithm outperforms in terms of achieving better networkperformance compare to other algorithms.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
1. Mr.P.Kanagaraju et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 3( Version 1), March 2014, pp.117-121
www.ijera.com 117 | P a g e
Secure Cluster Based Routing Using SAT/ILP Techniques and
ECC EL-Gamal Threshold Cryptography in MANET
Mr. P. Kanagaraju. Me, (Ph. D)*, Dr. R. Nallusamy Ph.D.**, Nandini. D. K***
*Department of Computer Science, K.S.Rangasamy college of Technology, Thiruchengode
** Professor
***Department of Computer Science, K.S.Rangasamy college of Technology, Thiruchengode.
ABSTRACT
The Elliptic curve cryptography ( ECC) a promising and important because it requires less computing power,
bandwidth, and also the memory when comparing to other cryptosystems The clustering algorithm using the
Integer Linear Programming (ILP) and Boolean Satisfiability (SAT) solvers. These improvements will secure
the application of SAT and ILP techniques in modeling composite engineering problem that is the Clustering
Problem in Mobile Ad-Hoc Networks (MANETs). The Clustering Problem in MANETs consists of selecting the
most appropriate nodes of a given MANET topology as clusterheads, and ensuring that regular nodes are related
to clusterheads such that the lifetime of the network is maximized. In which, discussing SAT/ILP techniques for
clustering techniques and ECC El Gamal Threshold Cryptography for the security. Through our implementation,
explored the possibility of using ECCEG-TC in MANETs.
Keywords - Boolean Satisfiability, Elliptic curve cryptography, ECC El Gamal Threshold Cryptography
Integer Linear Programming.
I. INTRODUCTION
Mobile ad hoc networks (MANETs) are
vulnerable to various attacks including denial-of-
service attacks because of wireless nature of these
networks. Devices with constraint resources add to its
vulnerability. To ensure availability of nodes,
threshold cryptography can be implemented in these
networks so that even if some of the information is
lost still the actual message reaches the intended
receiver without compromising security in terms of
secrecy, reliability, and genuineness.
Elliptic Curve Cryptography (ECC) was first
proposed by victor Miller and independently by Neal
Koblitz in the mid-1980s and has evolved into a
mature public-key cryptosystem. Distinguish to its
conventional counterparts, ECC offers the same level
of security using security.
Threshold cryptography achieves the
security needs such as confidentiality and integrity
against malicious nodes. It also provides data
integrity and availability in a hostile environment and
can also employ verification of the correct data
sharing. All this is achieved without revealing the
secret key. Thus, taking into consideration these
characteristics, implementing TC to secure messages
seems a perfect solution in MANETs.
For the past few decades, Integer Linear
Programming (ILP) and Boolean Satisfiability (SAT)
solvers have enhanced a lot through the beginning of
new intelligent algorithms that allowed the solvers to
handle a wider range of difficult Engineering based
problems. Mainly one of such problem is clustering
in Mobile Ad-Hoc Networks (MANETs).
Cryptography is transforming a information it into an
unreadable format in which a message can be
concealed from reader and only the intended recipient
will be able to convert it into original text. Its main
goal is to keep the data secure from unauthorized
access. Data can be read and understood without any
special measures are known as plaintext. Hiding
information into the plaintext is called encryption.
Encrypted plaintext information into an unreadable
garbage known as cipher-text. Reverting process of
cipher text to its original plaintext is called
decryption. A system provides encryption and
decryption is called cryptosystems. Cryptography
provides number of security goals to ensure the
privacy of data, on-alteration of data and so on.
Types of various goals of cryptography are below
Confidentiality
Maintaining a secret communication
between the two authorized persons.
Authentication
Checking the identity of the information
from the legitimate or authentication ID.
Data Integrity
Verifying the information that has not been
altered by unauthorized which means no one in
between the sender and receiver are allowed to alter
RESEARCH ARTICLE OPEN ACCESS
2. Mr.P.Kanagaraju et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 3( Version 1), March 2014, pp.117-121
www.ijera.com 118 | P a g e
the given message.
Non Repudiation
Thus when a message is sent, the receiver
can prove that the message was in fact send by the
suspected sender. Correspondingly, when a message
is received, the sender can prove the suspected
receiver in fact received the message.
Access Control
Only the certified parties are able to right to
use the given information
.
II. Integer Linear Programming And
Boolean Satisfiability
Integer Linear Programming (ILP) involves
maximizing or minimizing a function with respect to
certain constraints where the optimal function and
constraints are linear and the used variables can only
take integer values [2]. Cases where the integer
values are restricted to (0–1) are called Binary ILP
Problems. In SAT the constraints between variables
are represented using what is called propositional
logic. It involves the use of AND, OR and NOT
operations to construct formulas in the Products-of-
Sums form or Conjunctive Normal Form (CNF). The
variables can only take Binary values (0–1). Given
constraints articulated in CNF, the ambition is to spot
a variable obligation that will satisfy all constraints in
the problem or verify that no such task exists. To
assure or to solve, SAT will go all the way through
the hunt space and conclude whether or not there is a
fulfilling variable assignment. Superior decision
heuristics and clever inconsistency analysis
techniques can be used to evade probing through the
complete tree of 2n assignments.
It proposes an ILP formulation of the
clustering problem, structure on the ideas and
assumptions put forward in the EEC-CB model
presented in this model improves on weaknesses
present in the EEC-CB model and adds idleness
through the use of a Star-Ring backbone. In addition,
a proposed enhancement allows coverage to be taken
into account.
Proposed Base Model
Variables are maintained below as:
− N: Total number of nodes in the network
(predetermined)
− P: Number of clusters heads (predetermined)
− di j : Euclidean distance between nodes i and j
− K : Max number of nodes that can be connected
to a CH (predetermined)
− ci j : Cost of connecting a regular node i
to CH j (proportional to di
2
j)
− h j k : Cost of connecting CH j to CH k
(proportional to d3
jk )
The assumptions which were made above in
the ILP formulations are also valid to the proposed
ILP formulation. Variable b, in the intention role,
which represents the level of the node’s capability to
act as a cluster head, gets its value from an external
source (algorithm, tool, etc). This is useful as
multiple approaches or algorithms, which decide the
suitability of a node in acting as a cluster head, can
be combined with this model without altering the
equations, even though this is out of the range of
research. Then it is unspecified that nodes are able to
resolve each other’s spot.
Fig. 1 Star-ring backbone.
Intra Cluster Communication Enhancement
Intra Cluster communication is introduced
for two issues. First is that the most important
accountability of the cluster head should be to route
communication among clusters and not inside a
cluster. The aim is for the cluster head to preserve as
much energy as achievable for the contact between
clusters, allowing it to last longer in its position as a
cluster head. The second cause after enhancing the
intra cluster contact is that should a cluster head fail,
the nodes inside a cluster will be able to
communicate.
Multihop Connections Enhancement
Multihop connections are introduced into
the formulation to permit longer, extra exclusive
links to be replaced by shorter less costly links.
relatively than attach straight to a cluster head which
is further away, it is preferable to make a lesser cost
link to a cluster head during another regular node.
Though, the in-between regular node will now, in a
sense, act like a second tier cluster head as it will
route the communication of the regular node through
it to the cluster head. Price of this routing must be
taken into explanation. After that objective function
is used to integrate the cost of multihop connections
to the proposed Star-Ring base model.
Coverage Enhancement
The proposed Base Model can be extended
to take into account the coverage radius of the nodes
3. Mr.P.Kanagaraju et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 3( Version 1), March 2014, pp.117-121
www.ijera.com 119 | P a g e
in the system, and make sure that links are
recognized only between nodes that are within each
other’s exposure radius. Likewise the same manner in
which the distances between nodes are used to
determine the price of the links, it can also be
compared to the exposure radius of each node and
used to Sample MANET topology.
III. Ecc Elgamal Tc (Ecceg-Tc)
The ELGamal public-key encryption scheme
can be viewed as Diffie-Hellman key agreement
protocol in key transmit mode. Its protection is based
on the intractability of the discrete Logarithm
Problem (DLP) and the Diffie-Hell man problem.
EC-ELGamal protocol implemented for safe
communication. One essential tip is to note is unlike
ECDH protocol, this protocol does not create
common key, but using EC-ELGamal protocol a
message M=(M1,M2),a point on elliptic curve, can
be sent from Bank to Alice and vice versa.
Performing the decrypting, reverse the
embedding process to create the message M starting
to the point P. It is not trivial to find a point M for the
communication. Communication that is difficulty in
obtaining the private key from the public key is based
on the discrete log problem (DLP) for elliptic curves.
The ELGamal digital signature scheme:
The ELGamal signature algorithm is similar
to the encryption algorithm in that the public key and
private key have the same form; however, encryption
is not the same as signature verification, nor is
decryption the same as signature creation as RSA.
In following sections, our goal is to implement ECC
based ElGamal threshold cryptography (ECCEG-
TC). In this algorithm, key is not shared because the
public as well as private keys are in form of points
and we cannot apply Lagrange on the points
altogether to split message or to combine it. Hence,
ECCEG-TC for message splitting before encryption
is simulated for MANET environment and then it is
compared with performance of RSA-TC. The ECC El
Gamal Threshold cryptography (ECCEG-TC)
algorithm is briefly explained.
ECCEG-TC Message Split before Encryption
Algorithm
Suppose that the ECC has a point G on an
elliptic curve E
p
(a, b), and the order of G is q. p is a
large prime.
Bob’s private key and public key are n
B
, 0 < n
B
< q,
and K
B
= n
B
G.
• First we choose a prime number p > max(M, n),
and define a
0
= M, the message. Then we select k
- 1 random, independent coefficients a
1
, a
2
,…a
k -
1
, 0 ≤ a
j
≤ p-1, defining the random polynomial
f(x) over Zp, a Galois prime field GF(p).
• We compute n shares, M
i
= f(x
i
) mod p, 1≤ i ≤ n,
where x
i
can be just the public index i for
simplicity, and convert them to points P
i
on
elliptic curve E
p
(a, b).
• Alice picks a random number r, and sends rG
and P
i
+ rK
B
to Bob with index t.
• Bob recovers each elliptic curve point by
calculating P
i
+ rK
B
– n
B
rG = P
i
.
• Bob converts P
i
to M
i
, and deduces M by using
Lagrange interpolation formula M.
ECCEG-TC Implementation
ECCEG-TC,to select the ECC parameters,
i.e. a, b, p, widely accepted NIST curves were
selected for implementation for 192, 224, and 256
bits. For conversion of message to and from ECC
point, method discussed by Kobiltz is used such that
(kappa*M)mod p < x <(kappa*(M+1))mod p, where
(x, y) is a point on elliptic curve. In our ECCEG-TC
implementation, kappa is fixed to 2
8
. To retrieve a
message from a ECC point (x, y), M= x/kappa mod p
is used.
For calculating the shares and for combining
partial messages, Shamir’s Lagrange interpolation
scheme is implemented. For its polynomial, the
coefficients are randomly generated over the modulus
p. The co-efficient zero depends on the x and y values
of ECC point information that needs to be transmitted
based on ECC algorithm used. As against RSA
algorithm where we are sharing the keys, in ECC-TC
implementation, the partial shares of the message are
generated and then encrypted to get ECC point.
Cryptography is transforming a information it into an
unreadable format in which a message can be
concealed from reader and only the intended recipient
will be able to convert it into original text. Its main
goal is to keep the data secure from unauthorized
access.
IV. Performance Results Performance
Results
Fig. 2 Topology generated by the ILP formulation
without coverage constraints.
4. Mr.P.Kanagaraju et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 3( Version 1), March 2014, pp.117-121
www.ijera.com 120 | P a g e
Fig. 3 Topology generated by the ILP formulation
with coverage constraints.
Fig.4 illustrates that with increase in ECC
key size, the total encryption timings increase
gradually for given n and t. For constant key size and
n, the encryption timings increase with t as the time
to generated Lagrange polynomial and respective
message shares increases accordingly.
Fig. 4 Total Encryption Timings for ECCEG-TC
Fig. 5 shows that the share generation
timings increase with increase in key size or with n or
t. Share generation timings are very small compared
to the encryption timings.
Fig. 5 Share Generation Timings for ECCEG-TC
Combination time is the time required to
combine t partial messages using Shamir’s Lagrange
interpolation method to retrieve original message.
From Fig. 6, the total decryption and combination
timings increase gradually with increase in t for
constant key size and n. This increase is due to time
required to decrypt and combine additional partial
messages as t is increased. Increase in the key size
results in proportional increase in the decryption
timings irrespective of n and t.
Fig. 6 Decryption and Combination Timings for
ECCEG-TC
Number of point addition of ECCEG-TC
increases with n resulting into proportionate increase
in addition timing in encryption and decryption as
seen in Fig. 4 and Fig. 6. The time required
converting message to point and vice-versa is
significantly small compared to encryption and share
generation time and hence not shown separately. In
ECCEG-TC, the Lagrange is carried over prime field
p, hence the success rate is 100% as all the partial
messages are recovered without any issue of inverse
calculation.
V. Conclusion
An improved ILP formulation to solve the
clustering trouble in MANETs. The future model
offered the utilize of a Star-Ring backbone. In
addition, the planned formulation incorporated the
ability to enforce coverage constraints to ensure that
only connections that are within the physical
limitations of the node are established. Applications
of MANETs are on rise and hence it is necessary to
provide security to this vulnerable wireless networks.
And by further exploring and implementing ECC
ELgamal threshold cryptography algorithms, its
shown that secure MANETs are feasible.
References
[1] S. Chinara and S. Rath, “Energy efficient
mobility adaptive distributed clustering
algorithm for mobile ad hoc network,” in
Proc. Int. Conf. Adv. Comput. Commun.,
2008, pp. 265–272.
[2] A. Schrijver, Theory of Linear and Integer
Programming.New York, NY, USA: Wiley,
1999.
[3] F. Aloul, A. Ramani, I. Markov, and K.
Sakallah, “Generic ILP versus specialized 0-
1 ILP: An update,” in Proc. Int. Conf.
Comput.-Aided Design, 2002, pp. 450–457.
[4] D. Chai and A. Kuehlmann, “A fast pseudo-
5. Mr.P.Kanagaraju et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 3( Version 1), March 2014, pp.117-121
www.ijera.com 121 | P a g e
[5] Boolean constraint solver,” IEEE Trans.
Comput.-Aided Design Integr. Circuits Syst.,
vol. 24, no. 3, pp.305–317, Mar. 2005.
[6] A. Sagahyroon, F. Aloul, and A. Sudnitson,
“Using SAT-based tech-niques in low
power state assignment,” J. Circuits, Syst.,
Comput, vol. 20, no. 8, pp. 1605–1618,
2011.
[7] Yufang Huang, “Algorihtm for elliptic
curve diffie-Hellman key exchange based
on DNA title self assembly In Proceedings
of 46th
IEEE Theories and
Applications,pp.31-36, 2008.
[8] A. M. Fiskiran and R. B. Lee. “Workload
characterization of elliptic curve
cryptography and other network security
algorithms for constrained environments”.
IEEE International Workshop on WWC-5,
2009.
[9] K. Lauter, “The advantages of Elliptic
Curve Cryptography For Wireless
Security”, IEEE Wireless Communications,
vol. 11, no. 1, Feb. 2004, pp. 62-67.
[10] Y. Desmedt and Y. Frankel, “Threshold
cryptosystems”, in Advances in Cryptology
- Crypto '89, Proceedings, Lecture Notes in
Computer Science 435, G. Brassard, Ed.,
Santa Barbara: Springer-Verlag,1990, pp.
307-315.