The secret sharing is a method to protect confidentiality and integrity of the secret messages by distributing the message shares into several recipients. The secret message could not be revealed unless the recipients exchange and collect shares to reconstruct the actual message. Even though the attacker obtain shares shadow during the share exchange, it would be impossible for the attacker to understand the correct share. There are few algorithms have been developed for secret sharing, e.g. secret splitting, Asmuth-Bloom secret sharing protocol, visual cryptography, etc. There is an unanswered question in this research about which method provides best level of security and efficiency in securing message. In this paper, we evaluate the performance of three methods, i.e. secret splitting, secret sharing, and recursive threshold visual cryptography for handwritten image security in terms of execution time and mean squared error (MSE) simulation. Simulation results show the secret splitting algorithm produces the shortest time of execution. On the other hand, the MSE simulation result that the three methods can reconstruct the original image very well.
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
TWO PHASE CLANDESTAIN IMAGE ENCRYPTION acijjournal
In today’s internet world is full of data steals and hackers. So, there is a essential to design a system that
assists the internet users to interchange their secret and private data safely across the web. Informationhiding
process in a Steganography system starts by identifying medium’s redundant bits. The encryption
process creates a stego medium by replacing these redundant bits with data from the hidden message.
So, we propose a method for encrypting the image, which has two phases. In the first phase, Perform
Circular Shift Operations on the image pixels and the number of rotations have been calculated based on
the length of the password. In the second phase, the first phase has undergone some bitwise operations
with a carriage image, by doing this; breaking of the cipher text is difficult.
DATA SECURITY USING PRIVATE KEY ENCRYPTION SYSTEM BASED ON ARITHMETIC CODINGIJNSA Journal
Problem faced by today’s communicators is not only security but also the speed of communication and size of content.In the present paper, a scheme has been proposed which uses the concept of compression and data encryption. In first phase the focus has been made on data compression and cryptography. In the next phase we have emphasized on compression cryptosystem. Finally, proposed technique has been discussed which used the concept of data compression and encryption. In this first data is compressed to reduce the size of the data and increase the data transfer rate. Thereafter compress data is encrypted to provide security. Hence our proposed technique is effective that can reduce data size, increase data transfer rate and provide the security during communication.
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
This document proposes an improved steganography approach using color-guided channels in digital images. It begins with an introduction to steganography and discusses how it can be used to hide secret data or messages within cover objects like images, video, or audio files. The proposed method embeds data into a color image's RGB channels. It first converts the secret message to a binary bit stream and compresses it using run length encoding. The data is then embedded directly into the LSBs of some channels and indirectly into other channels by encoding counts. This approach aims to improve the visual quality of the stego image and have higher embedding capacity compared to existing methods.
The document proposes a new encryption technique called Dynamic Hill Cipher with Message Digest Concatenation to improve security of data in cloud computing. It combines the Hill Cipher encryption algorithm with MD5 hashing to provide message authentication, confidentiality and integrity. The Hill Cipher is made more secure by allowing dynamic selection of the encryption key size and concatenating the MD5 hash to ensure messages are not modified. This new approach aims to address weaknesses in the Hill Cipher and provide all necessary security services for electronic communication of sensitive data stored in the cloud.
This document discusses image cryptography using the RSA algorithm. It begins with an abstract that provides an overview of encrypting images through a combination of RSA encryption and a 2-bit rotation mechanism. The document then reviews literature on modifications made to the original RSA algorithm. It discusses current applications of RSA, including uses in email encryption, cloud services, and digital signatures. The design architecture and working of the RSA algorithm are explained. The document concludes that image encryption using RSA is efficient and secure, though further research is needed to develop quantum-resistant encryption systems.
This document summarizes a research paper about providing security for data during multicasting using encryption. It discusses how encryption can be used to encrypt data before it is sent to multiple users to protect against malicious attacks. It also discusses different encryption algorithms and keys that can be used, including symmetric keys where one key is used for encryption and decryption, and asymmetric keys where a public key is used for encryption and a private key for decryption. The paper also reviews related work on secure group communication and key management techniques.
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
TWO PHASE CLANDESTAIN IMAGE ENCRYPTION acijjournal
In today’s internet world is full of data steals and hackers. So, there is a essential to design a system that
assists the internet users to interchange their secret and private data safely across the web. Informationhiding
process in a Steganography system starts by identifying medium’s redundant bits. The encryption
process creates a stego medium by replacing these redundant bits with data from the hidden message.
So, we propose a method for encrypting the image, which has two phases. In the first phase, Perform
Circular Shift Operations on the image pixels and the number of rotations have been calculated based on
the length of the password. In the second phase, the first phase has undergone some bitwise operations
with a carriage image, by doing this; breaking of the cipher text is difficult.
DATA SECURITY USING PRIVATE KEY ENCRYPTION SYSTEM BASED ON ARITHMETIC CODINGIJNSA Journal
Problem faced by today’s communicators is not only security but also the speed of communication and size of content.In the present paper, a scheme has been proposed which uses the concept of compression and data encryption. In first phase the focus has been made on data compression and cryptography. In the next phase we have emphasized on compression cryptosystem. Finally, proposed technique has been discussed which used the concept of data compression and encryption. In this first data is compressed to reduce the size of the data and increase the data transfer rate. Thereafter compress data is encrypted to provide security. Hence our proposed technique is effective that can reduce data size, increase data transfer rate and provide the security during communication.
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
This document proposes an improved steganography approach using color-guided channels in digital images. It begins with an introduction to steganography and discusses how it can be used to hide secret data or messages within cover objects like images, video, or audio files. The proposed method embeds data into a color image's RGB channels. It first converts the secret message to a binary bit stream and compresses it using run length encoding. The data is then embedded directly into the LSBs of some channels and indirectly into other channels by encoding counts. This approach aims to improve the visual quality of the stego image and have higher embedding capacity compared to existing methods.
The document proposes a new encryption technique called Dynamic Hill Cipher with Message Digest Concatenation to improve security of data in cloud computing. It combines the Hill Cipher encryption algorithm with MD5 hashing to provide message authentication, confidentiality and integrity. The Hill Cipher is made more secure by allowing dynamic selection of the encryption key size and concatenating the MD5 hash to ensure messages are not modified. This new approach aims to address weaknesses in the Hill Cipher and provide all necessary security services for electronic communication of sensitive data stored in the cloud.
This document discusses image cryptography using the RSA algorithm. It begins with an abstract that provides an overview of encrypting images through a combination of RSA encryption and a 2-bit rotation mechanism. The document then reviews literature on modifications made to the original RSA algorithm. It discusses current applications of RSA, including uses in email encryption, cloud services, and digital signatures. The design architecture and working of the RSA algorithm are explained. The document concludes that image encryption using RSA is efficient and secure, though further research is needed to develop quantum-resistant encryption systems.
This document summarizes a research paper about providing security for data during multicasting using encryption. It discusses how encryption can be used to encrypt data before it is sent to multiple users to protect against malicious attacks. It also discusses different encryption algorithms and keys that can be used, including symmetric keys where one key is used for encryption and decryption, and asymmetric keys where a public key is used for encryption and a private key for decryption. The paper also reviews related work on secure group communication and key management techniques.
This document presents a proposed algorithm for public key cryptography using matrices. The algorithm has three stages: 1) shuffling the original data using a linear congruential method and arranging it in a matrix, 2) traversing the data matrix in different patterns, and 3) generating a system of non-homogeneous linear equations from the matrix to derive private keys. The algorithm aims to provide data confidentiality, integrity and authentication for cloud computing applications using public key cryptography with matrices in a way that has constant complexity regardless of key size.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
A NOVEL APPROACH FOR CONCEALED DATA SHARING AND DATA EMBEDDING FOR SECURED CO...IJCSEA Journal
This paper introduces a new method of securing image using cryptographic and steganographic techniques. The science of securing a data by encryption is Cryptography whereas the method of hiding secret messages in other essages is Steganography, so that the secret’s very existence is concealed. The term ‘Steganography’ describes the method of hiding cognitive content in another medium to avoid detection by the intruders. The proposed method uses cryptographic and steganographic techniques to encrypt the data as well as hide the encrypted data in another medium so the fact, that a message being sent is concealed. The image is concealed by converting it into a iphertext using SDES algorithm with a secret key,which is also an image, and sent to the receiving end securely.
A Survey on Different Data Hiding Techniques in Encrypted Imagesijsrd.com
This document provides a survey of different data hiding techniques, with a focus on reversible data hiding in encrypted images. It begins with an introduction to data hiding and its importance for data security. Then it reviews various data hiding techniques, including those that hide data in audio signals, video sequences, and DNA sequences. It also discusses reversible data hiding techniques for encrypted images. The document concludes with a table that compares different data hiding techniques and highlights their advantages, such as increased hiding capacity and difficulty for attackers to detect hidden data. The survey finds that reversible data hiding techniques for encrypted images can achieve high-quality decrypted images with independent extraction and decryption.
Image encryption and decryption using aes algorithmIAEME Publication
This document summarizes an article that describes using the AES algorithm to encrypt and decrypt images. It begins with background on AES and its advantages over DES such as larger key sizes. It then describes modifications made to the AES key expansion to improve encryption quality and avalanche effect. The implementation takes an input key, generates expanded keys using a modified key expansion, then encrypts images by applying AES operations to blocks of 16 pixels using the expanded keys. Decryption reverses this process to recover the original image. Results show the encrypted image is secure and decrypts correctly when using the proper key.
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.
Mini Project on Data Encryption & Decryption in JAVAchovatiyabhautik
This document is a report on a data encryption and decryption project written by Bhautik Chovatiya for a computer networks course. The report provides an introduction to the need for data encryption, describes the project requirements and design. It also includes screenshots and code snippets demonstrating how the project allows users to encrypt and decrypt data either directly or from files using Caesar cipher encryption. The project aims to provide secure encryption in a simple and user-friendly way.
Key Management Scheme for Secure Group Communication in WSN with Multiple Gr...csandit
Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Review on Encrypted Image with Hidden Data Using AES AlgorithmEECJOURNAL
Steganography is the art of hiding the fact where communication is taking place, by hiding information in other information. Steganography becomes more important as more people join the cyberspace revolution. . In contrast to cryptography, it is not to keep others from knowing the hidden information but it is to keep others from thinking that the information even exists. Steganography include an array of secret communication methods that hide the message from being seen or discovered. Many different carrier file formats can be used, but digital images are the most popular because of their frequency on the internet. For hiding secret information in images, there exists a large variety of steganography techniques some are more complex than others and all of them have respective strong and weak points. Different applications may require absolute invisibility of the secret information, while others require a large secret message to be hidden. This project report intends to give an overview of image steganography, its uses and techniques. In addition to this our project also adds security to both the data hidden and the image that carries the information. Security is provided by Encrypting the data that is sent in the image and again encrypting the image that carries the information using AES algorithm. This encryption of the data and image thus provides double security layer.
This document analyzes and compares the performance of various cryptography algorithms. It discusses symmetric key algorithms like DES, AES, Blowfish and IDEA as well as asymmetric algorithms like RSA and Diffie-Hellman. The performance is evaluated based on parameters like encryption/decryption time, memory usage and throughput. Experiments show that Blowfish has better performance than AES for encrypting audio files, with lower average encryption and decryption times. In conclusion, cryptography is important for network security and Blowfish performs encryption/decryption more efficiently than AES for audio files.
A Novel Key Distribution Scheme f or a Visual Crypto SystemIRJET Journal
This document proposes a novel key distribution scheme for visual cryptography. It begins with an introduction to cryptography and visual cryptography. It then describes the existing Diffie-Hellman key exchange algorithm. The proposed method generates a shared secret key through a multi-step process using asymmetric key cryptography and modulus operation on private keys and a public image. Both parties are able to derive the same symmetric key for encrypting future communications without directly transmitting their private keys. The methodology and implementation details are provided, along with experimental results demonstrating the generation of matching keys within 0.11 seconds on average.
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of
DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of
Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Generate an Encryption Key by using Biometric Cryptosystems to secure transfe...IOSR Journals
The document describes a proposed method for generating an encryption key from biometric cryptosystems to securely transfer data over a network. It involves extracting minutiae points from a fingerprint scan, generating a cryptographic key from the biometric template, and using an RSA encryption algorithm with the biometric-derived private key. A public key is also calculated based on ridge and furrow patterns in the fingerprint scan. The goal is to uniquely generate encryption keys for each individual using their biometric fingerprint information to add an extra layer of security beyond traditional encryption techniques.
Image Steganography Based On Hill Cipher with Key Hiding TechniqueIOSR Journals
This document presents a method for image steganography using Hill cipher encryption with a hidden key. It begins with background on steganography, cryptography, and the Hill cipher algorithm. The proposed method hides an encrypted ciphertext and encrypted key within the pixel values of a cover image. To encrypt, it applies Hill cipher to the plaintext, hides the ciphertext in the cover image pixels, and encrypts and embeds the key. It transmits the steganographic image. To decrypt, it extracts the key from the pixel values, decrypts the key, and uses the inverse Hill cipher to recover the original plaintext. The key is transformed and diffused within the pixel values, hiding it and making the system more secure for network transmission without
This document discusses the implementation of a new steganography technique called BPCS-Steganography. Steganography hides secret data within other carrier data without leaving any visible evidence of alteration. Traditional techniques have limited capacity of less than 10% of the carrier size. The new technique embeds secrets in the bit-planes of an image carrier. It takes advantage of human inability to perceive shapes in complex binary patterns to replace "noise-like" bit-plane regions with secret data without affecting image quality. This allows hiding secret data up to 50% of the original image size. The document also discusses technologies, security considerations using RSA encryption, and a system study of the proposed technique versus existing work.
Cloud computing is a powerful, flexible, cost
efficient platform for providing consumer IT services
over the Internet. However Cloud Computing has
various level of risk because most important
information is maintained and managed by third party
vendors, which means harder to maintain security for
user’s data .Steganography is one of the ways to provide
security for secret data by inserting in an image or
video. In this most of the algorithms are based on the
Least Significant Bit (LSB), but the hackers easily
detects it embeds directly. An Efficient and secure
method of embedding secret message-extracting
message into or from color image using Artificial
Neural Network will be proposed. The proposed
method will be tested, implemented and analyzed for
various color images of different sizes and different
sizes of secret messages. The performance of the
algorithm will be analyzed by calculating various
parameters like PSNR, MSE and the results are good
compared to existing algorithms.
A novel hash based least significant bit (2 3-3) image steganography in spati...ijsptm
The document presents a novel hash-based 2-3-3 least significant bit (LSB) image steganography technique for embedding secret images in the spatial domain of color cover images. The technique embeds 8 bits of secret image data at a time in the LSBs of color image pixels in a 2-3-3 pattern across the red, green, and blue channels. Experimental results show the proposed 2-3-3 technique improves mean squared error and peak signal-to-noise ratio values compared to the base 3-3-2 LSB insertion technique. The proposed technique provides better imperceptibility of the stego image and higher embedding capacity than previous hash-based LSB methods.
LOSSLESS RECONSTRUCTION OF SECRET IMAGE USING THRESHOLD SECRET SHARING AND TR...IJNSA Journal
The document proposes a method for securely sharing secret images using threshold secret sharing and transformations. The method involves first transforming the secret image using the radon transformation. This spatially transforms the pixel intensities. Run length encoding is then used to compress the transformed image. Threshold secret sharing is applied to the encoded image data to generate shares. The shares are represented in Braille images and distributed to authorized users. Applying the reverse operations allows reconstruction of the original secret image without any data loss.
This document presents a proposed algorithm for public key cryptography using matrices. The algorithm has three stages: 1) shuffling the original data using a linear congruential method and arranging it in a matrix, 2) traversing the data matrix in different patterns, and 3) generating a system of non-homogeneous linear equations from the matrix to derive private keys. The algorithm aims to provide data confidentiality, integrity and authentication for cloud computing applications using public key cryptography with matrices in a way that has constant complexity regardless of key size.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
A NOVEL APPROACH FOR CONCEALED DATA SHARING AND DATA EMBEDDING FOR SECURED CO...IJCSEA Journal
This paper introduces a new method of securing image using cryptographic and steganographic techniques. The science of securing a data by encryption is Cryptography whereas the method of hiding secret messages in other essages is Steganography, so that the secret’s very existence is concealed. The term ‘Steganography’ describes the method of hiding cognitive content in another medium to avoid detection by the intruders. The proposed method uses cryptographic and steganographic techniques to encrypt the data as well as hide the encrypted data in another medium so the fact, that a message being sent is concealed. The image is concealed by converting it into a iphertext using SDES algorithm with a secret key,which is also an image, and sent to the receiving end securely.
A Survey on Different Data Hiding Techniques in Encrypted Imagesijsrd.com
This document provides a survey of different data hiding techniques, with a focus on reversible data hiding in encrypted images. It begins with an introduction to data hiding and its importance for data security. Then it reviews various data hiding techniques, including those that hide data in audio signals, video sequences, and DNA sequences. It also discusses reversible data hiding techniques for encrypted images. The document concludes with a table that compares different data hiding techniques and highlights their advantages, such as increased hiding capacity and difficulty for attackers to detect hidden data. The survey finds that reversible data hiding techniques for encrypted images can achieve high-quality decrypted images with independent extraction and decryption.
Image encryption and decryption using aes algorithmIAEME Publication
This document summarizes an article that describes using the AES algorithm to encrypt and decrypt images. It begins with background on AES and its advantages over DES such as larger key sizes. It then describes modifications made to the AES key expansion to improve encryption quality and avalanche effect. The implementation takes an input key, generates expanded keys using a modified key expansion, then encrypts images by applying AES operations to blocks of 16 pixels using the expanded keys. Decryption reverses this process to recover the original image. Results show the encrypted image is secure and decrypts correctly when using the proper key.
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.
Mini Project on Data Encryption & Decryption in JAVAchovatiyabhautik
This document is a report on a data encryption and decryption project written by Bhautik Chovatiya for a computer networks course. The report provides an introduction to the need for data encryption, describes the project requirements and design. It also includes screenshots and code snippets demonstrating how the project allows users to encrypt and decrypt data either directly or from files using Caesar cipher encryption. The project aims to provide secure encryption in a simple and user-friendly way.
Key Management Scheme for Secure Group Communication in WSN with Multiple Gr...csandit
Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Review on Encrypted Image with Hidden Data Using AES AlgorithmEECJOURNAL
Steganography is the art of hiding the fact where communication is taking place, by hiding information in other information. Steganography becomes more important as more people join the cyberspace revolution. . In contrast to cryptography, it is not to keep others from knowing the hidden information but it is to keep others from thinking that the information even exists. Steganography include an array of secret communication methods that hide the message from being seen or discovered. Many different carrier file formats can be used, but digital images are the most popular because of their frequency on the internet. For hiding secret information in images, there exists a large variety of steganography techniques some are more complex than others and all of them have respective strong and weak points. Different applications may require absolute invisibility of the secret information, while others require a large secret message to be hidden. This project report intends to give an overview of image steganography, its uses and techniques. In addition to this our project also adds security to both the data hidden and the image that carries the information. Security is provided by Encrypting the data that is sent in the image and again encrypting the image that carries the information using AES algorithm. This encryption of the data and image thus provides double security layer.
This document analyzes and compares the performance of various cryptography algorithms. It discusses symmetric key algorithms like DES, AES, Blowfish and IDEA as well as asymmetric algorithms like RSA and Diffie-Hellman. The performance is evaluated based on parameters like encryption/decryption time, memory usage and throughput. Experiments show that Blowfish has better performance than AES for encrypting audio files, with lower average encryption and decryption times. In conclusion, cryptography is important for network security and Blowfish performs encryption/decryption more efficiently than AES for audio files.
A Novel Key Distribution Scheme f or a Visual Crypto SystemIRJET Journal
This document proposes a novel key distribution scheme for visual cryptography. It begins with an introduction to cryptography and visual cryptography. It then describes the existing Diffie-Hellman key exchange algorithm. The proposed method generates a shared secret key through a multi-step process using asymmetric key cryptography and modulus operation on private keys and a public image. Both parties are able to derive the same symmetric key for encrypting future communications without directly transmitting their private keys. The methodology and implementation details are provided, along with experimental results demonstrating the generation of matching keys within 0.11 seconds on average.
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of
DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of
Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Generate an Encryption Key by using Biometric Cryptosystems to secure transfe...IOSR Journals
The document describes a proposed method for generating an encryption key from biometric cryptosystems to securely transfer data over a network. It involves extracting minutiae points from a fingerprint scan, generating a cryptographic key from the biometric template, and using an RSA encryption algorithm with the biometric-derived private key. A public key is also calculated based on ridge and furrow patterns in the fingerprint scan. The goal is to uniquely generate encryption keys for each individual using their biometric fingerprint information to add an extra layer of security beyond traditional encryption techniques.
Image Steganography Based On Hill Cipher with Key Hiding TechniqueIOSR Journals
This document presents a method for image steganography using Hill cipher encryption with a hidden key. It begins with background on steganography, cryptography, and the Hill cipher algorithm. The proposed method hides an encrypted ciphertext and encrypted key within the pixel values of a cover image. To encrypt, it applies Hill cipher to the plaintext, hides the ciphertext in the cover image pixels, and encrypts and embeds the key. It transmits the steganographic image. To decrypt, it extracts the key from the pixel values, decrypts the key, and uses the inverse Hill cipher to recover the original plaintext. The key is transformed and diffused within the pixel values, hiding it and making the system more secure for network transmission without
This document discusses the implementation of a new steganography technique called BPCS-Steganography. Steganography hides secret data within other carrier data without leaving any visible evidence of alteration. Traditional techniques have limited capacity of less than 10% of the carrier size. The new technique embeds secrets in the bit-planes of an image carrier. It takes advantage of human inability to perceive shapes in complex binary patterns to replace "noise-like" bit-plane regions with secret data without affecting image quality. This allows hiding secret data up to 50% of the original image size. The document also discusses technologies, security considerations using RSA encryption, and a system study of the proposed technique versus existing work.
Cloud computing is a powerful, flexible, cost
efficient platform for providing consumer IT services
over the Internet. However Cloud Computing has
various level of risk because most important
information is maintained and managed by third party
vendors, which means harder to maintain security for
user’s data .Steganography is one of the ways to provide
security for secret data by inserting in an image or
video. In this most of the algorithms are based on the
Least Significant Bit (LSB), but the hackers easily
detects it embeds directly. An Efficient and secure
method of embedding secret message-extracting
message into or from color image using Artificial
Neural Network will be proposed. The proposed
method will be tested, implemented and analyzed for
various color images of different sizes and different
sizes of secret messages. The performance of the
algorithm will be analyzed by calculating various
parameters like PSNR, MSE and the results are good
compared to existing algorithms.
A novel hash based least significant bit (2 3-3) image steganography in spati...ijsptm
The document presents a novel hash-based 2-3-3 least significant bit (LSB) image steganography technique for embedding secret images in the spatial domain of color cover images. The technique embeds 8 bits of secret image data at a time in the LSBs of color image pixels in a 2-3-3 pattern across the red, green, and blue channels. Experimental results show the proposed 2-3-3 technique improves mean squared error and peak signal-to-noise ratio values compared to the base 3-3-2 LSB insertion technique. The proposed technique provides better imperceptibility of the stego image and higher embedding capacity than previous hash-based LSB methods.
LOSSLESS RECONSTRUCTION OF SECRET IMAGE USING THRESHOLD SECRET SHARING AND TR...IJNSA Journal
The document proposes a method for securely sharing secret images using threshold secret sharing and transformations. The method involves first transforming the secret image using the radon transformation. This spatially transforms the pixel intensities. Run length encoding is then used to compress the transformed image. Threshold secret sharing is applied to the encoded image data to generate shares. The shares are represented in Braille images and distributed to authorized users. Applying the reverse operations allows reconstruction of the original secret image without any data loss.
Text in Image Hiding using Developed LSB and Random Method IJECEIAES
Information Hiding is a task that face difficult challenges in current time. The reason for these challenges is the rapid development of methods of detection of hidden information. So, researchers have been interested in developing methods of concealment, making it difficult for attackers to access hidden information using new methods of concealment. Such as the introducing a complex algorithms, use a random methods and invent more complicated and difficult steps. This paper presents a new method of hiding information within the image. This method creates a new sequence of mysterious and difficult steps by dividing the secret text on all image and random distributing of bits to each row. Then using a special reverse method to hide the bits in that row. The LSB method has also been developed to make it more difficult to hide the pixel. The results presented illustrate the strength and security of the method and provide greater protection for hidden information. Also, the result illustrate the quality of the stego image compared with the original image using PSNR and SSIM quality measures.
Classification of secure encrypted relationaldata in cloud computingeSAT Journals
Abstract Due to the increasing popularity of cloud computing, organisations have the choice to outsource their large encrypted data
content along as well as data mining operations to cloud the environment. Outsourcing data to such a third party cloud
environment can compromise the data security as cloud operations and data mining tasks cannot carry out computations without
decrypting the data. Hence, already present privacy-preserving data mining techniques are not efficient to address the security
and confidentiality problems. In the base paper, a k-NN classification algorithm over secure data under a semi-honest model was
developed using a Paillier cryptosystem for public key encryption. The usage of public key cryptosystems has security issues
during data transfer in the cloud. In this proposed work, we focus on solving the k-NN problem over secure encrypted data by
proposing a privacy preserving k-nearest neighbour classification on encrypted information in the cloud using private key for
encryption and decryption based on the symmetric AES cryptographic algorithm under the secure multiparty computations for
creating a complete homomorphic encryption (CHE) scheme which results in the reduction of space requirement and processing
time. Also, we aim to apply the same PPk-NN classification over encrypted images. The proposed protocol hides the input query
and data access patterns of the users and also preserves the confidentiality of text and image data.Finally, we present a practical
analysis of the efficiency and security performance of our proposed protocol for application in a Life insurance firm where the
clients are classified according to their risk-level.
Keywords: Data Mining, PPk-NN, Semi-Honest Model , Individual Key, Symmetric Homomorphic Encryption, AES
Algorithm,CHE, Less Space and Time
An LSB Method Of Image Steganographic TechniquesIJERA Editor
The art of information hiding has received much attention in the recent years as security of information has become a big concern in this internet era. As sharing of sensitive information via a common communication channel has become inevitable. Steganography means hiding a secret message (the embedded message) within a larger one (source cover) in such a way that an observer cannot detect the presence of contents of the hidden message [1]. Many different carrier file formats can be used, but digital images are the most popular because of their frequency on the Internet [2]. This paper intends to give an overview of image Steganography, its uses and techniques. It also attempts to identify the requirements of a good Steganography algorithm and briefly reflects on which Steganography techniques are more suitable for which applications.
A Survey Paper On Different Steganography TechniqueJeff Brooks
This document summarizes a survey paper on different steganography techniques. It begins by defining steganography and its types such as linguistic, image, network, video, audio, and text steganography. It then focuses on least significant bit (LSB) steganography, explaining how it works by replacing the LSB of image pixel values with secret message bits. The paper compares the histograms of cover and stego images, showing they are almost identical. It discusses the advantages of steganography and concludes by analyzing steganography methods and suggesting areas for future work such as increasing embedding capacity while maintaining secrecy.
This document discusses message transfer using steganography. Steganography is used to hide information like text, images or videos within other media files such as images, videos or music. The document discusses how steganography can be used to securely transfer messages between two parties by hiding the messages within digital files like images without the server being able to decrypt the messages. It discusses how the least significant bits of pixels can be modified to embed secret data without significantly affecting the cover image. Different encryption techniques for embedding the data are also discussed. The document concludes that steganography can help protect messages not only from intruders but also from server-side attacks by making it difficult for the server to detect and decrypt embedded messages.
Protecting Data by Improving Quality of Stego Image based on Enhanced Reduced...IJECEIAES
In this era of internet development, security of information sharing is the main problem faced by human being. Data hiding technique is one of the solutions. However, hiding credential information within a multimedia file such as image reduces its visual quality. Therefore, unauthorized users may suspect the existance of secret data within that image. In the past years, various data hiding algorithms have been developed by researchers to overcome the problem of high distortion of image after data embedding process. Achieving a high quality stego image, however, is still a challenging problem. In this paper, we proposed a new data hiding algorithm based on different expansion. It aims to enhance the quality of stego image for a given payload size. The new algorithm is evaluated on various medical images. Thereafter, the experimental results show that the visual quality is improved; and increasing the embedding capacity leads to more noises. Therefore, a better choice of base point and a reduced difference expansion affect the quality of stego image.
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.
A NOVEL APPROACH FOR CONCEALED DATA SHARING AND DATA EMBEDDING FOR SECURED CO...IJCSEA Journal
This paper introduces a new method of securing image using cryptographic and steganographic techniques. The science of securing a data by encryption is Cryptography whereas the method of hiding secret messages in other messages is Steganography, so that the secret’s very existence is concealed. The term ‘Steganography’ describes the method of hiding cognitive content in another medium to avoid detection by the intruders. The proposed method uses cryptographic and steganographic techniques to encrypt the data as well as hide the encrypted data in another medium so the fact, that a message being sent is concealed. The image is concealed by converting it into a ciphertext using SDES algorithm with a secret key,which is also an image, and sent to the receiving end securely.
The Internet is the essential wellspring of data in the present life where it offers the trade of data to the
clients.The exchange of such data prompts an incredible security danger. Cryptography and steganography
are two issues in security systems.Cryptography jumbles the message to be incomprehensible While
Steganography shroud the message To be invisible. Therefore, Encryption any private data before
concealing in the cover object will provide twofold security. This paper presents a technique for disguise
message with four levels of security where the message first encrypt using modifying vernam cipher, in
which the initial key originate automatically from random pixel of camouflage cover and alter continuously
along message length then embedded cipher message in grayscale cover image, after that encrypt this
cover using modifying vernam cipher also then embedded it in RGB color cover image. The simulation
consequence illustrates that the scheme provides better protection.
Protection of Secret Textual Data Using Steganography Based SystemIRJET Journal
The document proposes an enhanced steganography-based approach to protect secret data by embedding it within audio files using a two-level protection system. Encryption using 3-DES is used as the first level of defense, while hiding data in the least significant bit of the audio samples creates the second level. The proposed approach achieves better performance than similar methods in terms of PSNR, SSIM, and correlation between the original and stego audio files. Experimental results show the system is suitable for hiding secret textual data and increases the bit error rate only slightly even when duplicating the hidden text.
This document summarizes a research paper that proposes a new technique for data embedding and extraction in high resolution AVI videos. The technique encrypts a secret message before embedding it by alternately changing the LSB and LSB+3 bits of alternate bytes in the cover video file. An index is also created for the secret information and placed in a video frame to aid extraction. This technique aims to provide higher security, capacity and robustness compared to typical data embedding methods. The paper discusses related work on digital steganography techniques and the proposed video steganography algorithm in more detail.
In this paper, text information is encoded behind the Image cover object at the sender and decoded at the receiver, provided by additional security features in the application. In this paper, we propose an In this paper, we propose an In this paper, we propose an object by changing the least significant bits of the image pixels because the image acts as the best source to hide the message that is invisible to the human eye. In this application, the text message is encrypted on the back of the senders image card object and decoded on the receiver, which is provided with additional security features in the application. Ragul M | Dr. Lakshmi J. V. N "Android Based Image Steganography" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-6 , October 2020, URL: https://www.ijtsrd.com/papers/ijtsrd35733.pdf Paper Url: https://www.ijtsrd.com/computer-science/computer-security/35733/android-based-image-steganography/ragul-m
Securing Image Steganogarphy Based on Visual Cryptography And Integer Wavelet...IOSR Journals
The document proposes a new method for securing image steganography using visual cryptography and integer wavelet transform. The method embeds a secret image into a cover image in the following steps: 1) Apply (2 out of 2) visual cryptography to the secret image to generate two secret shares. 2) Apply a two-level integer wavelet transform to the blue channel of the cover image, resulting in four sub-bands. 3) Embed each secret share into one of the four sub-bands. 4) Combine the channels to generate the stego-image. Extraction requires applying the same transforms to the stego-image to recover the secret shares and reconstruct the secret image, without needing the original cover image. The method
This document proposes a new encryption scheme called compact summation key encryption for secure data sharing in hybrid cloud storage. It aims to address limitations of existing approaches like predefined hierarchical schemes, attribute-based encryption, and identity-based encryption which cannot provide security to individual files or have non-constant size keys. The new scheme uses five algorithms: setup, key generation, encryption, extraction and decryption. It generates constant size public and master secret keys. Encryption uses file indexes and bilinear groups to create ciphertexts. Extraction combines decryption keys into a single compact summation key using bilinear pairing operations. This key can then decrypt ciphertexts for multiple file indexes, improving flexibility and efficiency of secure data sharing in cloud storage.
Secure Data Sharing Using Compact Summation key in Hybrid Cloud StorageIOSR Journals
This document proposes a new encryption scheme called compact summation key encryption for secure data sharing in hybrid cloud storage. It aims to address limitations of existing approaches like predefined hierarchical schemes, attribute-based encryption, and identity-based encryption which cannot provide security to individual files or have non-constant size keys. The new scheme uses five algorithms: setup, key generation, encryption, extraction and decryption. It generates constant size public and master secret keys. Encryption uses file indexes and bilinear groups to create ciphertexts. Extraction combines decryption keys into a single compact summation key using bilinear pairing operations. This key can then decrypt ciphertexts for multiple file indexes, improving flexibility and efficiency of secure data sharing in cloud storage.
A Comparitive Analysis Of Steganography Techniquestheijes
With the increase in rate of unauthorized access and attacks security of confidential data is important. Now a day Cryptography and Steganography are the secure communication media for security purposes. This paper focuses on quantitative comparision of steganography technique such as improved LSB technique for RGB images, pattern based steganography technique and raster scan technique. The simulation has been done on MATLAB 2013 using 20 images and output of few has been shown in this paper. It has been concluded that the on the basis of various factors such as quantitative measures of the three techniques, pattern based steganography technique is the best among the other techniques w.r.t to security , irrespective of the fact that this technique has low capacity.
Two New Approaches for Secured Image Steganography Using Cryptographic Techni...sipij
The science of securing a data by encryption is Cryptography whereas the method of hiding secret messages in other messages is Steganography, so that the secret’s very existence is concealed. The term ‘Steganography’ describes the method of hiding cognitive content in another medium to avoid detection by the intruders. This paper introduces two new methods wherein cryptography and steganography are combined to encrypt the data as well as to hide the encrypted data in another medium so the fact that a message being sent is concealed. One of the methods shows how to secure the image by converting it into cipher text by S-DES algorithm using a secret key and conceal this text in another image by steganographic method. Another method shows a new way of hiding an image in another image by encrypting the image directly by S-DES algorithm using a key image and the data obtained is concealed in another image. The proposed method prevents the possibilities of steganalysis also.
Similar to Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual Cryptography for Security of Handwritten Images (20)
Amazon products reviews classification based on machine learning, deep learni...TELKOMNIKA JOURNAL
In recent times, the trend of online shopping through e-commerce stores and websites has grown to a huge extent. Whenever a product is purchased on an e-commerce platform, people leave their reviews about the product. These reviews are very helpful for the store owners and the product’s manufacturers for the betterment of their work process as well as product quality. An automated system is proposed in this work that operates on two datasets D1 and D2 obtained from Amazon. After certain preprocessing steps, N-gram and word embedding-based features are extracted using term frequency-inverse document frequency (TF-IDF), bag of words (BoW) and global vectors (GloVe), and Word2vec, respectively. Four machine learning (ML) models support vector machines (SVM), logistic regression (RF), logistic regression (LR), multinomial Naïve Bayes (MNB), two deep learning (DL) models convolutional neural network (CNN), long-short term memory (LSTM), and standalone bidirectional encoder representations (BERT) are used to classify reviews as either positive or negative. The results obtained by the standard ML, DL models and BERT are evaluated using certain performance evaluation measures. BERT turns out to be the best-performing model in the case of D1 with an accuracy of 90% on features derived by word embedding models while the CNN provides the best accuracy of 97% upon word embedding features in the case of D2. The proposed model shows better overall performance on D2 as compared to D1.
Design, simulation, and analysis of microstrip patch antenna for wireless app...TELKOMNIKA JOURNAL
In this study, a microstrip patch antenna that works at 3.6 GHz was built and tested to see how well it works. In this work, Rogers RT/Duroid 5880 has been used as the substrate material, with a dielectric permittivity of 2.2 and a thickness of 0.3451 mm; it serves as the base for the examined antenna. The computer simulation technology (CST) studio suite is utilized to show the recommended antenna design. The goal of this study was to get a more extensive transmission capacity, a lower voltage standing wave ratio (VSWR), and a lower return loss, but the main goal was to get a higher gain, directivity, and efficiency. After simulation, the return loss, gain, directivity, bandwidth, and efficiency of the supplied antenna are found to be -17.626 dB, 9.671 dBi, 9.924 dBi, 0.2 GHz, and 97.45%, respectively. Besides, the recreation uncovered that the transfer speed side-lobe level at phi was much better than those of the earlier works, at -28.8 dB, respectively. Thus, it makes a solid contender for remote innovation and more robust communication.
Design and simulation an optimal enhanced PI controller for congestion avoida...TELKOMNIKA JOURNAL
This document describes using a snake optimization algorithm to tune the gains of an enhanced proportional-integral controller for congestion avoidance in a TCP/AQM system. The controller aims to maintain a stable and desired queue size without noise or transmission problems. A linearized model of the TCP/AQM system is presented. An enhanced PI controller combining nonlinear gain and original PI gains is proposed. The snake optimization algorithm is then used to tune the parameters of the enhanced PI controller to achieve optimal system performance and response. Simulation results are discussed showing the proposed controller provides a stable and robust behavior for congestion control.
Improving the detection of intrusion in vehicular ad-hoc networks with modifi...TELKOMNIKA JOURNAL
Vehicular ad-hoc networks (VANETs) are wireless-equipped vehicles that form networks along the road. The security of this network has been a major challenge. The identity-based cryptosystem (IBC) previously used to secure the networks suffers from membership authentication security features. This paper focuses on improving the detection of intruders in VANETs with a modified identity-based cryptosystem (MIBC). The MIBC is developed using a non-singular elliptic curve with Lagrange interpolation. The public key of vehicles and roadside units on the network are derived from number plates and location identification numbers, respectively. Pseudo-identities are used to mask the real identity of users to preserve their privacy. The membership authentication mechanism ensures that only valid and authenticated members of the network are allowed to join the network. The performance of the MIBC is evaluated using intrusion detection ratio (IDR) and computation time (CT) and then validated with the existing IBC. The result obtained shows that the MIBC recorded an IDR of 99.3% against 94.3% obtained for the existing identity-based cryptosystem (EIBC) for 140 unregistered vehicles attempting to intrude on the network. The MIBC shows lower CT values of 1.17 ms against 1.70 ms for EIBC. The MIBC can be used to improve the security of VANETs.
Conceptual model of internet banking adoption with perceived risk and trust f...TELKOMNIKA JOURNAL
Understanding the primary factors of internet banking (IB) acceptance is critical for both banks and users; nevertheless, our knowledge of the role of users’ perceived risk and trust in IB adoption is limited. As a result, we develop a conceptual model by incorporating perceived risk and trust into the technology acceptance model (TAM) theory toward the IB. The proper research emphasized that the most essential component in explaining IB adoption behavior is behavioral intention to use IB adoption. TAM is helpful for figuring out how elements that affect IB adoption are connected to one another. According to previous literature on IB and the use of such technology in Iraq, one has to choose a theoretical foundation that may justify the acceptance of IB from the customer’s perspective. The conceptual model was therefore constructed using the TAM as a foundation. Furthermore, perceived risk and trust were added to the TAM dimensions as external factors. The key objective of this work was to extend the TAM to construct a conceptual model for IB adoption and to get sufficient theoretical support from the existing literature for the essential elements and their relationships in order to unearth new insights about factors responsible for IB adoption.
Efficient combined fuzzy logic and LMS algorithm for smart antennaTELKOMNIKA JOURNAL
The smart antennas are broadly used in wireless communication. The least mean square (LMS) algorithm is a procedure that is concerned in controlling the smart antenna pattern to accommodate specified requirements such as steering the beam toward the desired signal, in addition to placing the deep nulls in the direction of unwanted signals. The conventional LMS (C-LMS) has some drawbacks like slow convergence speed besides high steady state fluctuation error. To overcome these shortcomings, the present paper adopts an adaptive fuzzy control step size least mean square (FC-LMS) algorithm to adjust its step size. Computer simulation outcomes illustrate that the given model has fast convergence rate as well as low mean square error steady state.
Design and implementation of a LoRa-based system for warning of forest fireTELKOMNIKA JOURNAL
This paper presents the design and implementation of a forest fire monitoring and warning system based on long range (LoRa) technology, a novel ultra-low power consumption and long-range wireless communication technology for remote sensing applications. The proposed system includes a wireless sensor network that records environmental parameters such as temperature, humidity, wind speed, and carbon dioxide (CO2) concentration in the air, as well as taking infrared photos.The data collected at each sensor node will be transmitted to the gateway via LoRa wireless transmission. Data will be collected, processed, and uploaded to a cloud database at the gateway. An Android smartphone application that allows anyone to easily view the recorded data has been developed. When a fire is detected, the system will sound a siren and send a warning message to the responsible personnel, instructing them to take appropriate action. Experiments in Tram Chim Park, Vietnam, have been conducted to verify and evaluate the operation of the system.
Wavelet-based sensing technique in cognitive radio networkTELKOMNIKA JOURNAL
Cognitive radio is a smart radio that can change its transmitter parameter based on interaction with the environment in which it operates. The demand for frequency spectrum is growing due to a big data issue as many Internet of Things (IoT) devices are in the network. Based on previous research, most frequency spectrum was used, but some spectrums were not used, called spectrum hole. Energy detection is one of the spectrum sensing methods that has been frequently used since it is easy to use and does not require license users to have any prior signal understanding. But this technique is incapable of detecting at low signal-to-noise ratio (SNR) levels. Therefore, the wavelet-based sensing is proposed to overcome this issue and detect spectrum holes. The main objective of this work is to evaluate the performance of wavelet-based sensing and compare it with the energy detection technique. The findings show that the percentage of detection in wavelet-based sensing is 83% higher than energy detection performance. This result indicates that the wavelet-based sensing has higher precision in detection and the interference towards primary user can be decreased.
A novel compact dual-band bandstop filter with enhanced rejection bandsTELKOMNIKA JOURNAL
In this paper, we present the design of a new wide dual-band bandstop filter (DBBSF) using nonuniform transmission lines. The method used to design this filter is to replace conventional uniform transmission lines with nonuniform lines governed by a truncated Fourier series. Based on how impedances are profiled in the proposed DBBSF structure, the fractional bandwidths of the two 10 dB-down rejection bands are widened to 39.72% and 52.63%, respectively, and the physical size has been reduced compared to that of the filter with the uniform transmission lines. The results of the electromagnetic (EM) simulation support the obtained analytical response and show an improved frequency behavior.
Deep learning approach to DDoS attack with imbalanced data at the application...TELKOMNIKA JOURNAL
A distributed denial of service (DDoS) attack is where one or more computers attack or target a server computer, by flooding internet traffic to the server. As a result, the server cannot be accessed by legitimate users. A result of this attack causes enormous losses for a company because it can reduce the level of user trust, and reduce the company’s reputation to lose customers due to downtime. One of the services at the application layer that can be accessed by users is a web-based lightweight directory access protocol (LDAP) service that can provide safe and easy services to access directory applications. We used a deep learning approach to detect DDoS attacks on the CICDDoS 2019 dataset on a complex computer network at the application layer to get fast and accurate results for dealing with unbalanced data. Based on the results obtained, it is observed that DDoS attack detection using a deep learning approach on imbalanced data performs better when implemented using synthetic minority oversampling technique (SMOTE) method for binary classes. On the other hand, the proposed deep learning approach performs better for detecting DDoS attacks in multiclass when implemented using the adaptive synthetic (ADASYN) method.
The appearance of uncertainties and disturbances often effects the characteristics of either linear or nonlinear systems. Plus, the stabilization process may be deteriorated thus incurring a catastrophic effect to the system performance. As such, this manuscript addresses the concept of matching condition for the systems that are suffering from miss-match uncertainties and exogeneous disturbances. The perturbation towards the system at hand is assumed to be known and unbounded. To reach this outcome, uncertainties and their classifications are reviewed thoroughly. The structural matching condition is proposed and tabulated in the proposition 1. Two types of mathematical expressions are presented to distinguish the system with matched uncertainty and the system with miss-matched uncertainty. Lastly, two-dimensional numerical expressions are provided to practice the proposed proposition. The outcome shows that matching condition has the ability to change the system to a design-friendly model for asymptotic stabilization.
Implementation of FinFET technology based low power 4×4 Wallace tree multipli...TELKOMNIKA JOURNAL
Many systems, including digital signal processors, finite impulse response (FIR) filters, application-specific integrated circuits, and microprocessors, use multipliers. The demand for low power multipliers is gradually rising day by day in the current technological trend. In this study, we describe a 4×4 Wallace multiplier based on a carry select adder (CSA) that uses less power and has a better power delay product than existing multipliers. HSPICE tool at 16 nm technology is used to simulate the results. In comparison to the traditional CSA-based multiplier, which has a power consumption of 1.7 µW and power delay product (PDP) of 57.3 fJ, the results demonstrate that the Wallace multiplier design employing CSA with first zero finding logic (FZF) logic has the lowest power consumption of 1.4 µW and PDP of 27.5 fJ.
Evaluation of the weighted-overlap add model with massive MIMO in a 5G systemTELKOMNIKA JOURNAL
The flaw in 5G orthogonal frequency division multiplexing (OFDM) becomes apparent in high-speed situations. Because the doppler effect causes frequency shifts, the orthogonality of OFDM subcarriers is broken, lowering both their bit error rate (BER) and throughput output. As part of this research, we use a novel design that combines massive multiple input multiple output (MIMO) and weighted overlap and add (WOLA) to improve the performance of 5G systems. To determine which design is superior, throughput and BER are calculated for both the proposed design and OFDM. The results of the improved system show a massive improvement in performance ver the conventional system and significant improvements with massive MIMO, including the best throughput and BER. When compared to conventional systems, the improved system has a throughput that is around 22% higher and the best performance in terms of BER, but it still has around 25% less error than OFDM.
Reflector antenna design in different frequencies using frequency selective s...TELKOMNIKA JOURNAL
In this study, it is aimed to obtain two different asymmetric radiation patterns obtained from antennas in the shape of the cross-section of a parabolic reflector (fan blade type antennas) and antennas with cosecant-square radiation characteristics at two different frequencies from a single antenna. For this purpose, firstly, a fan blade type antenna design will be made, and then the reflective surface of this antenna will be completed to the shape of the reflective surface of the antenna with the cosecant-square radiation characteristic with the frequency selective surface designed to provide the characteristics suitable for the purpose. The frequency selective surface designed and it provides the perfect transmission as possible at 4 GHz operating frequency, while it will act as a band-quenching filter for electromagnetic waves at 5 GHz operating frequency and will be a reflective surface. Thanks to this frequency selective surface to be used as a reflective surface in the antenna, a fan blade type radiation characteristic at 4 GHz operating frequency will be obtained, while a cosecant-square radiation characteristic at 5 GHz operating frequency will be obtained.
Reagentless iron detection in water based on unclad fiber optical sensorTELKOMNIKA JOURNAL
A simple and low-cost fiber based optical sensor for iron detection is demonstrated in this paper. The sensor head consist of an unclad optical fiber with the unclad length of 1 cm and it has a straight structure. Results obtained shows a linear relationship between the output light intensity and iron concentration, illustrating the functionality of this iron optical sensor. Based on the experimental results, the sensitivity and linearity are achieved at 0.0328/ppm and 0.9824 respectively at the wavelength of 690 nm. With the same wavelength, other performance parameters are also studied. Resolution and limit of detection (LOD) are found to be 0.3049 ppm and 0.0755 ppm correspondingly. This iron sensor is advantageous in that it does not require any reagent for detection, enabling it to be simpler and cost-effective in the implementation of the iron sensing.
Impact of CuS counter electrode calcination temperature on quantum dot sensit...TELKOMNIKA JOURNAL
In place of the commercial Pt electrode used in quantum sensitized solar cells, the low-cost CuS cathode is created using electrophoresis. High resolution scanning electron microscopy and X-ray diffraction were used to analyze the structure and morphology of structural cubic samples with diameters ranging from 40 nm to 200 nm. The conversion efficiency of solar cells is significantly impacted by the calcination temperatures of cathodes at 100 °C, 120 °C, 150 °C, and 180 °C under vacuum. The fluorine doped tin oxide (FTO)/CuS cathode electrode reached a maximum efficiency of 3.89% when it was calcined at 120 °C. Compared to other temperature combinations, CuS nanoparticles crystallize at 120 °C, which lowers resistance while increasing electron lifetime.
In place of the commercial Pt electrode used in quantum sensitized solar cells, the low-cost CuS cathode is created using electrophoresis. High resolution scanning electron microscopy and X-ray diffraction were used to analyze the structure and morphology of structural cubic samples with diameters ranging from 40 nm to 200 nm. The conversion efficiency of solar cells is significantly impacted by the calcination temperatures of cathodes at 100 °C, 120 °C, 150 °C, and 180 °C under vacuum. The fluorine doped tin oxide (FTO)/CuS cathode electrode reached a maximum efficiency of 3.89% when it was calcined at 120 °C. Compared to other temperature combinations, CuS nanoparticles crystallize at 120 °C, which lowers resistance while increasing electron lifetime.
A progressive learning for structural tolerance online sequential extreme lea...TELKOMNIKA JOURNAL
This article discusses the progressive learning for structural tolerance online sequential extreme learning machine (PSTOS-ELM). PSTOS-ELM can save robust accuracy while updating the new data and the new class data on the online training situation. The robustness accuracy arises from using the householder block exact QR decomposition recursive least squares (HBQRD-RLS) of the PSTOS-ELM. This method is suitable for applications that have data streaming and often have new class data. Our experiment compares the PSTOS-ELM accuracy and accuracy robustness while data is updating with the batch-extreme learning machine (ELM) and structural tolerance online sequential extreme learning machine (STOS-ELM) that both must retrain the data in a new class data case. The experimental results show that PSTOS-ELM has accuracy and robustness comparable to ELM and STOS-ELM while also can update new class data immediately.
Electroencephalography-based brain-computer interface using neural networksTELKOMNIKA JOURNAL
This study aimed to develop a brain-computer interface that can control an electric wheelchair using electroencephalography (EEG) signals. First, we used the Mind Wave Mobile 2 device to capture raw EEG signals from the surface of the scalp. The signals were transformed into the frequency domain using fast Fourier transform (FFT) and filtered to monitor changes in attention and relaxation. Next, we performed time and frequency domain analyses to identify features for five eye gestures: opened, closed, blink per second, double blink, and lookup. The base state was the opened-eyes gesture, and we compared the features of the remaining four action gestures to the base state to identify potential gestures. We then built a multilayer neural network to classify these features into five signals that control the wheelchair’s movement. Finally, we designed an experimental wheelchair system to test the effectiveness of the proposed approach. The results demonstrate that the EEG classification was highly accurate and computationally efficient. Moreover, the average performance of the brain-controlled wheelchair system was over 75% across different individuals, which suggests the feasibility of this approach.
Adaptive segmentation algorithm based on level set model in medical imagingTELKOMNIKA JOURNAL
For image segmentation, level set models are frequently employed. It offer best solution to overcome the main limitations of deformable parametric models. However, the challenge when applying those models in medical images stills deal with removing blurs in image edges which directly affects the edge indicator function, leads to not adaptively segmenting images and causes a wrong analysis of pathologies wich prevents to conclude a correct diagnosis. To overcome such issues, an effective process is suggested by simultaneously modelling and solving systems’ two-dimensional partial differential equations (PDE). The first PDE equation allows restoration using Euler’s equation similar to an anisotropic smoothing based on a regularized Perona and Malik filter that eliminates noise while preserving edge information in accordance with detected contours in the second equation that segments the image based on the first equation solutions. This approach allows developing a new algorithm which overcome the studied model drawbacks. Results of the proposed method give clear segments that can be applied to any application. Experiments on many medical images in particular blurry images with high information losses, demonstrate that the developed approach produces superior segmentation results in terms of quantity and quality compared to other models already presented in previeous works.
Automatic channel selection using shuffled frog leaping algorithm for EEG bas...TELKOMNIKA JOURNAL
Drug addiction is a complex neurobiological disorder that necessitates comprehensive treatment of both the body and mind. It is categorized as a brain disorder due to its impact on the brain. Various methods such as electroencephalography (EEG), functional magnetic resonance imaging (FMRI), and magnetoencephalography (MEG) can capture brain activities and structures. EEG signals provide valuable insights into neurological disorders, including drug addiction. Accurate classification of drug addiction from EEG signals relies on appropriate features and channel selection. Choosing the right EEG channels is essential to reduce computational costs and mitigate the risk of overfitting associated with using all available channels. To address the challenge of optimal channel selection in addiction detection from EEG signals, this work employs the shuffled frog leaping algorithm (SFLA). SFLA facilitates the selection of appropriate channels, leading to improved accuracy. Wavelet features extracted from the selected input channel signals are then analyzed using various machine learning classifiers to detect addiction. Experimental results indicate that after selecting features from the appropriate channels, classification accuracy significantly increased across all classifiers. Particularly, the multi-layer perceptron (MLP) classifier combined with SFLA demonstrated a remarkable accuracy improvement of 15.78% while reducing time complexity.
The CBC machine is a common diagnostic tool used by doctors to measure a patient's red blood cell count, white blood cell count and platelet count. The machine uses a small sample of the patient's blood, which is then placed into special tubes and analyzed. The results of the analysis are then displayed on a screen for the doctor to review. The CBC machine is an important tool for diagnosing various conditions, such as anemia, infection and leukemia. It can also help to monitor a patient's response to treatment.
UNLOCKING HEALTHCARE 4.0: NAVIGATING CRITICAL SUCCESS FACTORS FOR EFFECTIVE I...amsjournal
The Fourth Industrial Revolution is transforming industries, including healthcare, by integrating digital,
physical, and biological technologies. This study examines the integration of 4.0 technologies into
healthcare, identifying success factors and challenges through interviews with 70 stakeholders from 33
countries. Healthcare is evolving significantly, with varied objectives across nations aiming to improve
population health. The study explores stakeholders' perceptions on critical success factors, identifying
challenges such as insufficiently trained personnel, organizational silos, and structural barriers to data
exchange. Facilitators for integration include cost reduction initiatives and interoperability policies.
Technologies like IoT, Big Data, AI, Machine Learning, and robotics enhance diagnostics, treatment
precision, and real-time monitoring, reducing errors and optimizing resource utilization. Automation
improves employee satisfaction and patient care, while Blockchain and telemedicine drive cost reductions.
Successful integration requires skilled professionals and supportive policies, promising efficient resource
use, lower error rates, and accelerated processes, leading to optimized global healthcare outcomes.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Sinan KOZAK
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
International Conference on NLP, Artificial Intelligence, Machine Learning an...gerogepatton
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
2. ISSN: 1693-6930
TELKOMNIKA Vol 16, No 1: February 2018 : 323 – 333
324
not complicated. It is conducted by modulo sum operation. Meanwhile, the original message
reformation is relatively complicated. It requires Chinese remainder theorem [6]. Conventional
secret sharing scheme is very inefficient in information theory. A secret sharing scheme (k, n)
expands a secret message with length of b bits into n number of shares with a minimum size of
b bits. Since only k share pieces required to reform the original secret, each bit in share holds a
maximum of [1/k] bit of a secret. In case of non-threshold scheme (k=n), the information stored
on every bit of the share is [1/n] bit of a secret [7].
Visual cryptography is one of the result of secret sharing scheme development. The aim
of this method is to split a digital secret image into a number of shares. These shares should be
compiled and stacked together to reform the original digital image without requiring any
calculations. However, the conventional method of visual cryptography also have drawback in
terms of efficiency, i.e. the number of secret bits stored per bit share. In 2002, recursive secrecy
methods was introduced by Kak. S. to be applied to digital image and text[8],. The idea of this
method is to conceal a secret message by splitting the secret message into smaller secret
segments. Every segment will be stored/embedded recursively, with the size of segment secrets
will be double at each step. As a result, it can increase the amount of information that can be
stored on each bit of a secret. However, this scheme is categorized as a non-threshold scheme
where all shares should be collected to recover the original secret. In 2010, Kak S, and Abishek
Parakh developed the idea of secret hiding recursively into 2 of 3 threshold scheme and applied
it to a secret digital image [9]. However this scheme can only be applied to binary images where
each pixel is considered a one bit per information, representing a black or white pixel [6] Based
on explanation of previous work in second and third paragraph, there is a question about which
method provides the best level of security for securing handwritten images while provides high
level of efficiency as well.
In this paper, we evaluate the performance of the three most well known secret image
based sharing methods, i.e. secret splitting, secret sharing, and visual cryptography in securing
the handwritten image. The parameters to be tested in the analysis include the length of
execution time of the distribution process and reconstruction, image size share obtained along
with the level of resistance to changes in the content of the image method share. After this
research, we expect to give recommendation to readers about the best secret image based
sharing method for securing handwritten image in terms of level of security and efficiency. This
paper itself is organized as follow. Section 2 discusses about the literature review of three
evaluated methods. Section 3 discusses about research methodology that is used in this paper.
Section 4 discusses about the simulation result and analysis of the result. Finally, we conclude
the result of the research in section 5.
2. Literature Review
When someone wants to transmit message with another party, the person surely wants
the message to be safely transmitted. The safety here mean that the message could not be
read by any unauthorized party. This safety issue recognized as message confidentiality [10]. In
this section, we summarize the three visual cryptography method that we evaluate in this paper.
2.1. Secret Splitting
Secret spiltting method splits secret message into several shares and distribute them to
some people with the aim to keep the secret of the message[11]. In this case, messages can
represent the secret key that serves as the only access to information which is a highly
confidential and sensitive. Secret Splitting utilizing random numbers generated by the
multispeed-inner-generator. Secret splitting algorithm process is defined as follows:
a. Determine how many parts of a message (x), (P) to be split up.
b. Produce as much random numbers (x-1).
c. Perform the operations (1):
K(x)=K(1) K(2) K(3) … K(x-1) P (1)
d. K K (1), (2) ... K (x) and P is the fraction of the message is deleted.
If there are others who change one bit in any pieces, then the message (P) will not
be reopened.
e. To open or stir up a message (P), perform the operation (2)
P=K(1) K(2) K(3) … K(x) (2)
3. TELKOMNIKA ISSN: 1693-6930
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual… (Sugianto)
325
2.2. Secret Sharing
Similar to public key cryptographic algorithm, the key formation of secret sharing
algorithm produces the private key and public key. These keys are used in the formation of
shadow. The private key and the public in Secret Sharing algorithm Asmuth-Bloom can be [12]
defined as follows:
a. The public key (public key) of all users, which is primes p.
Primes p can be raised by using the Rabin-Miller algorithm. Another way is to input
manually and perform testing using an algorithm of primes testing method of Rabin-Miller.
Primes p must be greater than the ASCII Code of the message. Since the value of the
ASCII Code 255 is the largest primes, the value of p must be greater than 255.
b. The private key (private key) of each user, which is a row of values d1 … dn.
Row value d can be specified manually or generated randomly by meeting some of the
following requirements:
a) Row values d in ascending order, di < di+1.
b) Each value di relatively Prime to any value di etc.
c) d1 * d2 * … * dm < p * dn-m+2 * dn-m+3 * … * dn
Moreover, the process of forming the key will also generate values of m and n where m
is the number of shadow values required to form the message and the value of n is the number
of the desired shadow. The formation process of these keys can be described in the form of a
flowchart as shown in Figure 1. The shadow formation of secret sharing algorithm can be
described in the form of flowchart as shown by Figure 2.
Figure 1. The key formation of asmuth-bloom
secret sharing algorithm
Figure 2. The shadow formation of asmuth-
bloom secret sharing algorithm
The shadow formation of secret sharing algorithm uses the output of the key formation
which is the private key and the public key of the user. The shadow formation of secret sharing
4. ISSN: 1693-6930
TELKOMNIKA Vol 16, No 1: February 2018 : 323 – 333
326
is performed by the author of the message. The result of this process is n shadows that are
distributed to n person. Each person has a different value of the shadow.
The shadow merging process of secret sharing algorithm uses the output of the key
formation which is the private key and the public key of the user. It also uses m shadow. The
shadow merging process of secret sharing algorithm is performed by m people who want to
reconstruct the original message. The result of this process is the original message that was
concealed by the message’s producer. The shadow merging process using Chinese Remainder
Theorem is aimed to look for the solution of the linear congruent system formed from the
combined m shadow and m values di [13]. The shadow merging process of Asmuth-Bloom
secret sharing algorithm can be described in the form of flowcharts as Figure 3.
Figure 3. The shadow merging process of asmuth-bloom secret sharing algorithm
2.3. Threshold Visual Cryptography
The procedure of Recursive Threshold Visual Cryptography algorithm can be divided
into two phases [14], i.e.:
a. The shadow formation phase: In this phase, a set of share files are generated. As for the
procedure of work of this phase can be seen in Figure 4 [15]: The phase is started by
entering the binary image and defining the number of k and n. Then, it check whether the
image size is the rank of n. If yes, then it convert image to form a row of binary bits. If not,
then it add white pixels until the height of image equals to the rank of n. Then the process is
continued until n share is successfully generated.
b. Phase Merger Shadow, serves to reconstruct the original image by using a set of
predetermined share. The working procedure of this phase can be seen in Figure 5: It is
started by entering k image and numbers of n. Then it checks whether value of k > n. If yes,
then it will enter another value of k. If no, then it converts images to form a row of binary
bits. Then the process continued until the original image is successfully reconstructed.
5. TELKOMNIKA ISSN: 1693-6930
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual… (Sugianto)
327
Convert images to form a row of binary bits
Add white pixels to height of the image is
the rank of the n
Check if the image size is the rank of the n
Yes
No
k = 0 (index column)
k = k + 1
x = 0 (value rank)
Take nx
pixels from column to-k
Generate n share corresponds to the color
of pixels
nx
< height image x = x + 1
Yes
No
k < width image
Yes
No
Start
End
Input Of Binary Image
Input Numbers k and n
Show n share acquired with height = (n*nx
)
Figure 4. Flowchart of shadow formation phase
6. ISSN: 1693-6930
TELKOMNIKA Vol 16, No 1: February 2018 : 323 – 333
328
Convert images to form a row of binary bits
k > n
Yes
No
k = 0 (index column)
k = k + 1
Generate pixels with each process using n
pixels
k < Width image
Yes
No
Start
End
Input k image
Input Numbers n
Show image obtained
Figure 5. Flowchart of shadow merging phase
3. Research Method
In this research, we conduct a performance evaluation of the secret splitting, secret
sharing and recursive threshold visual cryptography method in providing security to the
handwritten image. The handwritten image can be either scanned images or images of
handwritten text documents. The process of securing the handwritten image is started from
identifying the problem to be solved. The problem is how to produce the share images and how
to specify the method that is suitable for safeguarding the handwritten images. Then, the
process is continued by selecting a suitalbe method which can be used. This process is
performed by literature study, i.e. reading books and sources on the internet.Then, we continue
to collect the data required in the system development process. After that, we create an
application that can be used to test the performance of each method. Lastly, there will be an
evaluation of the obtained test results. From the evaluation of the test results, the method that is
suitable for securing the image of handwriting will be identified.
For the evaluation part, The performance of the three methods discussed is compared
and evaluated using following method:
a. The length of time the execution of the manufacturing process and merger share
(reconstruction) share. The number of digital images captured each of the 20 pieces of
samples of [16]
b. The process of evaluation of the image of the reconstruction will use the formulation MSE.
MSE can directly reflect the quality difference between the two digital images. MSE is used
as a standard to calculate the quality of the original image and the image reconstruction
results.
MSE between two images can be calculated using the following formula (3):
(3)
7. TELKOMNIKA ISSN: 1693-6930
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual… (Sugianto)
329
Here, M, N is the width and height of the digital image, P1 (i, j) is the pixel value of the
original digital image, and P2 (i, j) is the pixel value of the digital image reconstruction
results [17].
4. Implementation and System Setup
In order to run the experiment, we need the hardware and software as defined by
Table 1. We perform the simulation using PC with processing capability pentium IV 2.6 GHz.
We utilize Microsoft Visual Basic 6.0 to run the simulation.
Table 1. Hardware and Software Specification
Hardw are Requirement
No Hardw are Type Specification
1 Processor Pentium IV 2.6 GHz
2 RAM 256 MB
3 Storage 80 GB
4 Display SVGA monitor resolution 1024 x 768
Softw are Requirement
No Softw are Type Specification
1 Operating System Window s 98/2000/XP
2 Tools Microsoft VisualBasic 6.0
5. Result and Discussion
In this section, we discuss about simulation results. We evaluate the performance of
three methods, i.e. secret splitting, secret sharing, and threshold visual cryptography in terms of
execution time (share and reconstruction) and the mean squared error (MSE) of reconstructed
image compared to the original secret image. We evaluate using n value=2-10. In this
simulation, we do not perform testing to the share size produced by the three methods because
secret splitting and sharing method do not generate additional pixels. Only the threshold visual
cryptography method that producess share image with different pixel size from the original
image.The size of image pixel produced by threshold visual cryptography method depends on
the number of shared files generated (n value). Figure 6 shows the share and reconstruction
time trend using secret splitting method for image size 100 ×100 pixel.
Figure 6. Sharing and reconstruction time using secret splitting for image size 100x100 pixel
Figure 6 shows that the share and reconstruction time increases linearly as the increase
of n value. From the value shown in the table, we can see that the value of share time when
n=10 increases almost 4 times compared to share time when n=2. While the value of
reconstruction time when n=10 increases almost 5 time compared to share time when n=2.
8. ISSN: 1693-6930
TELKOMNIKA Vol 16, No 1: February 2018 : 323 – 333
330
Figure 7 and Figure 8 show the share and reconstruction time using secret splitting method for
image size 150 ×150 pixel and 200 ×200 pixel, respectively. If we compare the share time when
n=10 for three image sizes, we can see that share time increase 2 times when image size
increased to 150 ×150 pixel and the share time increases 4 times when image size increased to
200 ×200 pixel. The same trend also occurs for the reconstruction time. This result means that
the share and reconstruction time increases linearly as the increase of image size.
Figure 7. Sharing and reconstruction time using secret splitting for image size 150x150 pixel
Figure 8. Sharing and reconstruction time using secret splitting for image size 200x200 pixel
In the second testing, we compare the performance sharing and reconstruction time of
secret splitting, secret sharing, and threshold visual cryptography. Figure 9 shows the share and
reconstruction time using secret sharing method for image size 100 ×100 pixel. While Figure 10
shows the share and reconstruction time using threshold visual cryptography method for image
size the same image size as the Figure 9. Figure 9 shows that using secret sharing method, the
share and reconstruction time increase linearly as the increase of n value. While, interestingly,
figure 10 shows that using the threshold visual cryptography method, the sharing time increase
exponentially as the linear increase of n value. The exponential increase occurs due to the
increase of share image size produced by threshold visual cryptography. When we compare the
result of Figure 6, Figure 9, and Figure 10, we can also see that the secret splitting produces the
9. TELKOMNIKA ISSN: 1693-6930
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual… (Sugianto)
331
shortest share and reconstruction time among the three methods. It means the secret splitting is
the most efficient algorithm among the three method for simulation parameter used in this
paper. Therefore, we can conclude that the secret splitting is the most appropriate algorithm
when applied practically.
Figure 9. Sharing and reconstruction time using secret sharing for image size 100x100 pixel
Figure 10. Sharing and reconstruction time using visual cryptography for image size 100x100
pixel
In the third testing, we evaluate the level of similarity between reconstructed image and
the original image of the three methods. We perform mean squared error (MSE) calculation to
evaluate the quality of the reconstructed image. We perform the simulation using n=2 -5 and
image size are 100 ×100 pixel and 150 ×150 pixel. From the simulation results it shows that the
MSE are zero for all scenario of simulation, which means the three methods shows excellent
reconstruction for the simulation parameter used in this paper.
Based on the result of our simulation results and our literature study in this paper, we
can evaluate the advantage and weakness of the three methods as follow: Secret splitting
method execution time is the fastest among the three methods that makes this method is the
most efficient when applied practically. It occurs because the secret splitting method contain a
very simple algorithm. It only uses string and randomization algorithm operation XOR. However,
the application of XOR operation makes the original image can be guessed easily if the tappers
managed to obtain some file shares. Secret sharing method shows almost similar execution to
the the secret splitting method. Secret sharing also perform better level of security due to the
10. ISSN: 1693-6930
TELKOMNIKA Vol 16, No 1: February 2018 : 323 – 333
332
involvement of Chinese Remainder method during the secret image reconstruction. The
application of Chinese Remainder method is also very efficient when applied practically
because the execution time is fairly quick. Furthermore the secret sharing method does not
require all the file shares to reconstruct the orignal image, unlike the secret splitting. It means,
the secret sharing is better in terms of reconstruction efficiency. Threshold visual cryptography
method shows fairly quick execution time, eventhough it increases exponentially as the linear
increase of n value. However, this method produces larger size of image files share compared
to the original image. In addition, the threshold visual cryptography method only requires two
pieces of the file share to reconstruct the original image. It means the attacker can reconstruct
the image if they can collect only two images shares. In the future, it is interesting to perform the
simulation and evaluation for bigger size of image and bigger n value to check the trend of MSE
of the three methods.
6. Conclusion
In this paper, we have performed literature study and performance evaluation of
security method for handwritten image. We have evaluated the performance of three most well
known method, i.e. secret splitting, secret sharing, and threshold visual cryptography. In general
the three methods contain a shadow making application that splits an image file into multiple file
fragments shadow. The simulation results shows that secret splitting produces shortest
execution time among the three methods which means it is the most efficient for practical
situation. The MSE simulation shows that three methods shows excellent performance in image
reconstruction. In the future, it is interesting to perform more simulation for various image size
and number of share image (n value).
References
[1] Pakshwar R, Trivedi VK, Richhariya V. A Survey on Different Image Encryption and Decryption
Techniques. Int J Comput Sci Inf Technol. 2013; 4(1): 113–6.
[2] Sharma A, Srivastava DK. A Comprehensive View on Encryption Techniques of Visual Cryptography.
Int J Recent Res Rev. 2014; 7(2).
[3] Deng H, Song X. Chaos-Based Image Encryption Algorithm Using Decomposition. Indones J Electr
Eng Comput Sci. 2014; 12(1):575–83.
[4] Yong-Jun G, Li-Zheng G, Ming-Hui Z. Improved Multi-secret Sharing Scheme Based on One-Way
Function. Indonesian Journal ofElectrical Engineering and Computer Science (IJEECS). 2014; 12(6):
4463-4467.
[5] Anbarasi LJ, Mala GSA, Prassana DRL. Visual Secret Sharing of Color Image Using Extended
Asmuth Bloom Technique. In: Computational Intelligence in Data Mining-Volume 3. Springer; 2015:
555–62.
[6] Yan X, Lu Y, Liu L, Wan S, Ding W, Liu H. Chinese Remainder Theorem-Based SecretImage Sharing
for (k, n) Threshold. In: International Conference on Cloud Computing and Security. 2017: 433–40.
[7] Farras O, Padró C, Xing C, Yang A. Natural generalizations of threshold secret sharing. IEEE Trans
Inf Theory. 2014; 60(3): 652–64.
[8] Kumar S, Sharma RK. Recursive information hiding of secrets by random grids. Cryptologia. 2013;
37(2): 154–61.
[9] Parakh A, Kak S. Internet voting protocol based on improved implicit security. Cryptologia. 2010;
34(3): 258–68.
[10] Hwang SJ, Sung YH, Chi JF. Deniable authentication protocols with confidentiality and anonymous
fair protections. In: Advances in Intelligent Systems and Applications-Volume 2. Springer; 2013: 41-
51.
[11] Husain AK, Rahman AARA. A New Scheme for Pseudo Random Numbers Generator Based on
Secret Splitting. Int J Soft Comput Eng (IJSCE) ISSN. 2015; 2231–307.
[12] Muhammad YI, Kaiiali M, Habbal A, Wazan AS, Sani Ilyasu A. A secure data outsourcing scheme
based on Asmuth--Bloom secret sharing. Enterp Inf Syst. 2016; 10(9):1001–23.
[13] Harn L, Fuyou M, Chang C-C. Verifiable secret sharing based on the Chinese remainder theorem.
Secur Commun Networks. 2014; 7(6): 950–7.
[14] Rathore AK, Jain A. A Review on Various Implemented Techniques for Visual Cryptography. Int J
Comput Appl. 2016; 155(5).
[15] Yan X, Wang S, Niu X, Yang C-N. Generalized random grids-based threshold visual cryptographywith
meaningful shares. Signal Processing. 2015; 109: 317–33.
11. TELKOMNIKA ISSN: 1693-6930
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual… (Sugianto)
333
[16] Yann Lecun, Corrina Cortes CJCB. MNIST handwritten digit database, Yann LeCun, Corinna Cortes
and Chris Burges [Internet]. [cited 2017 Dec 22]. Available from: http://yann.lecun.com/exdb/mnist/
[17] Candes EJ, Eldar YC, Strohmer T, Voroninski V. Phase retrieval via matrix completion. SIAM Rev.
2015; 57(2):225–51.