This document proposes a scheme to enhance the security of visual cryptographic shares by encrypting the shares using public key encryption. It discusses visual cryptography and how shares can be intercepted if transmitted over a public network. The proposed scheme generates shares using visual cryptography, then encrypts each share using RSA public key encryption. At the destination, the shares are decrypted using RSA and then overlapped using visual cryptography to reveal the secret image. Experimental results show that an adversary unable to decrypt the encrypted shares without the private key, but the secret image is revealed when decrypting and overlapping the correct shares. The scheme provides double security to secret images during transmission over public networks.
11.biometric data security using recursive visual cryptographyAlexander Decker
This document summarizes a research paper on using recursive visual cryptography and biometric authentication to securely store biometric data. The paper proposes a scheme where secrets can be recursively embedded within image shares created by visual cryptography. Additionally, biometric authentication is used to securely access the shares. The scheme involves creating shares of secrets, embedding those shares as additional secrets within other shares, and authenticating users through iris recognition before revealing embedded secrets. This allows for multiple secrets to be hidden and revealed securely through the visual cryptography and biometric authentication methods combined.
A comparatively study on visual cryptographyeSAT Journals
Abstract The effective and secure protections of sensitive information are primary concerns in commercial, medical and military systems. To address the reliability problems for secret images, a visual cryptography scheme is a good alternative to remedy the vulnerabilities. Visual cryptography is a very secure and unique way to protect secrets. Visual cryptography is an encryption technique which is used to hide information which is present in an image. Unliketraditional cryptographic schemes, it uses human eyes to recover the secret without any complex decryption algorithms and the facilitate of computers. It is a secret sharing scheme which uses images distributed as shares such that, when the shares are superimposed, a hidden secret image is revealed.In this paper we represent various cryptography technique and research work done in this field. Keywords: Secret image sharing, cryptography, visual quality of image, pixel expansion
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document summarizes research on visual cryptography for securing black and white images. It discusses how visual cryptography works by breaking up a secret image into shares such that stacking the shares reveals the secret image to the human visual system without computation. The document also outlines Naor and Shamir's original (2,2) visual cryptography scheme and discusses extensions to the scheme including supporting multiple secrets and improving image quality and size. Finally, it notes that visual cryptography provides robust security for images while eliminating the need for computers during decryption.
This document summarizes a research paper that proposes a method for securely sharing visual secrets using click point encryption. The method uses click points selected on an image as an encryption key to encrypt secret data using AES encryption. The encrypted data is then embedded into the image using least significant bit replacement. Only someone with the click point key received through a secure channel can decrypt and view the secret data. The document reviews related work on visual cryptography and identifies limitations like lack of authentication. It then describes the proposed method in more detail, including the AES encryption process, generating encryption keys from click points, and embedding the encrypted data into the image.
Design and implementation of hierarchical visualIJNSA Journal
Novel idea of hierarchical visual cryptography is stated in this paper. The key concept of hierarchical
visual cryptography is based upon visual cryptography. Visual cryptography encrypts secret information
into two pieces called as shares. These two shares are stacked together by logical XOR operation to reveal
the original secret. Hierarchical visual cryptography encrypts the secret in various levels. The encryption
in turn is expansionless. The original secret size is retained in the shares at all levels. In this paper secret is
encrypted at two different levels. Four shares are generated out of hierarchical visual cryptography. Any
three shares are collectively taken to form the key share. All shares generated are meaningless giving no
information by visual inspection. Performance analysis is also obtained based upon various categories of
secrets. The greying effect is completely removed while revealing the secret Removal of greying effect do
not change the meaning of secret.
This document summarizes various visual cryptography schemes. It discusses 9 different schemes that aim to improve on basic visual cryptography in areas like supporting color and grayscale images, generating meaningful share images, reducing pixel expansion, and hiding information in multiple regions of an image. The concluding paragraph states that the single image random dot stereogram method seems most advantageous as it can overcome problems of pixel expansion and quality degradation when recovering images.
MEANINGFUL AND UNEXPANDED SHARES FOR VISUAL SECRET SHARING SCHEMESijiert bestjournal
In today�s internet world it is very essential to secretly share biometric data stored in the central database. There are so many options to secretly share biometri c data using cryptographic computation. This work reviews and applies a perfectly secure method to secretly share biometric data,for possible use in biometric authentication and protection based on conc ept of visual cryptography. The basic concept of proposed approach is to secretly share private imag e into two meaningful and unexpanded shares (sheets) that are stored in two separate database servers such that decryption can be performed only when both shares are simultaneously available;at the same ti me,the individual share do not open identity of the private image. Previous research,such as Arun Ross et al. in 2011,was using pixel expansion for encryption,which causes the waste of storage space and transmission time. Furthermore,some researcher such as Hou and Quan�s research in 2011,producing m eaningless shares,which causes visually revealing existence of secret image. In this work,we review visual cryptography scheme and apply them to secretly share biometric data such as fingerprint,face images for the purpose of user authentication. So,using this technique we can secretly share biometric data over internet and only authorized user can decrypt the information.
11.biometric data security using recursive visual cryptographyAlexander Decker
This document summarizes a research paper on using recursive visual cryptography and biometric authentication to securely store biometric data. The paper proposes a scheme where secrets can be recursively embedded within image shares created by visual cryptography. Additionally, biometric authentication is used to securely access the shares. The scheme involves creating shares of secrets, embedding those shares as additional secrets within other shares, and authenticating users through iris recognition before revealing embedded secrets. This allows for multiple secrets to be hidden and revealed securely through the visual cryptography and biometric authentication methods combined.
A comparatively study on visual cryptographyeSAT Journals
Abstract The effective and secure protections of sensitive information are primary concerns in commercial, medical and military systems. To address the reliability problems for secret images, a visual cryptography scheme is a good alternative to remedy the vulnerabilities. Visual cryptography is a very secure and unique way to protect secrets. Visual cryptography is an encryption technique which is used to hide information which is present in an image. Unliketraditional cryptographic schemes, it uses human eyes to recover the secret without any complex decryption algorithms and the facilitate of computers. It is a secret sharing scheme which uses images distributed as shares such that, when the shares are superimposed, a hidden secret image is revealed.In this paper we represent various cryptography technique and research work done in this field. Keywords: Secret image sharing, cryptography, visual quality of image, pixel expansion
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document summarizes research on visual cryptography for securing black and white images. It discusses how visual cryptography works by breaking up a secret image into shares such that stacking the shares reveals the secret image to the human visual system without computation. The document also outlines Naor and Shamir's original (2,2) visual cryptography scheme and discusses extensions to the scheme including supporting multiple secrets and improving image quality and size. Finally, it notes that visual cryptography provides robust security for images while eliminating the need for computers during decryption.
This document summarizes a research paper that proposes a method for securely sharing visual secrets using click point encryption. The method uses click points selected on an image as an encryption key to encrypt secret data using AES encryption. The encrypted data is then embedded into the image using least significant bit replacement. Only someone with the click point key received through a secure channel can decrypt and view the secret data. The document reviews related work on visual cryptography and identifies limitations like lack of authentication. It then describes the proposed method in more detail, including the AES encryption process, generating encryption keys from click points, and embedding the encrypted data into the image.
Design and implementation of hierarchical visualIJNSA Journal
Novel idea of hierarchical visual cryptography is stated in this paper. The key concept of hierarchical
visual cryptography is based upon visual cryptography. Visual cryptography encrypts secret information
into two pieces called as shares. These two shares are stacked together by logical XOR operation to reveal
the original secret. Hierarchical visual cryptography encrypts the secret in various levels. The encryption
in turn is expansionless. The original secret size is retained in the shares at all levels. In this paper secret is
encrypted at two different levels. Four shares are generated out of hierarchical visual cryptography. Any
three shares are collectively taken to form the key share. All shares generated are meaningless giving no
information by visual inspection. Performance analysis is also obtained based upon various categories of
secrets. The greying effect is completely removed while revealing the secret Removal of greying effect do
not change the meaning of secret.
This document summarizes various visual cryptography schemes. It discusses 9 different schemes that aim to improve on basic visual cryptography in areas like supporting color and grayscale images, generating meaningful share images, reducing pixel expansion, and hiding information in multiple regions of an image. The concluding paragraph states that the single image random dot stereogram method seems most advantageous as it can overcome problems of pixel expansion and quality degradation when recovering images.
MEANINGFUL AND UNEXPANDED SHARES FOR VISUAL SECRET SHARING SCHEMESijiert bestjournal
In today�s internet world it is very essential to secretly share biometric data stored in the central database. There are so many options to secretly share biometri c data using cryptographic computation. This work reviews and applies a perfectly secure method to secretly share biometric data,for possible use in biometric authentication and protection based on conc ept of visual cryptography. The basic concept of proposed approach is to secretly share private imag e into two meaningful and unexpanded shares (sheets) that are stored in two separate database servers such that decryption can be performed only when both shares are simultaneously available;at the same ti me,the individual share do not open identity of the private image. Previous research,such as Arun Ross et al. in 2011,was using pixel expansion for encryption,which causes the waste of storage space and transmission time. Furthermore,some researcher such as Hou and Quan�s research in 2011,producing m eaningless shares,which causes visually revealing existence of secret image. In this work,we review visual cryptography scheme and apply them to secretly share biometric data such as fingerprint,face images for the purpose of user authentication. So,using this technique we can secretly share biometric data over internet and only authorized user can decrypt the information.
Genetic Algorithm based Mosaic Image Steganography for Enhanced SecurityIDES Editor
The document summarizes previous work on mosaic image steganography and proposes using genetic algorithms and key-based random permutation to improve the technique. Mosaic image steganography hides a secret image by dividing it into fragments and embedding the fragments into a target image to create a mosaic. Previous methods required a large database of images or allowed only arbitrary target image selection. The proposed method uses genetic algorithms to generate a mapping sequence for embedding tile images without a database, improving clarity and reducing computational complexity. It also applies a key-based random permutation to the mapping sequence for enhanced security and robustness. The mosaic image can be recovered using the same key and mapping sequence, making it a lossless data hiding method.
A Novel Visual Cryptographic Scheme Using Floyd Steinberg Half Toning and Block Replacement Algorithms Nisha Menon K – PG Scholar,
Minu Kuriakose – Assistant Professor,
Department of Electronics and Communication,
Federal Institute of Science and Technology, Ernakulam, India
This document proposes a variable length key-based visual cryptography scheme for encrypting color images. It involves encrypting the original image using a variable length symmetric key, generating shares of the encrypted image using random numbers, and decrypting the shares by stacking a minimum number of shares and applying the same encryption key. The proposed scheme aims to improve security over simple visual cryptography by using an encryption key and random number-based share generation, making the shares and encrypted image different from the original image. It is described as having less complex share generation than other techniques while providing security through the use of encryption and a variable length key.
RSA Based Secured Image Steganography Using DWT ApproachIJERA Editor
The need for keeping safe secrecy of secret and sensitive data has been ever increasing with the new
developments in digital system. In this paper, we present an increased way for getting embedding encrypted
secret facts in gray scale images to give high level safety of facts for news over unsecured narrow channels
Cryptography and Steganography are two closely related techniques are used in proposed system. Cryptography
gets into making one of religion the secret note into a non-recognizable chipper. Steganography is then sent in
name for using Double-Stegging to fix this encrypted data into a cover thing by which something is done and
keeps secret its existence.
Analysing secure image secret sharing schemes based on steganographyIAEME Publication
This document discusses secure image secret sharing schemes based on steganography. It provides background on secret sharing, visual cryptography, and steganography techniques like least significant bit insertion, adaptive MELSBR method, and bit plane complexity segmentation. The document analyzes how combining secret sharing and steganography can make secret sharing schemes more secure by embedding shares in cover images, making them less obvious to attackers. It reviews few existing methods that combine secret sharing and information hiding and identifies limitations like low reliability, large shadow size, and constraints on secret image size. The intent of the paper is to explain how secret sharing combined with steganography improves security and to guide selection of a scheme for different needs.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
An improved color image encryption algorithm with pixel permutation and bit s...eSAT Journals
Abstract Today the transmission of multimedia data including image and video is growing in telecommunications. Security is one of the main issues in transferring such sensitive information. Powerful image encryption algorithm is the solution for this problem. This paper is an implementation of a color image encryption algorithm based on Rubik’s cube technique. The Rubik’s cube technique is used for pixel permutation and a bit substitution method based on DNA sequences are used to change the value of each pixel on the image. Then the time-stamp is appended with encrypted image, which can be used to identify the replay attack. For evaluating the performance of the algorithm a series of tests are performed. These tests include information entropy analysis, correlation analysis, analysis of NPCR and UACI values etc. Index Terms: Cryptography, encryption, decryption, timestamp, replay attack, plaintext, cipher-text, algorithm, chaos.
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.
Color Image Encryption and Decryption Using Multiple Chaotic MapsIJTET Journal
Owing to advances in communication technology, a bulk of visual digital data is being stored and transmitted over the internet now-a-days. Particularly millions and millions of images transfer through the network per day as per the statistics and a result, the security of image data is an important requirement. Image encryption algorithm is used to provide this security. In this paper, an image encryption algorithm based on confusion diffusion architecture that uses dynamic key space is proposed. An internal key generator is used to generate the initial seeds for the overall encryption scheme is proposed. With these initial seeds logistic map generates pseudo random numbers then these numbers are converted into permutation order for permutation. The diffusion bits are generated in parallel using the logistic map and manipulated with pixels confused. The image pixels are iteratively confused and diffused using permutation order and diffusion bits respectively to produce cipher image in minimum number of rounds. This paper proposes a new kind of initial seed generation that utilizes the combo of logistic and tent maps. Even all external seeds are same. The internal seeds will be totally different. This ensures the key sensitivity. The simulation results and analysis confirm that the satisfactory level of security is achieved in three rounds and overall encryption time is saved.
HYBRIDIZATION OF DCT BASED STEGANOGRAPHY AND RANDOM GRIDSIJNSA Journal
The document discusses a hybrid approach to steganography and visual cryptography for improved data security. It proposes combining principles of steganography, which hides data in a cover media, and visual cryptography, which encrypts images in a way that can be decrypted by human vision without algorithms. Specifically, it describes generating two random grids from a secret image that reveal the image when overlaid but hide it individually. The random grids are created by inverting or substituting pixels based on the secret image. This hybrid approach aims to provide stronger security than either technique alone by incorporating advantages of both.
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.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Image and text Encryption using RSA algorithm in java PiyushPatil73
This document provides an overview and implementation details of an image and text encryption/decryption project using RSA encryption. It includes chapters on introduction/background, hardware/software specifications, feasibility study, preliminary design including ER diagram and data flow diagram, screen layouts, testing approach including white and black box testing, and implementation details of the modules. The implementation utilizes Java and generates RSA public/private key pairs to encrypt and decrypt text and images.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A novel technique of visual cryptography for maintaining the security of visu...IAEME Publication
This document summarizes a research paper that proposes a novel technique for visual cryptography to securely transmit visual information. The technique encrypts images into shares using chaotic pseudo-random number generation, zigzag scan pattern, and pixel index reversal to increase security. It also aims to reduce image degradation by applying the methods to individual RGB color channels rather than just grayscale. The results demonstrate that the proposed approach increases security without increasing file size like previous methods, and improves image quality by enabling color images.
This document summarizes a proposed virtual watermarking technique for color images. The technique embeds a secret sub-image into a cover image by generating an index array through comparing bits between the images, rather than directly altering the cover image. The index array is encrypted and sent to the receiver along with an encryption key. The receiver decrypts the index array and applies reverse virtual watermarking using the common cover image to extract the original sub-image, without the cover image needing to be transmitted. This avoids potential attacks on the cover image during transmission.
Reversible Multiple Image Secret Sharing using Discrete Haar Wavelet Transform IJECEIAES
Multiple Secret Image Sharing scheme is a protected approach to transmit more than one secret image over a communication channel. Conventionally, only single secret image is shared over a channel at a time. But as technology grew up, there is a need to share more than one secret image. A fast (r, n) multiple secret image sharing scheme based on discrete haar wavelet transform has been proposed to encrypt m secret images into n noisy images that are stored over different servers. To recover m secret images r noise images are required. Haar Discrete Wavelet Transform (DWT) is employed as reduction process of each secret image to its quarter size (i.e., LL subband). The LL subbands for all secrets have been combined in one secret that will be split later into r subblocks randomly using proposed high pseudo random generator. Finally, a developed (r, n) threshold multiple image secret sharing based one linear system has been used to generate unrelated shares. The experimental results showed that the generated shares are more secure and unrelated. The size reductions of generated shares were 1:4r of the size of each of original image. Also, the randomness test shows a good degree of randomness and security.
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual...TELKOMNIKA JOURNAL
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.
This document discusses a proposed method for document image authentication using harmonic secret sharing and permutation. The method generates shares from a document image using Shamir's secret sharing scheme and embeds the shares in the alpha channel plane of a PNG image. During authentication, the shares extracted from the alpha channel are used to verify blocks of the document image. If a block is tampered, the method can repair it using reverse Shamir on collected shares from untampered blocks. The method aims to authenticate documents, verify owners, detect and correct errors, and localize alterations with secret sharing and permutation for security.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Genetic Algorithm based Mosaic Image Steganography for Enhanced SecurityIDES Editor
The document summarizes previous work on mosaic image steganography and proposes using genetic algorithms and key-based random permutation to improve the technique. Mosaic image steganography hides a secret image by dividing it into fragments and embedding the fragments into a target image to create a mosaic. Previous methods required a large database of images or allowed only arbitrary target image selection. The proposed method uses genetic algorithms to generate a mapping sequence for embedding tile images without a database, improving clarity and reducing computational complexity. It also applies a key-based random permutation to the mapping sequence for enhanced security and robustness. The mosaic image can be recovered using the same key and mapping sequence, making it a lossless data hiding method.
A Novel Visual Cryptographic Scheme Using Floyd Steinberg Half Toning and Block Replacement Algorithms Nisha Menon K – PG Scholar,
Minu Kuriakose – Assistant Professor,
Department of Electronics and Communication,
Federal Institute of Science and Technology, Ernakulam, India
This document proposes a variable length key-based visual cryptography scheme for encrypting color images. It involves encrypting the original image using a variable length symmetric key, generating shares of the encrypted image using random numbers, and decrypting the shares by stacking a minimum number of shares and applying the same encryption key. The proposed scheme aims to improve security over simple visual cryptography by using an encryption key and random number-based share generation, making the shares and encrypted image different from the original image. It is described as having less complex share generation than other techniques while providing security through the use of encryption and a variable length key.
RSA Based Secured Image Steganography Using DWT ApproachIJERA Editor
The need for keeping safe secrecy of secret and sensitive data has been ever increasing with the new
developments in digital system. In this paper, we present an increased way for getting embedding encrypted
secret facts in gray scale images to give high level safety of facts for news over unsecured narrow channels
Cryptography and Steganography are two closely related techniques are used in proposed system. Cryptography
gets into making one of religion the secret note into a non-recognizable chipper. Steganography is then sent in
name for using Double-Stegging to fix this encrypted data into a cover thing by which something is done and
keeps secret its existence.
Analysing secure image secret sharing schemes based on steganographyIAEME Publication
This document discusses secure image secret sharing schemes based on steganography. It provides background on secret sharing, visual cryptography, and steganography techniques like least significant bit insertion, adaptive MELSBR method, and bit plane complexity segmentation. The document analyzes how combining secret sharing and steganography can make secret sharing schemes more secure by embedding shares in cover images, making them less obvious to attackers. It reviews few existing methods that combine secret sharing and information hiding and identifies limitations like low reliability, large shadow size, and constraints on secret image size. The intent of the paper is to explain how secret sharing combined with steganography improves security and to guide selection of a scheme for different needs.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
An improved color image encryption algorithm with pixel permutation and bit s...eSAT Journals
Abstract Today the transmission of multimedia data including image and video is growing in telecommunications. Security is one of the main issues in transferring such sensitive information. Powerful image encryption algorithm is the solution for this problem. This paper is an implementation of a color image encryption algorithm based on Rubik’s cube technique. The Rubik’s cube technique is used for pixel permutation and a bit substitution method based on DNA sequences are used to change the value of each pixel on the image. Then the time-stamp is appended with encrypted image, which can be used to identify the replay attack. For evaluating the performance of the algorithm a series of tests are performed. These tests include information entropy analysis, correlation analysis, analysis of NPCR and UACI values etc. Index Terms: Cryptography, encryption, decryption, timestamp, replay attack, plaintext, cipher-text, algorithm, chaos.
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.
Color Image Encryption and Decryption Using Multiple Chaotic MapsIJTET Journal
Owing to advances in communication technology, a bulk of visual digital data is being stored and transmitted over the internet now-a-days. Particularly millions and millions of images transfer through the network per day as per the statistics and a result, the security of image data is an important requirement. Image encryption algorithm is used to provide this security. In this paper, an image encryption algorithm based on confusion diffusion architecture that uses dynamic key space is proposed. An internal key generator is used to generate the initial seeds for the overall encryption scheme is proposed. With these initial seeds logistic map generates pseudo random numbers then these numbers are converted into permutation order for permutation. The diffusion bits are generated in parallel using the logistic map and manipulated with pixels confused. The image pixels are iteratively confused and diffused using permutation order and diffusion bits respectively to produce cipher image in minimum number of rounds. This paper proposes a new kind of initial seed generation that utilizes the combo of logistic and tent maps. Even all external seeds are same. The internal seeds will be totally different. This ensures the key sensitivity. The simulation results and analysis confirm that the satisfactory level of security is achieved in three rounds and overall encryption time is saved.
HYBRIDIZATION OF DCT BASED STEGANOGRAPHY AND RANDOM GRIDSIJNSA Journal
The document discusses a hybrid approach to steganography and visual cryptography for improved data security. It proposes combining principles of steganography, which hides data in a cover media, and visual cryptography, which encrypts images in a way that can be decrypted by human vision without algorithms. Specifically, it describes generating two random grids from a secret image that reveal the image when overlaid but hide it individually. The random grids are created by inverting or substituting pixels based on the secret image. This hybrid approach aims to provide stronger security than either technique alone by incorporating advantages of both.
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.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Image and text Encryption using RSA algorithm in java PiyushPatil73
This document provides an overview and implementation details of an image and text encryption/decryption project using RSA encryption. It includes chapters on introduction/background, hardware/software specifications, feasibility study, preliminary design including ER diagram and data flow diagram, screen layouts, testing approach including white and black box testing, and implementation details of the modules. The implementation utilizes Java and generates RSA public/private key pairs to encrypt and decrypt text and images.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A novel technique of visual cryptography for maintaining the security of visu...IAEME Publication
This document summarizes a research paper that proposes a novel technique for visual cryptography to securely transmit visual information. The technique encrypts images into shares using chaotic pseudo-random number generation, zigzag scan pattern, and pixel index reversal to increase security. It also aims to reduce image degradation by applying the methods to individual RGB color channels rather than just grayscale. The results demonstrate that the proposed approach increases security without increasing file size like previous methods, and improves image quality by enabling color images.
This document summarizes a proposed virtual watermarking technique for color images. The technique embeds a secret sub-image into a cover image by generating an index array through comparing bits between the images, rather than directly altering the cover image. The index array is encrypted and sent to the receiver along with an encryption key. The receiver decrypts the index array and applies reverse virtual watermarking using the common cover image to extract the original sub-image, without the cover image needing to be transmitted. This avoids potential attacks on the cover image during transmission.
Reversible Multiple Image Secret Sharing using Discrete Haar Wavelet Transform IJECEIAES
Multiple Secret Image Sharing scheme is a protected approach to transmit more than one secret image over a communication channel. Conventionally, only single secret image is shared over a channel at a time. But as technology grew up, there is a need to share more than one secret image. A fast (r, n) multiple secret image sharing scheme based on discrete haar wavelet transform has been proposed to encrypt m secret images into n noisy images that are stored over different servers. To recover m secret images r noise images are required. Haar Discrete Wavelet Transform (DWT) is employed as reduction process of each secret image to its quarter size (i.e., LL subband). The LL subbands for all secrets have been combined in one secret that will be split later into r subblocks randomly using proposed high pseudo random generator. Finally, a developed (r, n) threshold multiple image secret sharing based one linear system has been used to generate unrelated shares. The experimental results showed that the generated shares are more secure and unrelated. The size reductions of generated shares were 1:4r of the size of each of original image. Also, the randomness test shows a good degree of randomness and security.
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual...TELKOMNIKA JOURNAL
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.
This document discusses a proposed method for document image authentication using harmonic secret sharing and permutation. The method generates shares from a document image using Shamir's secret sharing scheme and embeds the shares in the alpha channel plane of a PNG image. During authentication, the shares extracted from the alpha channel are used to verify blocks of the document image. If a block is tampered, the method can repair it using reverse Shamir on collected shares from untampered blocks. The method aims to authenticate documents, verify owners, detect and correct errors, and localize alterations with secret sharing and permutation for security.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document summarizes a research paper that proposes an improved color visual cryptography scheme using Floyd error diffusion. Visual cryptography allows images to be encrypted into shares such that the secret image is only revealed when a sufficient number of shares are stacked together, without requiring any computational decryption. Existing color visual cryptography schemes produced low quality random shares. The proposed scheme uses the concepts of visual information pixels and error diffusion to generate high quality color shares that contain meaningful visual information. It introduces a new encryption method using visual cryptography matrices and cyclic redundancy checks to identify errors and verify authentication of shares. Experimental results show the new scheme produces better quality shares than previous methods and increases security.
An Intelligent System for Secured Authentication using Hierarchical Visual Cr...IDES Editor
This paper introduces the idea of hierarchical visual
cryptography. Authentication is the important issue over the
internet. This paper describes a secured authentication
mechanism with the help of visual cryptography. Visual
cryptography simply divides secret information in to number
of parts called shares. These shares are further transmitted
over the network and at the receiving end secrets are revealed
by superimposition. Many layers of visual cryptography exist
in proposed system hence called hierarchical visual
cryptography. Remote voting systems now a day’s widely using
visual cryptography for authentication purpose.
IRJET-Design and Fabrication of Automatic Plastic Cup Thermoforming MachineIRJET Journal
This document proposes a new encryption technique that combines visual cryptography and steganography for added security layers. A secret text message is first hidden in a cover image using steganography. The stego image is then sliced into shares using visual cryptography and transmitted over an open system. At the receiver end, the shares are stacked to reconstruct the cover image containing the hidden message, which can then be extracted using steganography. The technique aims to address issues like pixel expansion and memory requirements of previous methods by using unexpanded shares. It provides a less complex encryption/decryption system compared to other approaches.
A NOVEL METHOD FOR THE CONSTRUCTION OF THRESHOLD MULTIPLE-SECRET VISUAL CRYPT...Editor IJCATR
The main concept of the original visual secret sharing (VSS) scheme is to encrypt a secret image into n
meaningless share images. It cannot leak any information of the shared secret by any combination of the n share images
except for all of images. The shared secret image can be revealed by printing the share images on transparencies and
stacking the transparencies directly, so that the human visual system can recognize the shared secret image without using any
devices. The visual secrets sharing scheme for multiple secrets is called multiple-secret visual cryptographic schemes
(MVCSs). This paper proposed general constructions for threshold multiple-secret visual cryptographic schemes (MVCSs)
that are capable of encoding s secret images. This presented MVCS schemes utilize a predefined pattern book with pixel
expansion to encrypt secret images into share images. In our research, we propose a novel MVCS scheme that can share two
binary secret images on two rectangular share images with no pixel expansion, but also has an excellent recovery quality for
the secret images.
Design and Implementation of Hierarchical Visual Cryptography with Expansionl...IJNSA Journal
Novel idea of hierarchical visual cryptography is stated in this paper. The key concept of hierarchical visual cryptography is based upon visual cryptography. Visual cryptography encrypts secret information into two pieces called as shares. These two shares are stacked together by logical XOR operation to reveal the original secret. Hierarchical visual cryptography encrypts the secret in various levels. The encryption in turn is expansionless. The original secret size is retained in the shares at all levels. In this paper secret is encrypted at two different levels. Four shares are generated out of hierarchical visual cryptography. Any three shares are collectively taken to form the key share. All shares generated are meaningless giving no information by visual inspection. Performance analysis is also obtained based upon various categories of secrets. The greying effect is completely removed while revealing the secret Removal of greying effect do not change the meaning of secret.
The Cryptographic Schemes for Secret ImagesIJERA Editor
Visual cryptography is one of the techniques used to encrypt the images by dividing the original image into transparencies [1]. The transparencies can be sent to the intended person, and at the other end the transparencies received person can decrypt the transparencies using our tool, thus gets the original image. Our proposed Visual cryptography provides the demonstration to the users to show how encryption and decryption can be done to the images. In this technology, the end user identifies an image, which is not the correct image. That is, while transmitting the image the sender will encrypt the image using our application here sender gets the two or more transparencies of the same image. Our application provides an option to the end user of encryption. The end user can divide the original image into number of different images. Using our application we can send encrypted images that are in the format of GIF and PNG. The encrypted transparencies can be saved in the machine and can be sent to the intended person by other means [source].
Retrieving Of Color Images Using SDS TechniqueEditor IJMTER
How data can be shared from one part of the world to the other in near real time came with
the arrival of internet. Along with this they have introduced new challenges like maintaining the
confidentiality of transmitting the data. This gave a boost to the research area related to cryptography.
Firstly, Encryption of images with the accepted encryption algorithms had significant downside as key
management was complicated and limited. Secondly, introduction to new area for encrypting images
was splitting the image at its pixel level in to multiple shares. But the major drawback of this approach
was that the recovered image had a poor quality. To overcome these mentioned drawbacks we have
proposed a new approach which does not attempt to use any type of keys for encryption.
DESIGN AND ANALYSIS OF A NOVEL DIGITAL IMAGE ENCRYPTION SCHEMEIJNSA Journal
In this paper, a new image encryption scheme using a secret key of 144-bits is proposed. In the substitution process of the scheme, image is divided into blocks and subsequently into color components. Each color component is modified by performing bitwise operation which depends on secret key as well as a few most significant bits of its previous and next color component. Three rounds are taken to complete substitution process. To make cipher more robust, a feedback mechanism is also applied by modifying used secret key after encrypting each block. Further, resultant image is partitioned into several key based dynamic sub-images. Each sub-image passes through the scrambling process where pixels of sub-image are reshuffled within itself by using a generated magic square matrix. Five rounds are taken for scrambling process. The propose scheme is simple, fast and sensitive to the secret key. Due to high order of substitution and permutation, common attacks like linear and differential cryptanalysis are infeasible. The experimental results show that the proposed encryption technique is efficient and has high security features.
Digital image copyright protection based on visual cryptographyinventionjournals
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.
This document summarizes a research paper that proposes a new method for encrypting images with high security when transmitting over a network. The method involves dividing the source image into multiple parts, encrypting each part separately with a different encryption key, and then combining the encrypted parts into a single encrypted image for transmission. This provides stronger security than encrypting the whole image with a single key. The document provides background on existing image encryption techniques and visual cryptography. It then outlines the proposed new methodology, which first divides the source image into multiple smaller images, encrypts each part separately with a different algorithm/key, and has two options for transmission - sending all the encrypted parts individually or combining them into one encrypted image.
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.
Performance Evaluation of Hybrid Method for Securing and Compressing ImagesMangaiK4
Abstract—Security is a most important field of research work for sending and receiving of data in secret way over the network.Cryptographyis a method for securing transformation like image, audio, video, text without any hacking problem.Encryption and Decryption are two methods used to secure the data. Image compression technique used to reducing the size of an image for effective data communication. There are variety of algorithms has been proposed in the literature for securing images using encryption/decryption techniques and reduce the size of images using image compression techniques. These techniques still need improvement to overcome issues, challenges and its limitations. Hence in this research work a hybrid method which combines securing image using RSA, hill cipher and 2bit rotation and compressing of images using lossless compression algorithm has been proposed. This method compared to execution time of existing method. This method secures the image and reduces the size of the image for data communication over the internet. This method is suitable for various applications uses images like remote sensing, medical and Spatio-temporal.
At Softroniics we provide job oriented training for freshers in IT sector. We are Pioneers in all leading technologies like Android, Java, .NET, PHP, Python, Embedded Systems, Matlab, NS2, VLSI etc. We are specializiling in technologies like Big Data, Cloud Computing, Internet Of Things (iOT), Data Mining, Networking, Information Security, Image Processing, Mechanical, Automobile automation and many other. We are providing long term and short term internship also.
We are providing short term in industrial training, internship and inplant training for Btech/Bsc/MCA/MTech students. Attached is the list of Topics for Mechanical, Automobile and Mechatronics areas.
MD MANIKANDAN-9037291113,04954021113
softroniics@gmail.com
www.softroniics.com
Reversible Data Hiding in Encrypted Image: A ReviewEditor IJMTER
Recently, more and more attention is paid to reversible data hiding (RDH) in encrypted
images, since it maintains the excellent property that the original cover can be losslessly recovered
after embedded data is extracted while protecting the image content’s confidentiality. All previous
methods embed data by reversibly vacating room from the encrypted images, which may be subject
to some errors on data extraction and/or image restoration. In this survey paper, we discuss about
various methods and algorithms which were used for reversible data hiding (RDH) in encrypted
image to make data hiding process effortless. We also use visual cryptographic approach for
encryption which helps to protect the image during transmission. The scheme is suitable for
authentication based application where collective acceptance and decision making plays an important
role. The main goal is to retrieve the original image with lossless process and minimum computation
during image encryption /decryption by using keyless approach.
IRJET- Image Privacy Protection as a Single ShareIRJET Journal
This document proposes a method for privacy protection of visual data using false color within the JPEG architecture. The method involves converting an input RGB image to grayscale, using the grayscale values to index a RGB color palette to replace the original pixel values, creating a protected false image. The false image and decryption metadata are stored together in a single JPEG file. Only authorized users with the decryption key can decompress, decrypt and decode the file to recover the original image losslessly. The method aims to provide privacy protection with intelligibility and security for surveillance systems and shared visual data.
Permutation of Pixels within the Shares of Visual Cryptography using KBRP for...IDES Editor
The security of authentication of internet based
co-banking services should not be susceptible to high risks.
The passwords are highly vulnerable to virus attacks due to
the lack of high end embedding of security methods. In order
for the passwords to be more secure, people are generally
compelled to select jumbled up character based passwords
which are not only less memorable but are also equally prone
to insecurity. Multiple use of distributed shares has been
studied to solve the problem of authentication by algorithms
based on thresholding of pixels in image processing and visual
cryptography concepts where the subset of shares is considered
for the recovery of the original image for authentication using
correlation function[1][2].The main disadvantage in the above
study is the plain storage of shares and also one of the shares
is being supplied to the customer, which will lead to the
possibility of misuse by a third party. This paper proposes a
technique for scrambling of pixels by key based random
permutation (KBRP) within the shares before the
authentication has been attempted. Total number of shares to
be created is dependent on the multiplicity of ownership of
the account. By this method the problem of uncertainty among
the customers with regard to security, storage, retrieval of
holding of half of the shares is minimized.
This document summarizes a research paper on visual cryptography, which is a technique that allows information like images and text to be encrypted in a way that can be decrypted by the human visual system without using computers. It discusses how visual cryptography works by splitting a secret image into random shares, such that overlaying the shares reveals the original secret image. The document then describes the specific SDS algorithm used in the paper for keyless image encryption by sieving, dividing, and shuffling the image pixels into multiple random shares. It concludes by discussing potential applications and areas for further research on visual cryptography.
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/how-axelera-ai-uses-digital-compute-in-memory-to-deliver-fast-and-energy-efficient-computer-vision-a-presentation-from-axelera-ai/
Bram Verhoef, Head of Machine Learning at Axelera AI, presents the “How Axelera AI Uses Digital Compute-in-memory to Deliver Fast and Energy-efficient Computer Vision” tutorial at the May 2024 Embedded Vision Summit.
As artificial intelligence inference transitions from cloud environments to edge locations, computer vision applications achieve heightened responsiveness, reliability and privacy. This migration, however, introduces the challenge of operating within the stringent confines of resource constraints typical at the edge, including small form factors, low energy budgets and diminished memory and computational capacities. Axelera AI addresses these challenges through an innovative approach of performing digital computations within memory itself. This technique facilitates the realization of high-performance, energy-efficient and cost-effective computer vision capabilities at the thin and thick edge, extending the frontier of what is achievable with current technologies.
In this presentation, Verhoef unveils his company’s pioneering chip technology and demonstrates its capacity to deliver exceptional frames-per-second performance across a range of standard computer vision networks typical of applications in security, surveillance and the industrial sector. This shows that advanced computer vision can be accessible and efficient, even at the very edge of our technological ecosystem.
In the realm of cybersecurity, offensive security practices act as a critical shield. By simulating real-world attacks in a controlled environment, these techniques expose vulnerabilities before malicious actors can exploit them. This proactive approach allows manufacturers to identify and fix weaknesses, significantly enhancing system security.
This presentation delves into the development of a system designed to mimic Galileo's Open Service signal using software-defined radio (SDR) technology. We'll begin with a foundational overview of both Global Navigation Satellite Systems (GNSS) and the intricacies of digital signal processing.
The presentation culminates in a live demonstration. We'll showcase the manipulation of Galileo's Open Service pilot signal, simulating an attack on various software and hardware systems. This practical demonstration serves to highlight the potential consequences of unaddressed vulnerabilities, emphasizing the importance of offensive security practices in safeguarding critical infrastructure.
What is an RPA CoE? Session 1 – CoE VisionDianaGray10
In the first session, we will review the organization's vision and how this has an impact on the COE Structure.
Topics covered:
• The role of a steering committee
• How do the organization’s priorities determine CoE Structure?
Speaker:
Chris Bolin, Senior Intelligent Automation Architect Anika Systems
Fueling AI with Great Data with Airbyte WebinarZilliz
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
Dandelion Hashtable: beyond billion requests per second on a commodity serverAntonios Katsarakis
This slide deck presents DLHT, a concurrent in-memory hashtable. Despite efforts to optimize hashtables, that go as far as sacrificing core functionality, state-of-the-art designs still incur multiple memory accesses per request and block request processing in three cases. First, most hashtables block while waiting for data to be retrieved from memory. Second, open-addressing designs, which represent the current state-of-the-art, either cannot free index slots on deletes or must block all requests to do so. Third, index resizes block every request until all objects are copied to the new index. Defying folklore wisdom, DLHT forgoes open-addressing and adopts a fully-featured and memory-aware closed-addressing design based on bounded cache-line-chaining. This design offers lock-free index operations and deletes that free slots instantly, (2) completes most requests with a single memory access, (3) utilizes software prefetching to hide memory latencies, and (4) employs a novel non-blocking and parallel resizing. In a commodity server and a memory-resident workload, DLHT surpasses 1.6B requests per second and provides 3.5x (12x) the throughput of the state-of-the-art closed-addressing (open-addressing) resizable hashtable on Gets (Deletes).
5th LF Energy Power Grid Model Meet-up SlidesDanBrown980551
5th Power Grid Model Meet-up
It is with great pleasure that we extend to you an invitation to the 5th Power Grid Model Meet-up, scheduled for 6th June 2024. This event will adopt a hybrid format, allowing participants to join us either through an online Mircosoft Teams session or in person at TU/e located at Den Dolech 2, Eindhoven, Netherlands. The meet-up will be hosted by Eindhoven University of Technology (TU/e), a research university specializing in engineering science & technology.
Power Grid Model
The global energy transition is placing new and unprecedented demands on Distribution System Operators (DSOs). Alongside upgrades to grid capacity, processes such as digitization, capacity optimization, and congestion management are becoming vital for delivering reliable services.
Power Grid Model is an open source project from Linux Foundation Energy and provides a calculation engine that is increasingly essential for DSOs. It offers a standards-based foundation enabling real-time power systems analysis, simulations of electrical power grids, and sophisticated what-if analysis. In addition, it enables in-depth studies and analysis of the electrical power grid’s behavior and performance. This comprehensive model incorporates essential factors such as power generation capacity, electrical losses, voltage levels, power flows, and system stability.
Power Grid Model is currently being applied in a wide variety of use cases, including grid planning, expansion, reliability, and congestion studies. It can also help in analyzing the impact of renewable energy integration, assessing the effects of disturbances or faults, and developing strategies for grid control and optimization.
What to expect
For the upcoming meetup we are organizing, we have an exciting lineup of activities planned:
-Insightful presentations covering two practical applications of the Power Grid Model.
-An update on the latest advancements in Power Grid -Model technology during the first and second quarters of 2024.
-An interactive brainstorming session to discuss and propose new feature requests.
-An opportunity to connect with fellow Power Grid Model enthusiasts and users.
Freshworks Rethinks NoSQL for Rapid Scaling & Cost-EfficiencyScyllaDB
Freshworks creates AI-boosted business software that helps employees work more efficiently and effectively. Managing data across multiple RDBMS and NoSQL databases was already a challenge at their current scale. To prepare for 10X growth, they knew it was time to rethink their database strategy. Learn how they architected a solution that would simplify scaling while keeping costs under control.
Digital Banking in the Cloud: How Citizens Bank Unlocked Their MainframePrecisely
Inconsistent user experience and siloed data, high costs, and changing customer expectations – Citizens Bank was experiencing these challenges while it was attempting to deliver a superior digital banking experience for its clients. Its core banking applications run on the mainframe and Citizens was using legacy utilities to get the critical mainframe data to feed customer-facing channels, like call centers, web, and mobile. Ultimately, this led to higher operating costs (MIPS), delayed response times, and longer time to market.
Ever-changing customer expectations demand more modern digital experiences, and the bank needed to find a solution that could provide real-time data to its customer channels with low latency and operating costs. Join this session to learn how Citizens is leveraging Precisely to replicate mainframe data to its customer channels and deliver on their “modern digital bank” experiences.
Skybuffer SAM4U tool for SAP license adoptionTatiana Kojar
Manage and optimize your license adoption and consumption with SAM4U, an SAP free customer software asset management tool.
SAM4U, an SAP complimentary software asset management tool for customers, delivers a detailed and well-structured overview of license inventory and usage with a user-friendly interface. We offer a hosted, cost-effective, and performance-optimized SAM4U setup in the Skybuffer Cloud environment. You retain ownership of the system and data, while we manage the ABAP 7.58 infrastructure, ensuring fixed Total Cost of Ownership (TCO) and exceptional services through the SAP Fiori interface.
The Microsoft 365 Migration Tutorial For Beginner.pptxoperationspcvita
This presentation will help you understand the power of Microsoft 365. However, we have mentioned every productivity app included in Office 365. Additionally, we have suggested the migration situation related to Office 365 and how we can help you.
You can also read: https://www.systoolsgroup.com/updates/office-365-tenant-to-tenant-migration-step-by-step-complete-guide/
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
Monitoring and Managing Anomaly Detection on OpenShift.pdfTosin Akinosho
Monitoring and Managing Anomaly Detection on OpenShift
Overview
Dive into the world of anomaly detection on edge devices with our comprehensive hands-on tutorial. This SlideShare presentation will guide you through the entire process, from data collection and model training to edge deployment and real-time monitoring. Perfect for those looking to implement robust anomaly detection systems on resource-constrained IoT/edge devices.
Key Topics Covered
1. Introduction to Anomaly Detection
- Understand the fundamentals of anomaly detection and its importance in identifying unusual behavior or failures in systems.
2. Understanding Edge (IoT)
- Learn about edge computing and IoT, and how they enable real-time data processing and decision-making at the source.
3. What is ArgoCD?
- Discover ArgoCD, a declarative, GitOps continuous delivery tool for Kubernetes, and its role in deploying applications on edge devices.
4. Deployment Using ArgoCD for Edge Devices
- Step-by-step guide on deploying anomaly detection models on edge devices using ArgoCD.
5. Introduction to Apache Kafka and S3
- Explore Apache Kafka for real-time data streaming and Amazon S3 for scalable storage solutions.
6. Viewing Kafka Messages in the Data Lake
- Learn how to view and analyze Kafka messages stored in a data lake for better insights.
7. What is Prometheus?
- Get to know Prometheus, an open-source monitoring and alerting toolkit, and its application in monitoring edge devices.
8. Monitoring Application Metrics with Prometheus
- Detailed instructions on setting up Prometheus to monitor the performance and health of your anomaly detection system.
9. What is Camel K?
- Introduction to Camel K, a lightweight integration framework built on Apache Camel, designed for Kubernetes.
10. Configuring Camel K Integrations for Data Pipelines
- Learn how to configure Camel K for seamless data pipeline integrations in your anomaly detection workflow.
11. What is a Jupyter Notebook?
- Overview of Jupyter Notebooks, an open-source web application for creating and sharing documents with live code, equations, visualizations, and narrative text.
12. Jupyter Notebooks with Code Examples
- Hands-on examples and code snippets in Jupyter Notebooks to help you implement and test anomaly detection models.
zkStudyClub - LatticeFold: A Lattice-based Folding Scheme and its Application...Alex Pruden
Folding is a recent technique for building efficient recursive SNARKs. Several elegant folding protocols have been proposed, such as Nova, Supernova, Hypernova, Protostar, and others. However, all of them rely on an additively homomorphic commitment scheme based on discrete log, and are therefore not post-quantum secure. In this work we present LatticeFold, the first lattice-based folding protocol based on the Module SIS problem. This folding protocol naturally leads to an efficient recursive lattice-based SNARK and an efficient PCD scheme. LatticeFold supports folding low-degree relations, such as R1CS, as well as high-degree relations, such as CCS. The key challenge is to construct a secure folding protocol that works with the Ajtai commitment scheme. The difficulty, is ensuring that extracted witnesses are low norm through many rounds of folding. We present a novel technique using the sumcheck protocol to ensure that extracted witnesses are always low norm no matter how many rounds of folding are used. Our evaluation of the final proof system suggests that it is as performant as Hypernova, while providing post-quantum security.
Paper Link: https://eprint.iacr.org/2024/257
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
JavaLand 2024: Application Development Green Masterplan
Kaur2013
1. Securing Visual Cryptographic Shares using Public
Key Encryption
Kulvinder Kaur
Department of Computer Science & Engineering
ABES Engineering College
Ghaziabad, India
skulvinder_08@yahoo.co.in
Vineeta Khemchandani
Department of Computer Applications
JSS Academy of Technical Education
NOIDA, India
V_khemchandani@yahoo.com
Abstract-The Visual Cryptography Scheme is a secure method
that encrypts a secret document or image by breaking it into
shares. A distinctive property of Visual Cryptography Scheme is
that one can visually decode the secret image by superimposing
shares without computation. By taking the advantage of this
property, third person can easily retrieve the secret image if shares
are passing in sequence over the network. The project presents an
approach for encrypting visual cryptographically generated image
shares using Public Key Encryption. RSA algorithm is used for
providing the double security of secret document. Thus secret share
are not available in their actual form for any alteration by the
adversaries who try to create fake shares. The scheme provides
more secure secret shares that are robust against a number of
attacks & the system provides a strong security for the handwritten
text, images and printed documents over the public network.
Keywords---Visual Cryptography; Encryption; Information
Security; VC shares
I. INTRODUCTION
In today’s information age, information sharing and transfer has
increased exponentially. The threat of an intruder accessing
secret information has been an ever existing concern for the data
communication experts. With the rapid advancement of network
topology, multimedia information is transmitted over the
Internet conveniently. Various confidential data such as military
maps and commercial identification are transmitted over the
Internet. While using secret images, security issues should be
taken into consideration because hackers may utilize weak link
over public network to steal information that they want. To deal
with security problems of secret images, we should develop
some secure appropriate algorithm by which we can secure our
data on internet. With this system visual information (pictures)
can be secure over the internet with the help of Visual
Cryptography.
The proposed scheme combines the advantages of both Visual
Cryptography as well as Public Key Cryptography. This scheme
enhances the security of VC shares by encrypting with Public
Key Cryptography [14][15], which provides the strong security
to the transfer of secret information in form of images, printed
text and hand written material.
Visual Cryptography (VC) is a special encryption
technique used to encrypt images in such a way that it can be
decrypted by the human visual system if the correct key images
are used. The technique was proposed by Moni Naor and Adi
Shamir[6] in 1994. According to them Visual Cryptography is a
method of encrypting a secret image into shares such that
stacking a sufficient number of shares reveals the secret image.
Shares are binary images usually presented in transparencies.
Unlike conventional cryptographic methods, VC needs no
complicated computation for recovering the secret image. The
act of decryption is to simply stack shares and view the secret
image that appears on the stacked shares. Visual Cryptographic
technique is being used for secretly transfer of images in army,
hand written documents, financial documents, text images,
internet- voting etc.
VC shares exist in their actual form during the transmission over
network. However, directly third person cannot guess the secret
information with any single share, but there is a possibility of
retrieval if hackers are able to collect all the shares passing in
sequence over the network. Thus to get rid of this problem, we
need to enhance the security of shares. For the same purpose we
have used Public Key Cryptography in addition to Visual
Cryptography so that even if hackers are able to get all the
shares but they cannot retrieve the original secret without the
access of private key.
II. RELATED WORK
Various researches have been carried out in this area to increase
the security & visual quality of the secret image. Some of them
are as follows:
Néelima Guntupalli et al [5] presented survey of various Visual
Cryptographic Schemes and established the conceptual
knowledge about Visual Cryptography.
Yogesh Bani, Dr. B.Majhi, Ram S. Mangrulkar [13] proposed a
novel approach for Visual Cryptography using Data Hiding by
Conjugate Error Diffusion watermarking technique. Two shares
have been generated and then embed into the cover image x with
the help of watermarking. Secret and cover images have been
revealed after overlapping shares. Cover image consume extra
storage space. Intruder can attack on the shares to reveal the
secret, which causes disturbance in the pixels of original image
and the receiver will not get the actual secret. At the receiver end
1108978-1-4673-4529-3/12/$31.00 c 2012 IEEE
2. the cover image and secret both will be revealed, so the quality
will be very poor of retrieved secret image.
Debashish Jena, Sanjay Kumar Jena [4] implemented Data
Hiding using Conjugate Ordered Dithering (DHCOD) algorithm
for generating the shares. A dithered halftone image generated
by the cover image was the first share. For second share, some
noise was added to the secret image and converted it to the
binary image after that using share 1 and binary image they
generated the second share. The secret image has been revealed
with the simple AND operation of share 1 and share 2. Share
generation process is made complicated by this method.
B. Padhmavati, P. Nirmal Kumar, M. A. Dorai Rangaswamy [2]
generated shares first by Visual Cryptography VC (2, 2) scheme.
Then both shares were embedded into the cover images with the
help of watermarking. For reveal of secret image, the extraction
process was used to extract the shares from the embedded
images. At last both shares were overlapped and revealed the
secret image. Two cover images have been used to hide the
shares which require extra memory space.
M. Nakajima, Y. Yamaguchi [7] suggested Extended Visual
Cryptography for natural images. Three input pictures have been
taken; one is secret and other two for encryption. The encryption
process is based upon determining the arrangements of
transparent sub pixels on two images (used to conceal the
existence of third secret image) according to the pixel
transparencies, t1, t2 and tT. Where, tT is the transparency of
target image. The secret picture is reconstructed by printing the
two output images on transparencies and stacking them together.
The problems with this technique are network overload due to
two extra images and poor quality of revealed image.
Wei-Qi-Yan, Duo Jin, Mohan S Kankanhalli [12] suggested a
solution for superimposition of two shares. Some alignment
marks are used in Walsh transform domain. It is always
beneficial to use the scheme developed by this author, because
in VC decryption stacking of two shares is mandatory and
without exact alignment retrieval is not possible.
Abhishek Parakh and Subhash Kak [1] suggested Recursive
Hiding scheme for 2 out of 3 secret sharing. Secret bit is divided
into 3 pieces p1, p2, p3.
For 0 p1=p2=p3 as 000,111, 222
For 1p1≠p2≠p3 as 021,102,120,210,201etc
Shares of smaller message are used to create shares of larger
message. This scheme helps in decreasing the network load. Per
pixel 9 bits expansion if the image size is multiple of 3, 16 bits
expansion if image is multiple of 4 and so on this is not
acceptable after a limit. Currently the efficiency of this system is
33% which will decrease as the size will not be exactly in
multiple of 3.
Vaibhav Choudhary et al [11] discussed an Improved Pixel
Sieve Method for Visual Cryptography used an additional sieve
to generate shares. In this scheme Secret is hidden properly
using this scheme but efficiency of this scheme cannot be
evaluated as decryption algorithm and the results of retrieval
have not been shown in the paper.
Ujjwal Chakraborty et al [10] proposed two schemes for (2, 2)
and (2, 3) visual cryptographic encryption. The first scheme
considers 4 pixels of input image at a time and generates 4
output pixels in each share. The second scheme considers 2
pixels (1 block) of input image at a time and generates 3 output
pixels in each share. The dimension of revealed image is
increased by 1.5 times in horizontal direction and remains same
in vertical direction.
Shyamalendu Kandar & Arnab Maiti [9] has proposed a
technique of k-n secret sharing on color images. At the time of
dividing an image into n number of shares, they have used random
number generator. Minimum k numbers of shares are sufficient to
reconstruct the image. If k numbers of shares are taken then the
remaining shares are (n−k). In an image if certain position of a
pixel is 1, then in (n−k) +1 number of shares in that position of
that pixel there will be 1. In the remaining shares in that position
of the pixel there will be 0. A random number generator is used
to identify those (n−k) +1 number of shares. Secret is not
properly hidden and it is easy to guess the contents in all three
shares. If intruder is able to get the information about
randomness, secret image can be retrieved.
Chandramathi S, Ramesh Kumar R, Suresh R & Harish S [3] in
2010 concluded from the overview of all existing VC schemes
that researchers should focus on good quality of reconstructed
image & to increase security with minimum pixel expansion.
P. S. Revenkar, Anisa Anjum and W. Z Gandhare [8] evaluated
the performance of various Visual Cryptographic Schemes,
which help in choice of best scheme according to the available
bandwidth or color of secret image or level of security required.
Following parameters have been used to evaluate the
performance:
No. of Secret images
Pixel Expansion
Image Format
Type of shares generated
As we have observed that conventional cryptography is not used
to protect the shares. In some cases cover images are used to
2013 3rd
IEEE International Advance Computing Conference (IACC) 1109
3. carry the secret share which is an extra overload on network.
This limitation forced us to use Public Key cryptography which
provides shares with change in actual information.
III. METHODOLOGY OF THE PROPOSED SCHEME
The proposed scheme generates the VC shares using
basic Visual Cryptography model and then encrypt both shares
using RSA algorithm of Public Key Cryptography so that the
secret shares will be more secure and shares are protected from
the malicious adversaries who may alter the bit sequences to
create the fake shares. During the decryption phase, secret shares
are extracted by RSA decryption algorithm & stacked to reveal
the secret image. As shown in Fig. 3.1, complete scheme is
divided into following four phases:
Fig.3.1 Methodology of the Proposed Scheme
A. PHASE-1 Generating shares of secret image: In this
phase Visual Cryptography Encryption is implemented. It
consists of generation of shares from secret image using VC (2,
2) scheme. The secret image is first converted into a binary
image then each pixel in the secret image is broken into 8 sub
pixels, 4 pixels in each share by selecting the random pixel
encoding scheme out of three given in Fig.3.2.
Fig. 3.2. Pixel encoding schemes
The algorithms for conversion of image into binary and share
generation are given below:
Algorithm 3.1 Image Conversion
Algorithm 3.2 Share Generation
B. PHASE-2 Encrypting the generated Shares: This is the
second phase of our approach which will encrypt shares
generated from the first phase. We have used RSA for
encryption in this step. First we have generated the key for RSA
and then performed the encryption. Results of this phase are
encrypted shares.
C. PHASE-3 Decrypting the Shares using RSA: This
process takes place at the destination of the
document/image/text. We again convert the encrypted shares in
their actual form using RSA decryption algorithm, which were
encrypted at the sender end.
Image-conversion
Input: .jpg image/.bmp image
Output: BIN_IMG, R_size, C_size
IMG=read ()
BIN_IMG=Convert_to_binary (IMG)
[R_size C_size]=Cal_size (BIN_IMG)
Share_generation
Input: BIN_IMG, R_size, C_size
Output: SHARE1
SHARE2
For i=1 TO R_size
Do
For j=1 TO C_size
Do
Pix_enc_scheme=Rand_select()
SHARE1=Pix_enc_scheme(BIN_IMG(i,j))
SHARE 2=Pix_enc_scheme(BIN_IMG(I,j))
Done
Done
Decryption
using RSA
Secret Image
Share 1 Share 2
Encryption
using RSA
Encryption
using RSA
Decryption
using RSA
Decoded Secret
Image
Phase1
Phase 2
Phase3
Phase4
1110 2013 3rd
IEEE International Advance Computing Conference (IACC)
4. D. PHASE-4 Visual Cryptographic decryption: In this
phase Visual Cryptographic decryption is performed. We have
decrypted the original secret image by applying the binary XOR
operation on both decrypted shares.
IV. EXPERIMENTAL RESULTS
Proposed scheme has been implemented in MATLAB
7.5. To run this scheme minimum hardware configuration is
required with no extra specifications. The experiments have
been run in Windows 7 on a Sony VAIO laptop with Intel i5 2.4
GHz processor.
To test the performance of this scheme number of
experiments has been conducted with varying image sizes, types
& keys but every time secret image is retrieved with good visual
quality. The confidentiality of shares is also tested by super
imposing the encrypted shares before reaching to the destination.
Results of some experiments are shown in Fig.4.1, Fig.4.2 &
Fig.4.3.
Fig. 4.1 Experiment-1 Fig. 4.2 Experiment-2
A. Binary Input Image2
B. Image2_share1 C. Image2_share2
D. Image2_Encrypted share2 E. Image2_Encrypted share2
F. Revealed Image from Encrypted shares
G. Image2_Decrypted share1
I. Revealed Image2 from Decrypted shares
H. Image2_Decrypted share2
A. Binary Input Image1
B. Image1_share1 C. Image1_share2
D. Image1_Encrypted share2 E. Image1_Encrypted share2
F. Revealed Image from Encrypted shares
G. Image1_Decrypted share1
I. Revealed Image1from decrypted shares
H. Image1_Decrypted share2
2013 3rd
IEEE International Advance Computing Conference (IACC) 1111
5. Fig. 4.3 Experiment-3
These experiments have been conducted taking secret
images of different sizes as an input shown by ‘A’ in Fig.4.1,
Fig.4.2 & Fig.4.3, ‘B’ & ‘C’ show share1 & share2 of the secret
image generated by the Visual Cryptographic encryption phase.
‘D’ & ‘E’ show the encrypted share1 & encrypted share2. These
are the results of second phase, in which the Visual
Cryptographic shares have been encrypted using encryption
algorithm. ‘G’ & ‘H’ show the decrypted share1 & decrypted
share2, the results of decryption phase using RSA. ‘I’ shows the
original secret image revealed by overlapping the decrypted
share1 and decrypted share2. The Visual Cryptographic
decryption is used to retrieve this secret image.
Performance of the scheme has been evaluated to test
whether retrieval of input images have been possible by any
opponent having all the shares at the same time by stacking
encrypted shares. In Fig.4.1, Fig.4.2 & Fig.4.3 ‘F shows the
result of stacking encrypted shares which prove that opponent
cannot retrieve secret image without having secret key. Table I
shows that system is enough efficient with the varying size of
input and random selection of key.
Table I. System Performance
V. CONCLUSION & FUTURE SCOPE
We have tested this scheme on different types of input
images with change in size of the image and keys of RSA. But
the entire time secret image is retrieved with good visual quality.
The confidentiality of shares is also tested by super imposing the
encrypted shares before reaching to the destination. In all the
cases it has been observed that if any intruder will be successful
to get the encrypted shares from network, he or she cannot
retrieve the original secret image without availability of private
key.
Input
Image
(size)
In Pixels
Public Key
(e, n)
Private
Key
(d, n)
Retrieval
after
stacking
encrypted
shares
Retrieval
after
stacking
decrypted
shares
(38X90) (25,163202)
(77929,
163201)
Not
Retrieved
Retrieved
(80X96) (53,511493)
(404189,
511493)
Not
Retrieved
Retrieved
(80X96) (13, 92341)
(56229,
92341)
Not
Retrieved
Retrieved
A. Binary Input Image3
B. Image3_share1 C. Image3_share2
D. Image3_Encrypted share2 E. Image3_Encrypted share2
F. Revealed Image from Encrypted shares
G. Image3_Decrypted share1
I. Revealed Image3 from decrypted shares
H. Image3_Decrypted share2
1112 2013 3rd
IEEE International Advance Computing Conference (IACC)