In this paper a technique for intrusion detection in MANET has been proposed where agents
are fired from a node which traverses each node randomly and detect the malicious node.
Detection is based on triangular encryption technique (TE) where AODV is taken as routing
protocol. For simulation we have taken NS2 (2.33) where two type of parameters are
considered out of which number of nodes and percentage of node mobility are the attributes.
For analysis purpose 20, 30, 30, 40, 50 and 60 nodes are taken with a variable percentage of
malicious node as 0 %( no malicious), 10%, 20%, 30% and 40%. Analysis have been done
taking generated packets, forwarded packets, delay, and average delay as parameters
A NOVEL DATA ENCRYPTION TECHNIQUE BY GENETIC CROSSOVER OF ROBUST BIOMETRIC KE...IJNSA Journal
In Fingerprint based Biometric authentication image of the fingerprint can be scanned and can be used later on for the purpose of authentication. So this process does not provide very high security. This paper proposes another level of security by using the concept of combined key. The key is obtained by crossing over of the Session key generated from the password given by the legitimate user and the Biometric key generated from the fingerprint of the same user. The proposed approach trained the system by Artificial Neural Network in such a way that a small portion of the fingerprint is enough to generate the Biometric key which minimizes the chance of false rejection. So in this approach there is a significant improvement of the traditional authentication techniques.
LOCATION BASED DETECTION OF REPLICATION ATTACKS AND COLLUDING ATTACKSEditor IJCATR
Wireless sensor networks gains its importance because of the critical applications in which it is involved like
industrial automation, healthcare applications, military and surveillance. Among security attacks in wireless sensor
networks we consider an active attack, NODE REPLICATION attack and COLLUDING attack. We use localized
algorithms, ((ie) replication detection is done at the node level and eliminated without the intervention of the base
station) to solve replication attacks and colluding attacks. Replication attacks are detected to using a unique key pair
and cryptographic hash function. We propose to use XED and EED algorithm[1] ( authenticates the node and tries to
reduce the replication) , with this using the Event detected location , non-beacon node is used to find the location of a
malicious node and by a simple threshold verification we identify malicious clusters
A Survey on Fingerprint Protection TechniquesIRJET Journal
This document summarizes several techniques for fingerprint protection and privacy, including combining fingerprint features from two fingers to generate a new identity, using fuzzy vault techniques to securely store fingerprint data, and enhancing fingerprint images to improve minutiae extraction for matching. It also reviews related work on fingerprint reconstruction and enhancement algorithms to improve matching performance. The document concludes that combining features from multiple fingerprints satisfies requirements for fingerprint alteration detection while improving matching accuracy.
Smart Bank Locker Access System Using Iris ,Fingerprints,Face Recognization A...IJERA Editor
In today's modern world, security plays an important role. For that purpose, we proposed advance security systems for banking locker system and the bank customers. This specialized security is proposed through four different modules in combination i.e. face detection technique, Password verification, finger prints and Iris verification .All these steps are followed in the sequence if anything goes wrong he or she is unable to access the system. We are also providing some additional billing with it i.e. it will always for after 1 transaction. It will give the intimation of first transaction is complete and you are left with prescribed number transaction mentioned in system.
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
SYMMETRIC KEY MANAGEMENT SCHEME FOR HIERARCHICAL WIRELESS SENSOR NETWORKSIJNSA Journal
Wireless Sensor Networks (WSNs) are critical component in many applications that used for data collection. Since sensors have limited resource, Wireless Sensor Networks are more vulnerable to attacks than other wireless networks. It is necessary to design a powerful key management scheme for WSNs and take in consideration the limited characteristics of sensors. To achieve security of communicated data in the network and to extend the WSNs lifetime; this paper proposes a new scheme called Symmetric Key Management Scheme (SKMS). SKMS used Symmetric Key Cryptography that depends only on a Hash function and XOR operation for securing homogeneous and heterogeneous hierarchical WSNs. Symmetric Key Cryptography is less computation than Asymmetric Key Cryptography. Simulation results show that the proposed scheme provides security, save the energy of sensors with low computation overhead.
SECURITY EVALUATION OF LIGHT-WEIGHT BLOCK CIPHERS BY GPGPUacijjournal
This document summarizes a research paper that proposes using GPUs to accelerate the security evaluation of lightweight block ciphers through integral attacks. The paper first provides background on integral attacks and discusses limitations of previous evaluation methods. It then proposes a new algorithm that uses both theoretical and experimental steps to iteratively search for higher-order integral distinguishers. In the experimental step, the algorithm executes computer experiments on candidate distinguishers using a GPU to accelerate the computations. When applied to several lightweight block ciphers, the proposed method obtained more advantageous results than previous approaches.
Image encryption using jumbling saltingMauryasuraj98
In this project we have implemented the modified JS algorithm and later compared it with other similar functioning algorithms such as AES, DES and Jumbling Salting Algorithm.
Also we have done this by using a throughput value that is considered as measure for comparing the effectiveness of these algorithms. Basically the throughput value indicates the number of Megabytes of image encrypted with respect to time taken to encrypt the image.
A NOVEL DATA ENCRYPTION TECHNIQUE BY GENETIC CROSSOVER OF ROBUST BIOMETRIC KE...IJNSA Journal
In Fingerprint based Biometric authentication image of the fingerprint can be scanned and can be used later on for the purpose of authentication. So this process does not provide very high security. This paper proposes another level of security by using the concept of combined key. The key is obtained by crossing over of the Session key generated from the password given by the legitimate user and the Biometric key generated from the fingerprint of the same user. The proposed approach trained the system by Artificial Neural Network in such a way that a small portion of the fingerprint is enough to generate the Biometric key which minimizes the chance of false rejection. So in this approach there is a significant improvement of the traditional authentication techniques.
LOCATION BASED DETECTION OF REPLICATION ATTACKS AND COLLUDING ATTACKSEditor IJCATR
Wireless sensor networks gains its importance because of the critical applications in which it is involved like
industrial automation, healthcare applications, military and surveillance. Among security attacks in wireless sensor
networks we consider an active attack, NODE REPLICATION attack and COLLUDING attack. We use localized
algorithms, ((ie) replication detection is done at the node level and eliminated without the intervention of the base
station) to solve replication attacks and colluding attacks. Replication attacks are detected to using a unique key pair
and cryptographic hash function. We propose to use XED and EED algorithm[1] ( authenticates the node and tries to
reduce the replication) , with this using the Event detected location , non-beacon node is used to find the location of a
malicious node and by a simple threshold verification we identify malicious clusters
A Survey on Fingerprint Protection TechniquesIRJET Journal
This document summarizes several techniques for fingerprint protection and privacy, including combining fingerprint features from two fingers to generate a new identity, using fuzzy vault techniques to securely store fingerprint data, and enhancing fingerprint images to improve minutiae extraction for matching. It also reviews related work on fingerprint reconstruction and enhancement algorithms to improve matching performance. The document concludes that combining features from multiple fingerprints satisfies requirements for fingerprint alteration detection while improving matching accuracy.
Smart Bank Locker Access System Using Iris ,Fingerprints,Face Recognization A...IJERA Editor
In today's modern world, security plays an important role. For that purpose, we proposed advance security systems for banking locker system and the bank customers. This specialized security is proposed through four different modules in combination i.e. face detection technique, Password verification, finger prints and Iris verification .All these steps are followed in the sequence if anything goes wrong he or she is unable to access the system. We are also providing some additional billing with it i.e. it will always for after 1 transaction. It will give the intimation of first transaction is complete and you are left with prescribed number transaction mentioned in system.
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
SYMMETRIC KEY MANAGEMENT SCHEME FOR HIERARCHICAL WIRELESS SENSOR NETWORKSIJNSA Journal
Wireless Sensor Networks (WSNs) are critical component in many applications that used for data collection. Since sensors have limited resource, Wireless Sensor Networks are more vulnerable to attacks than other wireless networks. It is necessary to design a powerful key management scheme for WSNs and take in consideration the limited characteristics of sensors. To achieve security of communicated data in the network and to extend the WSNs lifetime; this paper proposes a new scheme called Symmetric Key Management Scheme (SKMS). SKMS used Symmetric Key Cryptography that depends only on a Hash function and XOR operation for securing homogeneous and heterogeneous hierarchical WSNs. Symmetric Key Cryptography is less computation than Asymmetric Key Cryptography. Simulation results show that the proposed scheme provides security, save the energy of sensors with low computation overhead.
SECURITY EVALUATION OF LIGHT-WEIGHT BLOCK CIPHERS BY GPGPUacijjournal
This document summarizes a research paper that proposes using GPUs to accelerate the security evaluation of lightweight block ciphers through integral attacks. The paper first provides background on integral attacks and discusses limitations of previous evaluation methods. It then proposes a new algorithm that uses both theoretical and experimental steps to iteratively search for higher-order integral distinguishers. In the experimental step, the algorithm executes computer experiments on candidate distinguishers using a GPU to accelerate the computations. When applied to several lightweight block ciphers, the proposed method obtained more advantageous results than previous approaches.
Image encryption using jumbling saltingMauryasuraj98
In this project we have implemented the modified JS algorithm and later compared it with other similar functioning algorithms such as AES, DES and Jumbling Salting Algorithm.
Also we have done this by using a throughput value that is considered as measure for comparing the effectiveness of these algorithms. Basically the throughput value indicates the number of Megabytes of image encrypted with respect to time taken to encrypt the image.
Secure E-voting System by Utilizing Homomorphic Properties of the Encryption ...TELKOMNIKA JOURNAL
The use of cryptography in the e-voting system to secure data is a must to ensure the authenticity
of the data. In contrast to common encryption algorithms, homomorphic encryption algorithms had unique
properties that can perform mathematical operations against ciphertext. This paper proposed the use of
the Paillier and Okamoto-Uchiyama algorithms as two homomorphic encryption algorithms that have the
additional properties so that it can calculate the results of voting data that has been encrypted without
having to be decrypted first. The main purpose is to avoid manipulation and data falsification during vote
tallying process by comparing the advantages and disadvantages of each algorithm.
An Efficient Key Distribution Scheme for Wireless Sensor Networks using poly...Deepti Dohare
The document proposes a key distribution scheme for wireless sensor networks based on polynomials. It has the advantages of both probabilistic and deterministic schemes by providing full connectivity like deterministic schemes while also being resilient to node capture like probabilistic schemes. The scheme involves initially distributing symmetric polynomials to nodes. After establishing keys with neighbors, nodes erase their polynomials. To add new nodes, a set of polynomials is given and keys are established by exchanging encrypted values with neighbors. The scheme has low communication and space overhead compared to other approaches.
Visual Cryptography for biometric privacywaseem ahmad
visual cryptography for biometric privacy Preserving the privacy of digital biometric data (e.g., face images) stored in a central database has become of paramount importance. This work explores the possibility of using visual cryptography for imparting privacy to biometric data
IRJET-Survey of Highly Secured Methods for Image Transmission using Image Seg...IRJET Journal
This document summarizes a research paper that proposes a new method for securely transmitting images using image segmentation, permutation, and multi-encryption techniques. It begins with an abstract that outlines encrypting images to protect confidential data from unauthorized access. It then provides background on encryption and discusses how traditional text encryption is not suitable for large image files. The proposed method segments an image, permutes the pixels using random numbers, and repeats the encryption multiple times for security. It claims this approach provides strong encryption with minimal data loss or computational costs compared to other methods.
IRJET - Securing Computers from Remote Access Trojans using Deep Learning...IRJET Journal
This document presents a system that uses deep learning to detect Remote Access Trojans (RATs) with high accuracy. The proposed system has two operators - a host analyzer that monitors the host for irregularities, and a network analyzer that monitors network traffic for RAT patterns using an Artificial Neural Network algorithm. The system was tested on real datasets and achieved over 99.3% accuracy in detecting RAT files, with low false positive rates. Future work includes further reducing false positives and increasing the number of RAT samples to improve accuracy.
This document proposes a novel image cryptography method using nearest prime pixels for key generation. It begins by introducing image cryptography and its basic concepts. The proposed method first converts image pixels to digital values and finds the nearest prime pixel values. Keys are generated by taking the difference between original and nearest prime pixels. Encryption is done by XORing pixels with keys and reversing the results, which are stored column-wise in a matrix. Decryption retrieves the matrix rows and performs reverse operations to recover the original image. The method aims to improve security by using mixed row/column retrieval and complementary operations during encryption and decryption.
Designing Hybrid Cryptosystem for Secure Transmission of Image Data using Bio...ranjit banshpal
The document outlines a proposed hybrid cryptosystem for secure transmission of image data using biometric fingerprints. It discusses problems with existing password and cryptographic techniques, and proposes a system that uses fingerprint biometrics to generate an encryption key, JPEG compression, and a secret fragment visible mosaic image method for embedding encrypted image data. The methodology section describes the tools and algorithms used, including SHA-256, AES, and JPEG. The implementation details section provides flow diagrams of the encryption and decryption processes.
Symmetric-Key Based Privacy-Preserving Scheme For Mining Support Countsacijjournal
In this paper we study the problem of mining support counts using symmetric-key crypto which is more
efficient than previous work. Consider a scenario that each user has an option (like or unlike) of the
specified product, and a third party wants to obtain the popularity of this product. We design a much more
efficient privacy-preserving scheme for users to prevent the loss of the personal interests. Unlike most
previous works, we do not use any exponential or modular algorithms, but we provide a symmetric-key
based method which can also protect the information. Specifically, our protocol uses a third party that
generates a number of matrixes as each user’s key. Then user uses these key to encrypt their data which is
more efficient to obtain the support counts of a given pattern.
11.biometric data security using recursive visual cryptographyAlexander Decker
This document summarizes a research paper on using recursive visual cryptography and biometric authentication to securely store biometric data. The paper proposes a scheme where secrets can be recursively embedded within image shares created by visual cryptography. Additionally, biometric authentication is used to securely access the shares. The scheme involves creating shares of secrets, embedding those shares as additional secrets within other shares, and authenticating users through iris recognition before revealing embedded secrets. This allows for multiple secrets to be hidden and revealed securely through the visual cryptography and biometric authentication methods combined.
This document summarizes a research paper on source anonymous message authentication in wireless sensor networks. It proposes a new authentication scheme called SAMA that is based on elliptic curve cryptography. SAMA allows nodes to transmit an unlimited number of messages without threshold problems. It generates a source anonymous authenticator for each message by hashing the message and using a private key to calculate a signature. Intermediate nodes can authenticate messages in a hop-by-hop manner by verifying signatures. The scheme is more efficient than previous polynomial-based approaches as it does not have threshold limitations and provides increased security and scalability.
Highly secure scalable compression of encrypted imageseSAT Journals
Abstract A highly secure scalable compression method for stream cipher encrypted images is described in this journal. The input image first undergoes encryption and then shuffling. This shuffling in the image pixels enhances the security. For shuffling, Henon map is used. There are two layers for the scalable compression namely base layer and enhancement layer. Base layer bits are produced by coding a series of non-overlapping patches of uniformly down sampled version of encrypted image. In the enhancement layer pixels are selected by random permutation and then coded. From all the available pixel samples an iterative multi scale technique is used to reconstruct the image and finally performs decryption. The proposed method has high security. Key Words: Encryption, Decryption, Shuffling, Scalable compression
A novel efficient multiple encryption algorithm for real time images IJECEIAES
In this study, we propose an innovative image encryption Techniques based on four different image encryption Algorithm. Our methodology integrates scrambling followed by Symmetric and Asymmetric Encryption Techniques, to make the image meaningless or disordered to enhance the ability to confront attack and in turn improve the security. This paper mainly focused on the multiple encryption Techniques with multiple keys on a single image by dividing it into four blocks. So instead of using one Encryption method a combination of four different Encryption Algorithm can make our image more secure. The Encryption is done first by using DNA as secret key, second by using RSA, third by DES and fourth by Chebyshev. The pros and cons for all the Encryption methods are discussed here. Proposed methodology can strongly encrypt the images for the purpose of storing images and transmitting them over the Internet. There are two major benefits related with this system. The first benefit is the use of Different Algorithm with different keys. The second benefit is that even though we are using four different Algorithm for a single image, the time taken for encryption and decryption is few seconds only. Our method is methodically checked, and it shows an exceptionally high level of security with very good image quality.
An efficient hash based steganography technique for text message using colIAEME Publication
This document describes an efficient hash-based steganography technique for hiding text messages in color images. It proposes using canny edge detection to identify edges in an image, then applying a hash function to embed text data in the RGB pixels of the image. The encoding process detects edges, generates a hash key, and uses the hash function to determine which pixel locations to modify to hide message bits. Decoding reverses this process to extract the hidden text. The technique aims to provide better security than LSB methods while supporting various image file formats like JPEG and BMP.
Adaptive key generation algorithm based on software engineering methodology IJECEIAES
The document presents an adaptive key generation algorithm based on software engineering techniques. The algorithm uses self-checking processes to detect faults in generated keys and ensure randomness. It generates 128-bit keys using a shift register and SIGABA technique. Keys are tested against NIST standards and regenerated if they fail. Case studies show the algorithm effectively produces random keys that pass the tests. The algorithm adopts software engineering processes to reliably generate secure keys resistant to attacks.
This document summarizes a research paper that proposes an enhanced AES algorithm for image steganography and encryption. It begins with an introduction to digital image processing, steganography and encryption. It then describes a proposed AES technique that improves on a modified AES method. The proposed technique involves 4 steps: key expansion, sub bytes modification, new shift rows, and mixing columns. Results show the proposed method takes less time with high quality encrypted images. The document concludes the technique improves security at two levels and helps reduce encryption time to some extent.
NeuroCrypto: C++ Implementation of Neural Cryptography with Rijndael CipherSagun Man Singh Shrestha
This work is the software implementation of the concept of neural cryptography, which is a communication of two tree parity machines for agreement on a common key over a public channel. This key is utilized to encrypt a sensitive message to be transmitted over an insecure channel using Rijndael cipher. This is a new potential source for public key cryptography schemes which are not based on number theoretic functions, and have small time and memory complexities. This paper will give a brief introduction to artificial neural networks, cryptography and its types, which will help explain why the two communicating terminals converge to a common key in neural cryptography and will also cover the Rijndael (AES) cipher. This paper is intended to show that such neural key exchange protocol and AES encryption can be practically implemented in a high-level programming language viz. C++, which could be further extended in higher-level applications. Both CLI and GUI implementations of the software created using Visual C++ (.NET framework) are presented.
The document proposes a novel secure scheme for computing the cosine similarity between two integer vectors with malicious adversaries. The scheme uses distributed ElGamal encryption and zero-knowledge proofs to privately compute the cosine coefficient between two parties' vector inputs while preserving privacy. Security analysis shows the scheme can resist attacks from malicious adversaries by simulating the ideal functionality using the encryption scheme and zero-knowledge proofs.
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...csandit
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which
are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active
research area, basically for supporting real time applications that are based upon interaction
between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve
more deterministic behavior of the network i.e. a stable path, so that information carried by the
network can be delivered in an uninterrupted fashion and for better resource utilization. In this
paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing
algorithm for MANETs with better route failure management and which will be highly adaptive
and energy efficient.
1. The document appears to be a list containing the names, identification numbers, and other identifying information for over 100 individuals.
2. It includes fields for names, last names, identification numbers (Cédula de Identidad), and other identifying details.
3. The names and identification numbers seem to be listed in no particular order across 5 pages.
This document welcomes the reader to the File Extension FYI Center. It provides information about file extensions and their associated file types. The File Extension FYI Center aims to be a helpful resource for understanding different file extensions and what programs can open certain file types.
Secure E-voting System by Utilizing Homomorphic Properties of the Encryption ...TELKOMNIKA JOURNAL
The use of cryptography in the e-voting system to secure data is a must to ensure the authenticity
of the data. In contrast to common encryption algorithms, homomorphic encryption algorithms had unique
properties that can perform mathematical operations against ciphertext. This paper proposed the use of
the Paillier and Okamoto-Uchiyama algorithms as two homomorphic encryption algorithms that have the
additional properties so that it can calculate the results of voting data that has been encrypted without
having to be decrypted first. The main purpose is to avoid manipulation and data falsification during vote
tallying process by comparing the advantages and disadvantages of each algorithm.
An Efficient Key Distribution Scheme for Wireless Sensor Networks using poly...Deepti Dohare
The document proposes a key distribution scheme for wireless sensor networks based on polynomials. It has the advantages of both probabilistic and deterministic schemes by providing full connectivity like deterministic schemes while also being resilient to node capture like probabilistic schemes. The scheme involves initially distributing symmetric polynomials to nodes. After establishing keys with neighbors, nodes erase their polynomials. To add new nodes, a set of polynomials is given and keys are established by exchanging encrypted values with neighbors. The scheme has low communication and space overhead compared to other approaches.
Visual Cryptography for biometric privacywaseem ahmad
visual cryptography for biometric privacy Preserving the privacy of digital biometric data (e.g., face images) stored in a central database has become of paramount importance. This work explores the possibility of using visual cryptography for imparting privacy to biometric data
IRJET-Survey of Highly Secured Methods for Image Transmission using Image Seg...IRJET Journal
This document summarizes a research paper that proposes a new method for securely transmitting images using image segmentation, permutation, and multi-encryption techniques. It begins with an abstract that outlines encrypting images to protect confidential data from unauthorized access. It then provides background on encryption and discusses how traditional text encryption is not suitable for large image files. The proposed method segments an image, permutes the pixels using random numbers, and repeats the encryption multiple times for security. It claims this approach provides strong encryption with minimal data loss or computational costs compared to other methods.
IRJET - Securing Computers from Remote Access Trojans using Deep Learning...IRJET Journal
This document presents a system that uses deep learning to detect Remote Access Trojans (RATs) with high accuracy. The proposed system has two operators - a host analyzer that monitors the host for irregularities, and a network analyzer that monitors network traffic for RAT patterns using an Artificial Neural Network algorithm. The system was tested on real datasets and achieved over 99.3% accuracy in detecting RAT files, with low false positive rates. Future work includes further reducing false positives and increasing the number of RAT samples to improve accuracy.
This document proposes a novel image cryptography method using nearest prime pixels for key generation. It begins by introducing image cryptography and its basic concepts. The proposed method first converts image pixels to digital values and finds the nearest prime pixel values. Keys are generated by taking the difference between original and nearest prime pixels. Encryption is done by XORing pixels with keys and reversing the results, which are stored column-wise in a matrix. Decryption retrieves the matrix rows and performs reverse operations to recover the original image. The method aims to improve security by using mixed row/column retrieval and complementary operations during encryption and decryption.
Designing Hybrid Cryptosystem for Secure Transmission of Image Data using Bio...ranjit banshpal
The document outlines a proposed hybrid cryptosystem for secure transmission of image data using biometric fingerprints. It discusses problems with existing password and cryptographic techniques, and proposes a system that uses fingerprint biometrics to generate an encryption key, JPEG compression, and a secret fragment visible mosaic image method for embedding encrypted image data. The methodology section describes the tools and algorithms used, including SHA-256, AES, and JPEG. The implementation details section provides flow diagrams of the encryption and decryption processes.
Symmetric-Key Based Privacy-Preserving Scheme For Mining Support Countsacijjournal
In this paper we study the problem of mining support counts using symmetric-key crypto which is more
efficient than previous work. Consider a scenario that each user has an option (like or unlike) of the
specified product, and a third party wants to obtain the popularity of this product. We design a much more
efficient privacy-preserving scheme for users to prevent the loss of the personal interests. Unlike most
previous works, we do not use any exponential or modular algorithms, but we provide a symmetric-key
based method which can also protect the information. Specifically, our protocol uses a third party that
generates a number of matrixes as each user’s key. Then user uses these key to encrypt their data which is
more efficient to obtain the support counts of a given pattern.
11.biometric data security using recursive visual cryptographyAlexander Decker
This document summarizes a research paper on using recursive visual cryptography and biometric authentication to securely store biometric data. The paper proposes a scheme where secrets can be recursively embedded within image shares created by visual cryptography. Additionally, biometric authentication is used to securely access the shares. The scheme involves creating shares of secrets, embedding those shares as additional secrets within other shares, and authenticating users through iris recognition before revealing embedded secrets. This allows for multiple secrets to be hidden and revealed securely through the visual cryptography and biometric authentication methods combined.
This document summarizes a research paper on source anonymous message authentication in wireless sensor networks. It proposes a new authentication scheme called SAMA that is based on elliptic curve cryptography. SAMA allows nodes to transmit an unlimited number of messages without threshold problems. It generates a source anonymous authenticator for each message by hashing the message and using a private key to calculate a signature. Intermediate nodes can authenticate messages in a hop-by-hop manner by verifying signatures. The scheme is more efficient than previous polynomial-based approaches as it does not have threshold limitations and provides increased security and scalability.
Highly secure scalable compression of encrypted imageseSAT Journals
Abstract A highly secure scalable compression method for stream cipher encrypted images is described in this journal. The input image first undergoes encryption and then shuffling. This shuffling in the image pixels enhances the security. For shuffling, Henon map is used. There are two layers for the scalable compression namely base layer and enhancement layer. Base layer bits are produced by coding a series of non-overlapping patches of uniformly down sampled version of encrypted image. In the enhancement layer pixels are selected by random permutation and then coded. From all the available pixel samples an iterative multi scale technique is used to reconstruct the image and finally performs decryption. The proposed method has high security. Key Words: Encryption, Decryption, Shuffling, Scalable compression
A novel efficient multiple encryption algorithm for real time images IJECEIAES
In this study, we propose an innovative image encryption Techniques based on four different image encryption Algorithm. Our methodology integrates scrambling followed by Symmetric and Asymmetric Encryption Techniques, to make the image meaningless or disordered to enhance the ability to confront attack and in turn improve the security. This paper mainly focused on the multiple encryption Techniques with multiple keys on a single image by dividing it into four blocks. So instead of using one Encryption method a combination of four different Encryption Algorithm can make our image more secure. The Encryption is done first by using DNA as secret key, second by using RSA, third by DES and fourth by Chebyshev. The pros and cons for all the Encryption methods are discussed here. Proposed methodology can strongly encrypt the images for the purpose of storing images and transmitting them over the Internet. There are two major benefits related with this system. The first benefit is the use of Different Algorithm with different keys. The second benefit is that even though we are using four different Algorithm for a single image, the time taken for encryption and decryption is few seconds only. Our method is methodically checked, and it shows an exceptionally high level of security with very good image quality.
An efficient hash based steganography technique for text message using colIAEME Publication
This document describes an efficient hash-based steganography technique for hiding text messages in color images. It proposes using canny edge detection to identify edges in an image, then applying a hash function to embed text data in the RGB pixels of the image. The encoding process detects edges, generates a hash key, and uses the hash function to determine which pixel locations to modify to hide message bits. Decoding reverses this process to extract the hidden text. The technique aims to provide better security than LSB methods while supporting various image file formats like JPEG and BMP.
Adaptive key generation algorithm based on software engineering methodology IJECEIAES
The document presents an adaptive key generation algorithm based on software engineering techniques. The algorithm uses self-checking processes to detect faults in generated keys and ensure randomness. It generates 128-bit keys using a shift register and SIGABA technique. Keys are tested against NIST standards and regenerated if they fail. Case studies show the algorithm effectively produces random keys that pass the tests. The algorithm adopts software engineering processes to reliably generate secure keys resistant to attacks.
This document summarizes a research paper that proposes an enhanced AES algorithm for image steganography and encryption. It begins with an introduction to digital image processing, steganography and encryption. It then describes a proposed AES technique that improves on a modified AES method. The proposed technique involves 4 steps: key expansion, sub bytes modification, new shift rows, and mixing columns. Results show the proposed method takes less time with high quality encrypted images. The document concludes the technique improves security at two levels and helps reduce encryption time to some extent.
NeuroCrypto: C++ Implementation of Neural Cryptography with Rijndael CipherSagun Man Singh Shrestha
This work is the software implementation of the concept of neural cryptography, which is a communication of two tree parity machines for agreement on a common key over a public channel. This key is utilized to encrypt a sensitive message to be transmitted over an insecure channel using Rijndael cipher. This is a new potential source for public key cryptography schemes which are not based on number theoretic functions, and have small time and memory complexities. This paper will give a brief introduction to artificial neural networks, cryptography and its types, which will help explain why the two communicating terminals converge to a common key in neural cryptography and will also cover the Rijndael (AES) cipher. This paper is intended to show that such neural key exchange protocol and AES encryption can be practically implemented in a high-level programming language viz. C++, which could be further extended in higher-level applications. Both CLI and GUI implementations of the software created using Visual C++ (.NET framework) are presented.
The document proposes a novel secure scheme for computing the cosine similarity between two integer vectors with malicious adversaries. The scheme uses distributed ElGamal encryption and zero-knowledge proofs to privately compute the cosine coefficient between two parties' vector inputs while preserving privacy. Security analysis shows the scheme can resist attacks from malicious adversaries by simulating the ideal functionality using the encryption scheme and zero-knowledge proofs.
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...csandit
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which
are interconnected by multi hop wireless paths. Providing QoS support in MANETs is an active
research area, basically for supporting real time applications that are based upon interaction
between the routing scheme and QoS provisioning. The goal of QoS aware routing is to achieve
more deterministic behavior of the network i.e. a stable path, so that information carried by the
network can be delivered in an uninterrupted fashion and for better resource utilization. In this
paper we have developed AMTR, a new ant based QoS aware on-demand multipath routing
algorithm for MANETs with better route failure management and which will be highly adaptive
and energy efficient.
1. The document appears to be a list containing the names, identification numbers, and other identifying information for over 100 individuals.
2. It includes fields for names, last names, identification numbers (Cédula de Identidad), and other identifying details.
3. The names and identification numbers seem to be listed in no particular order across 5 pages.
This document welcomes the reader to the File Extension FYI Center. It provides information about file extensions and their associated file types. The File Extension FYI Center aims to be a helpful resource for understanding different file extensions and what programs can open certain file types.
Hybreed. Plataforma de desarrollo de aplicaciones móviles híbridas. Descripci...atSistemas
Este documento describe Hybreed, una plataforma de desarrollo de aplicaciones móviles híbridas. Hybreed permite crear una aplicación que funciona en múltiples sistemas operativos utilizando tecnologías web. La arquitectura de Hybreed consta de una capa web, un contenedor y una capa nativa. Hybreed también soporta la convergencia entre dispositivos móviles y televisores inteligentes.
Dans la vie trépidante aujourd’hui, le Vietnamien en général et le Hanoïen en particulier n’apprécient pas beaucoup des repas de luxe dans de grands restaurants. Pour eux, des plats légers mais typiques sont plus attrayants et le « Bun dau mam tom » est le meilleur choix.
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive functioning. Exercise causes chemical changes in the brain that may help protect against mental illness and improve symptoms.
Tugas geografi kelompok 1 kelas x a Jagat Rayaimamwahyu
Tata sura terdiri dari matahari dan objek-objek lain yang mengelilinginya. Terdapat berbagai hipotesis tentang asal muasal pembentukan tata surya, seperti hipotesis kabut, planetesimal, tidal, dan Kuper. Planet-planet mengelilingi matahari dengan gerakan revolusi sesuai hukum-hukum Kepler dan Newton.
A NOVEL TECHNIQUE TO DETECT INTRUSION IN MANETIJNSA Journal
In this paper a novel technique has been proposed for intrusion detection in MANET, where agents are
fired from a node for each node randomly and detect the defective nodes. Detection is based on triangular
encryption technique (TE)[9,10], and AODV[1,2,3,8] is taken as routing protocol. The scheme is an
‘Agent’ based intrusion detection system. This technique is applied on two types of defective nodes namely
packet sinking and black hole attack. For simulation purpose we have taken NS2 (2.33) and three type of
parameters are considered. These are number of nodes, percentage of node mobility and type of defective
nodes. For analysis purpose 20, 30, 30, 40, 50 and 60 nodes are taken with variability. Percentage of
defectiveness as 10%, 20%, 30% and 40%.Packet sink and black hole attack are considered as
defectiveness of nodes. We have considered generated packets, forward packets, average delay and drop
packets as comparisons and performance analysis parameters.
A NOVEL TECHNIQUE TO DETECT INTRUSION IN MANETIJNSA Journal
In this paper a novel technique has been proposed for intrusion detection in MANET, where agents are fired from a node for each node randomly and detect the defective nodes. Detection is based on triangular encryption technique (TE)[9,10], and AODV[1,2,3,8] is taken as routing protocol. The scheme is an ‘Agent’ based intrusion detection system. This technique is applied on two types of defective nodes namely packet sinking and black hole attack. For simulation purpose we have taken NS2 (2.33) and three type of parameters are considered. These are number of nodes, percentage of node mobility and type of defective nodes. For analysis purpose 20, 30, 30, 40, 50 and 60 nodes are taken with variability. Percentage of defectiveness as 10%, 20%, 30% and 40%.Packet sink and black hole attack are considered as defectiveness of nodes. We have considered generated packets, forward packets, average delay and drop packets as comparisons and performance analysis parameters.
Network Security Enhancement in WSN by Detecting Misbehavioural Activity as C...ijtsrd
This system proposes a centralized system for replica identification. The network is divided into segments and an inspection node is chosen for each segment. Inspection node identifies a clone node by checking the nodes ID and cryptographic key. In this process, Chord algorithm is used to detect the clone node, every node is assigned with random key, before it transmits the data it has to give its key which would be verified by the witness node. If same key is given by another node then the witness node identifies the cloned node. Here every node only needs to know the neighbor list containing all neighbor IDs and its location. In this scheme, Energy Efficient Clustering Protocol EECP protocol is used to implement different energy saving methods. Dr. B. R. Tapas Bapu | Hemavathi S U | Poonkuzhali K | Sweety J "Network Security Enhancement in WSN by Detecting Misbehavioural Activity as Copy Cat Nodes" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-4 , June 2020, URL: https://www.ijtsrd.com/papers/ijtsrd31257.pdf Paper Url :https://www.ijtsrd.com/engineering/computer-engineering/31257/network-security-enhancement-in-wsn-by-detecting-misbehavioural-activity-as-copy-cat-nodes/dr-b-r-tapas-bapu
The document describes the Tree Based Itinerary Design (TBID) algorithm for wireless sensor networks. The TBID algorithm partitions the sensor network area around the processing element into concentric zones. It then constructs itineraries for multiple mobile agents to efficiently collect and aggregate data from the sensor nodes. The algorithm builds trees connecting sensors in each zone and determines low-cost traversal orders for the mobile agents. Experimental results show that the aggregation time increases as the number of sensors or zones increases, but decreases as more mobile agents are used.
Mobile ad hoc network (MANET) is an autonomous system of mobile nodes. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These cause extra challenges on security. In this paper, evaluation of prominent on-demand routing protocol i.e. AODV,MAODV,RAODV has been done by varying the network size. An effort has been carried out to do the performance evaluation of these protocols using random way point model. The simulator used is NS 2.34. The performance of either protocol has been studied by using a self created network scenario with respect to pause time.
IRJET- Heterogeneous Network Based Intrusion Detection System in Mobile Ad Ho...IRJET Journal
The document proposes a heterogeneous network based intrusion detection system for mobile ad hoc networks. It describes a probabilistic model that uses cooperation between intrusion detection systems among neighboring nodes to reduce their individual active time and conserve energy. Specifically, it proposes using a Heterogeneous Least Degree K method (HLDK) where each node determines the minimum monitoring probability in the network based on the degrees of its neighbors. This approach aims to achieve energy efficiency while maintaining a desired security level in heterogeneous networks consisting of nodes with varying capabilities. Simulation results show that using HLDK can significantly reduce the energy consumption and computational cost of running intrusion detection systems on nodes compared to having them active at all times.
IRJET - Network Traffic Monitoring and Botnet Detection using K-ANN AlgorithmIRJET Journal
This document discusses a system for network traffic monitoring and botnet detection using the K-ANN (Kohonen Artificial Neural Network) algorithm. The system aims to address challenges in analyzing large amounts of network traffic data in real-time to accurately detect abnormal network activities and security threats. It involves collecting network packets using packet capture libraries, filtering the packets using K-ANN to detect botnet behavior, and notifying administrators of any detected threats. The system architecture and K-ANN algorithm are described. Results show the system was able to detect a SYN flood attack based on analyzing packet attributes. Future work will involve detecting additional types of network threats.
Filtering Schemes for Injected False Data in WsnIOSR Journals
This document summarizes and compares several en-route filtering schemes that aim to detect and drop false data reports injected by compromised nodes in wireless sensor networks. It first describes statistical en-route filtering (SEF), commutative cipher based en-route filtering (CCEF), secure ticket-based en-route filtering (STEF), and dynamic en-route filtering (DEF). It then focuses on the bandwidth efficient cooperative authentication (BECAN) scheme, and proposes adding a hybrid authentication scheme (HAS) based on RSA encryption to increase BECAN's security by preventing compromised nodes from gathering enough signatures to inject false reports. The document implements this approach in NS2 and results show it has lower energy consumption and higher throughput than existing methods
Elliptic Curve Cryptography Based Data Transmission against Blackhole Attack ...IJECEIAES
This document discusses securing data transmission against blackhole attacks in mobile ad hoc networks (MANETS) using elliptic curve cryptography (ECC) and the Adhoc On Demand Multipath Distance Vector (AOMDV) routing protocol. It implements ECC to encrypt data packets at the source node before transmission over AOMDV's multiple paths. The performance of this secured approach is analyzed under varying numbers of blackhole attacker nodes based on metrics like average throughput, packet delivery ratio, average end-to-end delay, and normalized routing load. Simulation results show the encrypted packets being transferred between nodes via AOMDV are protected against blackhole attacks.
This document discusses constrained passive tracking using wireless sensor networks. It begins with an introduction to wireless sensor networks and target tracking. It then describes the proposed system for passive tracking using a wireless sensor network. The system includes initializing the network, forming clusters using K-medoids clustering, creating an object to track, determining the sensor node nearest to the object, gathering information from sensors to the base station, and analyzing the results. It discusses the K-medoids clustering and Kalman filtering algorithms used for clustering and tracking, respectively. The document provides an example of applying the K-medoids algorithm to cluster a sample dataset.
IRJET- Detection and Localization of Spoofing Attackers in Wireless Sensor Ne...IRJET Journal
This document proposes a system to detect and localize spoofing attackers in wireless sensor networks using intrusion detection systems and rerouting. It begins by describing how wireless spoofing attacks work and the issues they cause. The proposed system uses an IDS to detect attacked nodes by monitoring each node's transmission power and energy levels. If anomalies are found, the IDS alerts all nodes and the source node drops the packet. It then uses an AOMDV routing algorithm to provide alternative routes that do not include the attacked node, improving security and efficiency. The document outlines the system architecture, modules, and methodologies like IDS monitoring and AOMDV's creation of multiple disjoint paths to effectively counter wireless spoofing attacks.
IRJET- Enhanced ID based Data Aggregation and Detection Against Sybil Attack ...IRJET Journal
This document summarizes a research paper that proposes a Challenge-Response Authentication Protocol (CRAP) to detect Sybil attacks in wireless sensor networks. The CRAP generates unique keys for each transmission to provide encrypted communication. It is used to prevent Sybil attacks where an attacker steals node identities during data transmission. The performance of the detection scheme is evaluated using detection ratio. The proposed CRAP involves three phases: 1) nodes are selected and grouped, 2) two nearby nodes transmit packets to detect collisions indicating Sybil nodes, 3) if no hop is detected between Sybil identities, the nodes are confirmed to be under attack. The scheme is analyzed using performance metrics like packet delivery ratio, energy efficiency, and attack detection ratio.
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.
Detection of Various Attacks using Zero Knowledge Protocol in Wireless Securityijceronline
The security mechanism are not used directly in wireless sensor networks compare to wired networks, there is no user control and insufficient energy resources. In wireless environment, proposing the scheme of detection of distributed sensor cloning attacks and Zero knowledge protocols (ZKP) are used to verifying authenticity of the sender sensor nodes. Cloning attack is concentrate on by attaching fingerprint which is unique that depends on the set of neighboring nodes and itself. Every message contains a finger print which sensor node sends.ZKP is used to avoid man in the middle attack and reply attacks from the important cryptographic information in wireless networks.
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.
BLACKLIST MANAGEMENT USING A VERIFICATION REPORT TO IMPROVE THE ENERGY EFFICI...ijwmn
Recently, the applications scope of Wireless Sensor Networks (WSNs) has been broadened. WSN communication security is important because sensor nodes are vulnerable to various security attacks when deployed in an open environment. An adversary could exploit this vulnerability to inject false reports into the network. En-route filtering techniques have been researched to block false reports. The CFFS scheme
filters the false report by collaboratively validating the report by clustering the nodes. However, CFFS is not considered effective against repetitive attacks. Repeated attacks have a significant impact on network lifetime. In this paper, we propose a method to detect repetitive attacks with cluster-based false data
filtering and to identify the compromised nodes and quickly block them. The proposed scheme uses fuzzy logic to determine the distribution of additional keys according to the network conditions, thereby improving energy efficiency.
Evaluation of network intrusion detection using markov chainIJCI JOURNAL
Day today life internet threat has been increased significantly. There is a need to develop model in order to
maintain security of system. The most effective techniques are Intrusion Detection System (IDS).The
purpose of intrusion system through the security devices detect and deal with it. In this paper, a
mathematical approach is used effectively to predict and detect intrusion in the network. Here we discuss
about two algorithms ‘K-Means + Apriori’, a method which classify normal and abnormal activities in
computer network. In K-Means process, it partitions the training set into K-clusters using Euclidean
distance and introduce an outlier factor, then it build Apriori Algorithm to prune the data by removing
infrequent data in the database. Based on defined state the degree of incoming data is evaluated through
the experiment using sample DARPA2000 dataset, and achieves high detection performance in level of
attack in stages.
Energy Efficinet Intrusion Detection System in mobile ad-hoc networksIJARIIE JOURNAL
This document summarizes a proposed energy efficient intrusion detection system for mobile ad-hoc networks. It begins with an introduction to intrusion detection systems and mobile ad-hoc networks. It then discusses related work on intrusion detection in mobile ad-hoc networks. The proposed system uses an "impact factor" calculation to select cluster heads in an energy-efficient manner while preventing selfish behavior. Cluster heads run the intrusion detection system using a watchdog method to detect misbehaving nodes. Simulation results show that forming clusters reduces energy consumption compared to all nodes running intrusion detection independently.
Node Legitimacy Based False Data Filtering Scheme in Wireless Sensor NetworksEswar Publications
False data injection attack is a serious threat to wireless sensor network. In this paper, a node legitimacy based false data filtering scheme (NLFS) is proposed. NLFS verifies not only message authentication codes (MACs) contains in reports, but also the legitimacy of nodes that endorse the report. The verification guarantees that compromised nodes from different geographical areas cannot collude to inject false data, which makes NLFS has a high tolerance of compromised nodes. In addition, NLFA only utilizes the relationships between node IDs to verify the legitimacy of nodes without other software or hardware overhead. Simulation results show that NLFS can filter 95% false reports within three hops and is resilience to an increasing number of compromised nodes.
IRJET- Review on Network Intrusion Detection using Recurrent Neural Network A...IRJET Journal
This document presents a review of using recurrent neural networks for network intrusion detection. It begins with an introduction to intrusion detection systems and the types of attacks they aim to detect. It then discusses previous research on machine learning approaches for intrusion detection, including the use of autoencoders, support vector machines, and other classifiers. The proposed approach uses a recurrent neural network for feature selection and classification of network data. The framework involves data collection, preprocessing including feature selection, training the recurrent neural network classifier, and then using the trained model to detect attacks in new data. Experimental results on benchmark intrusion detection datasets are presented and compared to other machine learning methods.
Similar to Agent based intrusion detection system in manet (20)
FREE A4 Cyber Security Awareness Posters-Social Engineering part 3Data Hops
Free A4 downloadable and printable Cyber Security, Social Engineering Safety and security Training Posters . Promote security awareness in the home or workplace. Lock them Out From training providers datahops.com
Dandelion Hashtable: beyond billion requests per second on a commodity serverAntonios Katsarakis
This slide deck presents DLHT, a concurrent in-memory hashtable. Despite efforts to optimize hashtables, that go as far as sacrificing core functionality, state-of-the-art designs still incur multiple memory accesses per request and block request processing in three cases. First, most hashtables block while waiting for data to be retrieved from memory. Second, open-addressing designs, which represent the current state-of-the-art, either cannot free index slots on deletes or must block all requests to do so. Third, index resizes block every request until all objects are copied to the new index. Defying folklore wisdom, DLHT forgoes open-addressing and adopts a fully-featured and memory-aware closed-addressing design based on bounded cache-line-chaining. This design offers lock-free index operations and deletes that free slots instantly, (2) completes most requests with a single memory access, (3) utilizes software prefetching to hide memory latencies, and (4) employs a novel non-blocking and parallel resizing. In a commodity server and a memory-resident workload, DLHT surpasses 1.6B requests per second and provides 3.5x (12x) the throughput of the state-of-the-art closed-addressing (open-addressing) resizable hashtable on Gets (Deletes).
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/temporal-event-neural-networks-a-more-efficient-alternative-to-the-transformer-a-presentation-from-brainchip/
Chris Jones, Director of Product Management at BrainChip , presents the “Temporal Event Neural Networks: A More Efficient Alternative to the Transformer” tutorial at the May 2024 Embedded Vision Summit.
The expansion of AI services necessitates enhanced computational capabilities on edge devices. Temporal Event Neural Networks (TENNs), developed by BrainChip, represent a novel and highly efficient state-space network. TENNs demonstrate exceptional proficiency in handling multi-dimensional streaming data, facilitating advancements in object detection, action recognition, speech enhancement and language model/sequence generation. Through the utilization of polynomial-based continuous convolutions, TENNs streamline models, expedite training processes and significantly diminish memory requirements, achieving notable reductions of up to 50x in parameters and 5,000x in energy consumption compared to prevailing methodologies like transformers.
Integration with BrainChip’s Akida neuromorphic hardware IP further enhances TENNs’ capabilities, enabling the realization of highly capable, portable and passively cooled edge devices. This presentation delves into the technical innovations underlying TENNs, presents real-world benchmarks, and elucidates how this cutting-edge approach is positioned to revolutionize edge AI across diverse applications.
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
A Comprehensive Guide to DeFi Development Services in 2024Intelisync
DeFi represents a paradigm shift in the financial industry. Instead of relying on traditional, centralized institutions like banks, DeFi leverages blockchain technology to create a decentralized network of financial services. This means that financial transactions can occur directly between parties, without intermediaries, using smart contracts on platforms like Ethereum.
In 2024, we are witnessing an explosion of new DeFi projects and protocols, each pushing the boundaries of what’s possible in finance.
In summary, DeFi in 2024 is not just a trend; it’s a revolution that democratizes finance, enhances security and transparency, and fosters continuous innovation. As we proceed through this presentation, we'll explore the various components and services of DeFi in detail, shedding light on how they are transforming the financial landscape.
At Intelisync, we specialize in providing comprehensive DeFi development services tailored to meet the unique needs of our clients. From smart contract development to dApp creation and security audits, we ensure that your DeFi project is built with innovation, security, and scalability in mind. Trust Intelisync to guide you through the intricate landscape of decentralized finance and unlock the full potential of blockchain technology.
Ready to take your DeFi project to the next level? Partner with Intelisync for expert DeFi development services today!
In the realm of cybersecurity, offensive security practices act as a critical shield. By simulating real-world attacks in a controlled environment, these techniques expose vulnerabilities before malicious actors can exploit them. This proactive approach allows manufacturers to identify and fix weaknesses, significantly enhancing system security.
This presentation delves into the development of a system designed to mimic Galileo's Open Service signal using software-defined radio (SDR) technology. We'll begin with a foundational overview of both Global Navigation Satellite Systems (GNSS) and the intricacies of digital signal processing.
The presentation culminates in a live demonstration. We'll showcase the manipulation of Galileo's Open Service pilot signal, simulating an attack on various software and hardware systems. This practical demonstration serves to highlight the potential consequences of unaddressed vulnerabilities, emphasizing the importance of offensive security practices in safeguarding critical infrastructure.
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
Skybuffer SAM4U tool for SAP license adoptionTatiana Kojar
Manage and optimize your license adoption and consumption with SAM4U, an SAP free customer software asset management tool.
SAM4U, an SAP complimentary software asset management tool for customers, delivers a detailed and well-structured overview of license inventory and usage with a user-friendly interface. We offer a hosted, cost-effective, and performance-optimized SAM4U setup in the Skybuffer Cloud environment. You retain ownership of the system and data, while we manage the ABAP 7.58 infrastructure, ensuring fixed Total Cost of Ownership (TCO) and exceptional services through the SAP Fiori interface.
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slackshyamraj55
Discover the seamless integration of RPA (Robotic Process Automation), COMPOSER, and APM with AWS IDP enhanced with Slack notifications. Explore how these technologies converge to streamline workflows, optimize performance, and ensure secure access, all while leveraging the power of AWS IDP and real-time communication via Slack notifications.
2. 202 Computer Science & Information Technology (CS & IT)
Based on the sources of the audit information used by each IDS, the IDSs may be classified into
Host-base IDSs: In this model IDS detects attack against a single host. IDS get audit information
from host audit trails.
Distributed IDSs. In this model, an IDS agent runs at each mobile node and performs local data
collection and local detection, whereas cooperative detection and global intrusion response can be
triggered when a node reports an anomaly
Network-based IDSs: In this model IDS detects attack in network,. System uses network traffic as
audit information source Mobile agent is a software agent which can move through the network
from host to host. For a large scale network it can move to the node and collect the audit data, and
information and can perform the specific task to the designation.
In this paper A Novel Technique for Intrusion Detection System has been proposed in MANET.
An agent has been triggered randomly from a node which traverses all nodes sequentially one
after another till the end of nodes associated with the cell in a round. It computes the security
parameters and finds the conflicted activities if any which reported as malicious activities of the
node.
Section II of the paper deals with the proposed detection technique. Simulation environment has
been presented in section III. Section IV deals with results and simulations. Conclusion is drawn
in section V and conclusion is given at end.
2. PROPOSED TECHNIQUE
The In proposed method AODV [1, 2, 3, 8] is taken as routing protocol. A mobile agent triggered
from a node of the network traverse all nodes intern one after another, monitor the activity of the
nodes for its malicious behavior if exist, detect the node as malicious through an agent termed as
‘Idect’. As security measure each node computes some information as source information of the
node through an agent at triggering nodes followed by encryption using an algorithm called
Triangular Encryption [TE][9,10] and encapsulate the information within the packet which
traverse in the network. On the other hand the agent ‘Idect ‘randomly triggered its process of
detection in randomly selected node compute the information, decode the encrypted information
and compare for authentication. If this authentication fails, the node is detected as malicious and
the information is forwarded to its neighbors accordingly. The detection of malicious node is
guided through an encryption process where various parameters of nodes normally affected
through intrusion are taken as input and a triangular based encryption is done in of these
parameters to capsule the parameters in each node. The process of encryption is described is as
follows. Consider a block S= s0
0 s0
1 s0
2 s0
3 s0
4 s0
5 .................. s0
n-2 s0
n-1 of size n bits , where s0
1 = 0
or 1 for 0<=i<=(n-1).Starting from MSB (s0
0) and the next to MSB (s0
1), bits are pair-wise
XNOred, so that the first intermediate sub-stream S1 =
S= s1
0 s1
1 s1
2 s1
3 s1
4 s1
5 .............. s1
n-2 s1
n-1 is
generated consisting of (n-1) bits, where s1
j = s0
j (XNOR) s0
j+1 for 0<=j<=n-2.The first
intermediate sub stream S1
is also pair-wise XNORed to generate S2
=s 2
0 s2
1 s2
2 s2
3 s2
4 s2
5… s2
n-2
s2
n-1, which is the second intermediate sub-stream of length (n-2). This process continues (n-1)
times to ultimately generate Sn-1
=Sn-1
0, which is a single bit only. Thus the size of the first
intermediate sub-stream is one bit less than the source sub-stream; the size of each of the
intermediate sub-stream starting from the second one is one bit less than that of the sub-stream
3. Computer Science & Information Technology (CS & IT) 203
wherefrom it was generated; and finally the size of the final sub-stream. Figure 1 shows the
generation of the intermediate sub-stream Sj+1
= sj+1
0 sj+1
1 sj+1
2 sj+1
3 sj+1
4 sj+1
5… sj+1
n-(j+2) from the
previous intermediate sub-stream Sj
= sj
0 sj
1 sj
2 sj
3 sj
4 sj
5… sj
n-(j-1). The formation of the triangular
shape for the source sub-stream S= s0
0 s0
1 s0
2 s0
3 s0
4 s0
5… s0
n-2 s0
n-1 is shown in figure 1.
S= s0
0 s0
1 s0
2 s0
3 s0
4 s0
5 .................. s0
n-2 s0
n-1
S1 =
s1
0 s1
1 s1
2 s1
3 s1
4 .............. s1
n-2
S2
= s 2
0 s2
1 s2
2 s2
3 … s2
n-3
.................................
S
n-2
= s n-2
0 s n-2
1
Sn-1=
s n-1
0
Fig.1. formation of triangle in TE
On generating this triangle various possibilities are there to encode. For the propose of the
present scheme, all MSBs are taken in order including source bit to form the encrypted bit. This
process is applied to various sensitive parameters of a node where attack may occur and the same
are encapsulated for detection by the agent ‘Idect’. When the agent triggered on a node for
intrusion detection, it will take values of same parameters from the node under scanner and again
encrypt the parameters using Triangular Encryption (TE)[9,10] through same option of
encryptions. Then it compared the values of encrypted parameters with the encapsulated
parameters for authentications. If the encapsulate parameters and computed parameters obtained
by ‘Idect’ are matched then the node is nonmalicious otherwise it designate the node as malicious
and mark the node accordingly. The graphical view of an ideal ‘Idect’ is given in figure 2.
Fig. 2. Graphical view of IDS technique
3. SIMULATION ENVIRONMENT
Network Simulator 2 (NS2.33) [6][7] is taken as a tool for simulation purpose. The Network
Simulator 2 is a tool of discrete event simulation in the network, and capable of simulating
various types of networks. NS2 [6, 7] consists of two languages, C++ and Otcl. C++ defines the
internal mechanism of the simulation object, and Otcl set up simulation by assembling and
configuring objects as well as scheduling discrete events. To simulate NS2, a (.tcl) script file is
required. After simulation it creates two types of file, one is trace file (tr) and another is (.nam)
file. Trace file is used for calculation and statistical analysis, and that of .nam file is used to
visualize the simulation process.
4. 204 Computer Science & Information Technology (CS & IT)
4. SIMULATIONS AND RESULTS
For the purpose of simulation five parameters are taken as common in each case. These are given
in table 1.
Table 1: Parameter (fixed) of the simulation in ‘Idect’
Routing protocols AODV
Percentage of node mobility 40 %
Maximum packets in IFQ 50
Speed of the nodes 100 m/s
Time of simulation 10 sec
Variable parameters are
i. Number of nodes (20, 30, 40, 50, 60)
ii. Percentage of malicious node (0%,10%, 20%, 30% 40%)
Snapshot of simulation output is given in figure 3 where outputs of various parameters are shown
in details
Fig. 3. Snapshot of simulation in terminal
Comparison of performance is measured with the following parameters.
A. Generated packets.
B. Forward packets.
C. Average delay.
D. Drop packets.
Results are taken considering the variable parameter like number of nodes, and percentage of
malicious node. Numbers of nodes are taken 20, 30, 40, 50 and 60. And percentage of node
mobility is taken as 0%, 10%, 20%, 30%, and 40%.
A. Generated of packets
Comparison of generated packets is given table 2 and figure 4.
5. Computer Science & Information Technology (CS & IT) 205
Table 2. Generated packets through simulation of ‘Idect’
Percentage of
Malicious
Node 20 Node 30 Node 40 Node 50 Node 60
0% 1837 2218 4110 4967 6360
10% 1735 2204 4110 5126 6518
20 % 1453 2064 3622 4780 6391
30 % 644 2132 4144 4847 6871
40 % 1287 6568 6568 6568 6568
Fig.4. Comparison of number of generated packets
From table 2 and figure 4 it is seen that when the percentage of malicious node is increased, the
rate of packet generation is increased. When 40 % nodes are malicious the packet generation is
maximum.
B. Forward packets
Comparison of generated packets is given table 3 and figure 5 from where it Is seen that when
number of malicious node is increasing number of forwarded packets are decresing.
Table 3. Number forward packets in “Idect’
Percentage of Malicious Node 20 Node 30 Node 40 Node 50 Node 60
0 895 572 1129 377 338
10 861 405 2129 297 356
20 574 402 684 212 356
30 86 347 862 215 125
40 428 402 349 109 79
Fig.5 Comparison of forward packets
6. 206 Computer Science & Information Technology (CS & IT)
That is, rate of forwarding packets are decreasing with the increasing of percentage of malicious
node. When 20 nodes are taken for simulation with 10% malicious the system behaves
abnormally.
C. Average Delay
Comparison of Average Delray is given in the table 4 and figure 6 from where it is clear that
delay is decreasing on increasing number of nodes as well as malicious nodes.
Table 4. Average delay (sec) in Simulations of ‘Idect’.
Percentage of Malicious Node 20 Node 30 Node 40 Node 50 Node 60
0 0.686839 0.419547 0.572877 0.272646 0.351286
10 0.302901 0.256601 0.572877 0.226283 0.344115
20 0.47166 0.281686 0.227599 0.180511 0.3649
30 0.600703 0.258949 0.424504 0.238707 0.105786
40 0.273356 0.283779 0.260255 0.329716 0.320199
Figure 6 Comparison of Avg. delay (sec.)
From table 4 and figure 6 we can see that behavior of graph is abnormal here. It may be for node
mobility because 40% nodes are moving with the speed of 100m/s, and as well as for other
parameters.
D. Drop packets
Comparison of Drop Packets is given in the table 5 and figure 7.
Table 5. Number of drop packets in ‘Idect’
Percentage of
Malicious
Node 20 Node 30 Node 40 Node 50 Node 60
0 2314 3881 5835 8454 11748
10 2364 4083 5835 8767 11678
20 2463 4087 6246 8732 11706
30 2195 4105 6332 8788 12581
40 2555 4066 8387 8821 12483
7. Computer Science & Information Technology (CS & IT) 207
Figure 7. Comparison graphs of drop packets in ‘Idect’.
From the above table 5 and figure 7 we can see that rate of drop packets are increasing with
respect to percentage of malicious node. The rates of drop packets are slightly increasing because
AODV broadcast packets are drop rapidly at every node due to node mobility. Source node is
sending packets very fast to other nodes so it is unable to control all the packets, as a result
maximum packets are drop at source node.
5. CONCLUSIONS
In this paper we have introduced a method and technique to detect malicious node using mobile
Agent (‘Idect’). Compare and analysis of the performance at various parameters in AODV
routing protocol are also done extensively. It is seen from the simulation that in some cases the
network behave abnormally. The reason of abnormality is due to 40 % nodes are moving with
high speed (100m/s). Only source node is firing the secure agent ‘Idect’ to every node with a high
frequency so it is unable to control all the packets, as a result it drop many packets. The technique
proposed are very simple for detection of malicious node as the ‘Idect’ agent visit all nodes
randomly across all nodes of the network irrespective of the topologies and thus it is an agent
based intrusion detection system.
ACKNOWLEDGMENTS
The authors expressed deep sense of gratuity towards the Dept of CSE University of Kalyani and
the PURSE Project of DST, Govt. of India, from here the computational recourses are used for
the research..
REFERENCES
[1] C.Siva Ram Murthy and B.S manoj” Ad Hoc Wireless networks architecture and protocols” Pearson
education india 2005.
[2] Prasant Mohapatra, Srikanth Krishnamurthy “Ad hoc networks: technologies and protocols” Springer
2005
[3] Chai-Keong Toh “Ad hoc mobile wireless networks: protocols and systems ” Prentice Hall.
[4] Amitava Mishra “Security and Quality of Service in Adhoc Wireless Network”, Cambridge
University Press .
[5] Sarkar, S.K., Basavaraju, T.G., Puttamadappa, C.: Ad hoc Mobile Wireless Networks: Principles,
Protocols and Applications. Auerbach Publications (2008)
[6] Teerawat Issariyakul, Ekram Hossain “Introduction to Network Simulator NS2” Springer (2009)
[7] Marc Greis' Tutorial http://www.isi.edu/nsnam/ns/tutorial/
8. 208 Computer Science & Information Technology (CS & IT)
[8] Mubashir Husain Rehmani, Sidney Doria, and Mustapha Reda Senouci “A Tutorial on he
Implementation of Ad-hoc On Demand Distance Vector (AODV) Protocol in Network Simulator
(NS-2)”
[9] Mandal, J. K.,Dutta, S.,Mal, S., “A Multiplexing Triangular Encryption Technique – A Move
Towards Enhancing Security in E-Commerce, Proc. of Conference of Computer Association of
Nepal, December, 2001.
[10] Mandal, J. K., Chatterjee R, “Authentication of PCSs with Triangular Encryption Technique”,
Proceedings of 6th Philippine Computing Science Congress(PCSC 2006), Ateneo de Manila
University, Manila, Philippine, March 28-29,2006.
[11] Dokurer, S. Ert, Y.M. ; Acar, C.E.” Performance analysis of ad-hoc networks under black hole
attacks”, Proceedings. IEEE. pp. 148 – 153, 2007
[12] Perkins, C.E., Royer, E.M., "Ad-hoc on-demand distance vector routing"
,www.cs.ucsb.edu/~ravenben/classes/papers/aodv-wmcsa99.pdf
[13] Deng, H., Li, W., Agrawal, D., "Routing Security in Wireless Ad Hoc Networks" IEEE
Communication Magazine ( October 2002) pp. 70-75
[14] Al-Shurman, M., Yoo, S., Park, S., "Black hole Attack in Mobile Ad Hoc Networks", ACM
Southeast Regional Conference (2004) pp. 96-97
[15] Mishra, A., Nadkarni, K., Patcha, A., "Intrusion detection in wireless ad-hoc networks", IEEE
Wireless Communications, February 2004, pp. 48-60.