Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
Visual cryptography scheme for color imagesiaemedu
This document presents a new visual cryptography scheme for color images based on the CMY color model, half-toning technique, and traditional binary image sharing. The color image is decomposed into cyan, magenta, and yellow monochrome images, which are then converted to binary images using half-toning. Each monochrome image is divided into shares using binary image sharing. Three shares with different colors can reconstruct the original image when stacked. Experimental results on a test image show the shares have negligible information and the reconstructed image has high structural similarity to the original.
The document discusses image steganography and various related concepts. It introduces image steganography as hiding secret information in a cover image. Key points covered include:
- Huffman coding is used to encode the secret image before embedding. It assigns binary codes to image intensity values.
- Discrete wavelet transform (DWT) is applied to the cover image. The secret message is embedded in the high frequency DWT coefficients while preserving the low frequency coefficients to maintain image quality.
- Inverse DWT is applied to produce a stego-image containing the hidden secret image. Haar DWT is used in the described approach.
Visual Cryptography in Meaningful SharesDebarko De
This document summarizes a mini project on generating meaningful shares in visual cryptographic systems. The project was presented by three students under the supervision of Mr. Sandeep Gurung. The document outlines the contents, introduction, aim, problem definition, analysis of the problem, solution strategy, literature survey, design strategy, test plan, implementation details, results and discussions, summary and conclusion, and references. It aims to implement a cryptographic scheme that can decode concealed images without computation by generating random parts of images and embedding them in meaningful shares that can be overlapped to decrypt the output.
Steganography is the technique of hiding the fact that communication is taking place,
by hiding data in other data. Many different carrier file formats can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in
images, there exist a large variety of steganographic techniques. Steganalysis, the detection of this
hidden information, is an inherently difficult problem.In this paper,I am going to cover different
steganographic techniques researched by different researchers.
Keywords — Cryptography, Steganography, LSB, Hash-LSB, RSA Encryption –Decryption
Extended Visual Cryptography Using WatermarkingShivam Singh
Basically watermarking is used as a secret information to share, which is added with strong encryption and decryption technique using visual cryptography
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
Visual cryptography is a cryptographic technique that allows visual information like images and text to be encrypted in a way that decryption does not require a computer and is instead a mechanical operation performed by the human visual system. It was pioneered in 1994 by Moni Naor and Adi Shamir. The technique works by breaking an image into shares such that individual shares reveal no information about the original image but combining the shares allows the image to be revealed. For example, in a 2 out of 2 visual cryptography scheme each pixel is broken into 4 subpixels distributed randomly across 2 shares such that stacking the shares recovers the original pixel value. Visual cryptography finds applications in secure identification and communication.
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.
Visual cryptography scheme for color imagesiaemedu
This document presents a new visual cryptography scheme for color images based on the CMY color model, half-toning technique, and traditional binary image sharing. The color image is decomposed into cyan, magenta, and yellow monochrome images, which are then converted to binary images using half-toning. Each monochrome image is divided into shares using binary image sharing. Three shares with different colors can reconstruct the original image when stacked. Experimental results on a test image show the shares have negligible information and the reconstructed image has high structural similarity to the original.
The document discusses image steganography and various related concepts. It introduces image steganography as hiding secret information in a cover image. Key points covered include:
- Huffman coding is used to encode the secret image before embedding. It assigns binary codes to image intensity values.
- Discrete wavelet transform (DWT) is applied to the cover image. The secret message is embedded in the high frequency DWT coefficients while preserving the low frequency coefficients to maintain image quality.
- Inverse DWT is applied to produce a stego-image containing the hidden secret image. Haar DWT is used in the described approach.
Visual Cryptography in Meaningful SharesDebarko De
This document summarizes a mini project on generating meaningful shares in visual cryptographic systems. The project was presented by three students under the supervision of Mr. Sandeep Gurung. The document outlines the contents, introduction, aim, problem definition, analysis of the problem, solution strategy, literature survey, design strategy, test plan, implementation details, results and discussions, summary and conclusion, and references. It aims to implement a cryptographic scheme that can decode concealed images without computation by generating random parts of images and embedding them in meaningful shares that can be overlapped to decrypt the output.
Steganography is the technique of hiding the fact that communication is taking place,
by hiding data in other data. Many different carrier file formats can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in
images, there exist a large variety of steganographic techniques. Steganalysis, the detection of this
hidden information, is an inherently difficult problem.In this paper,I am going to cover different
steganographic techniques researched by different researchers.
Keywords — Cryptography, Steganography, LSB, Hash-LSB, RSA Encryption –Decryption
Extended Visual Cryptography Using WatermarkingShivam Singh
Basically watermarking is used as a secret information to share, which is added with strong encryption and decryption technique using visual cryptography
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
Visual cryptography is a cryptographic technique that allows visual information like images and text to be encrypted in a way that decryption does not require a computer and is instead a mechanical operation performed by the human visual system. It was pioneered in 1994 by Moni Naor and Adi Shamir. The technique works by breaking an image into shares such that individual shares reveal no information about the original image but combining the shares allows the image to be revealed. For example, in a 2 out of 2 visual cryptography scheme each pixel is broken into 4 subpixels distributed randomly across 2 shares such that stacking the shares recovers the original pixel value. Visual cryptography finds applications in secure identification and communication.
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 provides an overview of visual cryptography, including its introduction, types, implementation methods, advantages, disadvantages, and applications. Visual cryptography allows visual information like pictures and text to be encrypted in a way that can be decrypted by the human visual system. It was pioneered in 1994 and works by splitting an image into shares such that stacking a sufficient number of shares reveals the original image. The document discusses various visual cryptography schemes and their properties.
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 a new algorithm for identifying steganographic signatures in digital images. The algorithm analyzes any image and assigns it a "suspicion value" based on the likelihood that it contains hidden information. Images with higher suspicion values would require more thorough analysis, while those with lower values are less likely to contain steganography. The algorithm is intended to quickly filter images flowing online to identify possible stego images for further investigation, without requiring extensive computation. It focuses specifically on "distributing" steganographic algorithms that hide data in the least significant bits of many pixels. The paper evaluates the suspicion values produced for various cover and stego-images generated by three such steganographic algorithms.
A Secure Color Image Steganography in Transform Domain ijcisjournal
Steganography is the art and science of covert communication. The secret information can be concealed in content such as image, audio, or video. This paper provides a novel image steganography technique to hide both image and key in color cover image using Discrete Wavelet Transform (DWT) and Integer Wavelet Transform (IWT). There is no visual difference between the stego image and the cover image. The extracted image is also similar to the secret image. This is proved by the high PSNR (Peak Signal to Noise Ratio), value for both stego and extracted secret image. The results are compared with the results of similar techniques and it is found that the proposed technique is simple and gives better PSNR values than others.
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.
"Randomized Visual Cryptography scheme for color images”iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Data Hiding and Retrieval using Visual CryptographyAM Publications
Nath et al. developed several methods for hiding data in a cover file using different steganography
methods. In some methods Nath et al. first applied encryption method before hiding into the cover file. For security
reasons the secret message is encrypted first before inserting into the cover file. To make the system more complex the
authors used some random insertion of bits so that even if the intruders can extract the bits from cover file but they
cannot reconstruct the original secret message. In the present work the authors applied different data hiding
algorithm based on visual cryptography. Visual Cryptography is now a days a very popular method for hiding any
secret message inside multiple shares. Initially people were trying to hide some secret message which is simply B/W in
two shares. But slowly the researchers started to hide any color image (may be text or image or any object) in two or
more shares. In the present work the authors tried to hide any color message/image in two or more shares. The
interesting part of the present method is that from one share it impossible to create the second share or to extract the
hidden secret message from one share without having the other share(s). The present method may be used for
reconstructing password or any kind of important message or image. The present method may be applied in forensic
department or in defense for sending some confidential message
Visual cryptography is a secret sharing scheme that allows for the encryption of written text or images in a perfectly secure way without any computation. It works by dividing the secret into multiple shares, where only when a sufficient number of shares are superimposed can the secret be revealed to the human visual system. For example, in a 2 by 2 scheme, a secret image is encoded into two shares such that individually the shares reveal no information, but when overlayed together the secret image is revealed, though with some loss of contrast and resolution. Visual cryptography has applications in security, watermarking, and remote voting.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Digital images can be defined as a 2-D function where x and y are spatial coordinates and the amplitude at each point represents intensity or gray level. Digital images can be raster images, represented as grids of pixels, or vector images, stored as mathematical descriptions of shapes. The file size of a digital image depends on its resolution in pixels, bit depth, and file format. Common file formats include JPEG, PNG, and TIFF, each suited for different types of images.
A NEW VISUAL CRYPTOGRAPHY TECHNIQUE FOR COLOR IMAGESIJTET Journal
Abstract - Visual Cryptography (VC) is an emerging cryptography technology that uses the characteristics of human vision to
decrypt encrypted images. This cryptographic system encrypts it by dividing a secret image into n number of share and decryption
is done by superimposing a certain number of share (k) or more. The secret information can be retrieved by anyone only if the
person gets at least k number of share. No clue about a secret image is revealed if less than k-1 share are superimposed. The
Visual cryptography technique is not only applied for binary messages, grayscale images, but also for color images such as scenic
photos or pictures. Color visual cryptography (VC) is used to generate a color halftone image share by encrypting a color secret
image. In order to preserve the visual quality and size of the color share without expansion, the concept of size invariant Visual
Secret Sharing (VSS) scheme and error diffusion is introduced. Experimental result shows that the proposed method can improve
the reconstructed image quality compared with previous techniques. Also, it produces clearer and higher contrast for all kinds of
color images.
Visual cryptography allows images to be encrypted in a way that decryption does not require a computer and instead relies on human visual perception. It works by splitting an image into shares, such that individually the shares appear random but combining the appropriate shares reveals the hidden image. A basic example is the (2, 2) scheme where each pixel is divided into 4 sub-pixels between 2 shares, with black pixels arranged differently than white pixels. Bringing the shares together reveals the hidden image through the human visual system without any computation. Visual cryptography has applications for secure transmission of images and verification of transactions.
This document presents a new visual cryptography scheme for color images based on the CMY color model, half-toning technique, and traditional binary image sharing. The color image is decomposed into cyan, magenta, and yellow monochrome images, which are then converted to binary images using half-toning. Each monochrome image is divided into shares using binary image sharing. Three shares with different colors can reconstruct the original image when stacked. Experimental results on a test image show the shares have negligible information and the reconstructed image has high structural similarity to the original.
High Security Cryptographic Technique Using Steganography and Chaotic Image E...IOSR Journals
This document summarizes a proposed cryptographic technique that combines steganography and chaotic image encryption to provide high security. Steganography is used to hide a message within a cover image by embedding it in the least significant bits of pixel values without affecting image quality. The resulting stego-image is then encrypted using triple-key chaotic image encryption based on the logistic map, making the encrypted data highly sensitive to changes in the initial encryption keys. The technique provides four layers of security to securely transmit hidden messages within digital images.
The document summarizes a proposed user-friendly image sharing scheme that uses JPEG-LS prediction and LSB matching functions. The scheme encodes a secret image into meaningful shadow images using different prime numbers for different blocks, as determined by JPEG-LS prediction. It hides the prime number indicators in the least significant bits of pixels using LSB matching to prevent image degradation. The experimental results showed the reconstructed image quality was higher than previous schemes, making it suitable for applications requiring high quality images like medicine, military, or art.
This document discusses digital image compression techniques. It begins by defining digital images and the need for compression due to the large size of digital images. It then describes the three main types of redundancy in digital images that compression techniques aim to remove: coding redundancy, interpixel redundancy, and psychovisual redundancy. The document outlines different lossless and lossy compression techniques and how they work to remove these different types of redundancies in order to reduce the size of digital images.
The Comparative Study on Visual Cryptography and Random Grid CryptographyIOSR Journals
Visual cryptography allows images to be encrypted into shares that can be decrypted by the human visual system without computers. Random grid cryptography encrypts images into cipher grids without pixel expansion, retaining the size of the original image. This document compares visual cryptography and random grid cryptography schemes based on analysis of Naor and Shamir's 2 out of 2 algorithm and Kafri and Keren's first random grid algorithm. It also discusses improving the contrast of reconstructed images using algorithms like linear error correcting codes and proposed decryption operations for random grids.
This document presents a technique for steganography using the least significant bit (LSB) and an encryption method. It discusses how the LSB technique works by replacing the LSB of pixels in a cover image with bits from a secret image. It then proposes encrypting the LSB plane of the encoded image by altering its columns at regular intervals before generating the stego image. This increases security by making it harder to extract the secret image through steganalysis while maintaining image quality. MATLAB code demonstrates embedding a secret image in a cover image using LSB, encrypting the LSB plane, generating the stego image, and successfully extracting the secret image.
This document describes a proposed system for implementing visual cryptography for biometric images with hashing and steganography for secure authentication. The system splits a user's fingerprint image into two shares, hashes the shares, and uses one share for authentication along with a one-time password. It aims to improve on existing systems by adding an additional layer of security through visual cryptography, hashing, and steganography compared to traditional username/password authentication. The system flow includes user registration, splitting the fingerprint into shares, hashing the shares, storing one on the server and giving the other to the user, and authenticating by combining and comparing the hashes.
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.
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 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.
This document provides an overview of visual cryptography, including its introduction, types, implementation methods, advantages, disadvantages, and applications. Visual cryptography allows visual information like pictures and text to be encrypted in a way that can be decrypted by the human visual system. It was pioneered in 1994 and works by splitting an image into shares such that stacking a sufficient number of shares reveals the original image. The document discusses various visual cryptography schemes and their properties.
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 a new algorithm for identifying steganographic signatures in digital images. The algorithm analyzes any image and assigns it a "suspicion value" based on the likelihood that it contains hidden information. Images with higher suspicion values would require more thorough analysis, while those with lower values are less likely to contain steganography. The algorithm is intended to quickly filter images flowing online to identify possible stego images for further investigation, without requiring extensive computation. It focuses specifically on "distributing" steganographic algorithms that hide data in the least significant bits of many pixels. The paper evaluates the suspicion values produced for various cover and stego-images generated by three such steganographic algorithms.
A Secure Color Image Steganography in Transform Domain ijcisjournal
Steganography is the art and science of covert communication. The secret information can be concealed in content such as image, audio, or video. This paper provides a novel image steganography technique to hide both image and key in color cover image using Discrete Wavelet Transform (DWT) and Integer Wavelet Transform (IWT). There is no visual difference between the stego image and the cover image. The extracted image is also similar to the secret image. This is proved by the high PSNR (Peak Signal to Noise Ratio), value for both stego and extracted secret image. The results are compared with the results of similar techniques and it is found that the proposed technique is simple and gives better PSNR values than others.
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.
"Randomized Visual Cryptography scheme for color images”iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Data Hiding and Retrieval using Visual CryptographyAM Publications
Nath et al. developed several methods for hiding data in a cover file using different steganography
methods. In some methods Nath et al. first applied encryption method before hiding into the cover file. For security
reasons the secret message is encrypted first before inserting into the cover file. To make the system more complex the
authors used some random insertion of bits so that even if the intruders can extract the bits from cover file but they
cannot reconstruct the original secret message. In the present work the authors applied different data hiding
algorithm based on visual cryptography. Visual Cryptography is now a days a very popular method for hiding any
secret message inside multiple shares. Initially people were trying to hide some secret message which is simply B/W in
two shares. But slowly the researchers started to hide any color image (may be text or image or any object) in two or
more shares. In the present work the authors tried to hide any color message/image in two or more shares. The
interesting part of the present method is that from one share it impossible to create the second share or to extract the
hidden secret message from one share without having the other share(s). The present method may be used for
reconstructing password or any kind of important message or image. The present method may be applied in forensic
department or in defense for sending some confidential message
Visual cryptography is a secret sharing scheme that allows for the encryption of written text or images in a perfectly secure way without any computation. It works by dividing the secret into multiple shares, where only when a sufficient number of shares are superimposed can the secret be revealed to the human visual system. For example, in a 2 by 2 scheme, a secret image is encoded into two shares such that individually the shares reveal no information, but when overlayed together the secret image is revealed, though with some loss of contrast and resolution. Visual cryptography has applications in security, watermarking, and remote voting.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Digital images can be defined as a 2-D function where x and y are spatial coordinates and the amplitude at each point represents intensity or gray level. Digital images can be raster images, represented as grids of pixels, or vector images, stored as mathematical descriptions of shapes. The file size of a digital image depends on its resolution in pixels, bit depth, and file format. Common file formats include JPEG, PNG, and TIFF, each suited for different types of images.
A NEW VISUAL CRYPTOGRAPHY TECHNIQUE FOR COLOR IMAGESIJTET Journal
Abstract - Visual Cryptography (VC) is an emerging cryptography technology that uses the characteristics of human vision to
decrypt encrypted images. This cryptographic system encrypts it by dividing a secret image into n number of share and decryption
is done by superimposing a certain number of share (k) or more. The secret information can be retrieved by anyone only if the
person gets at least k number of share. No clue about a secret image is revealed if less than k-1 share are superimposed. The
Visual cryptography technique is not only applied for binary messages, grayscale images, but also for color images such as scenic
photos or pictures. Color visual cryptography (VC) is used to generate a color halftone image share by encrypting a color secret
image. In order to preserve the visual quality and size of the color share without expansion, the concept of size invariant Visual
Secret Sharing (VSS) scheme and error diffusion is introduced. Experimental result shows that the proposed method can improve
the reconstructed image quality compared with previous techniques. Also, it produces clearer and higher contrast for all kinds of
color images.
Visual cryptography allows images to be encrypted in a way that decryption does not require a computer and instead relies on human visual perception. It works by splitting an image into shares, such that individually the shares appear random but combining the appropriate shares reveals the hidden image. A basic example is the (2, 2) scheme where each pixel is divided into 4 sub-pixels between 2 shares, with black pixels arranged differently than white pixels. Bringing the shares together reveals the hidden image through the human visual system without any computation. Visual cryptography has applications for secure transmission of images and verification of transactions.
This document presents a new visual cryptography scheme for color images based on the CMY color model, half-toning technique, and traditional binary image sharing. The color image is decomposed into cyan, magenta, and yellow monochrome images, which are then converted to binary images using half-toning. Each monochrome image is divided into shares using binary image sharing. Three shares with different colors can reconstruct the original image when stacked. Experimental results on a test image show the shares have negligible information and the reconstructed image has high structural similarity to the original.
High Security Cryptographic Technique Using Steganography and Chaotic Image E...IOSR Journals
This document summarizes a proposed cryptographic technique that combines steganography and chaotic image encryption to provide high security. Steganography is used to hide a message within a cover image by embedding it in the least significant bits of pixel values without affecting image quality. The resulting stego-image is then encrypted using triple-key chaotic image encryption based on the logistic map, making the encrypted data highly sensitive to changes in the initial encryption keys. The technique provides four layers of security to securely transmit hidden messages within digital images.
The document summarizes a proposed user-friendly image sharing scheme that uses JPEG-LS prediction and LSB matching functions. The scheme encodes a secret image into meaningful shadow images using different prime numbers for different blocks, as determined by JPEG-LS prediction. It hides the prime number indicators in the least significant bits of pixels using LSB matching to prevent image degradation. The experimental results showed the reconstructed image quality was higher than previous schemes, making it suitable for applications requiring high quality images like medicine, military, or art.
This document discusses digital image compression techniques. It begins by defining digital images and the need for compression due to the large size of digital images. It then describes the three main types of redundancy in digital images that compression techniques aim to remove: coding redundancy, interpixel redundancy, and psychovisual redundancy. The document outlines different lossless and lossy compression techniques and how they work to remove these different types of redundancies in order to reduce the size of digital images.
The Comparative Study on Visual Cryptography and Random Grid CryptographyIOSR Journals
Visual cryptography allows images to be encrypted into shares that can be decrypted by the human visual system without computers. Random grid cryptography encrypts images into cipher grids without pixel expansion, retaining the size of the original image. This document compares visual cryptography and random grid cryptography schemes based on analysis of Naor and Shamir's 2 out of 2 algorithm and Kafri and Keren's first random grid algorithm. It also discusses improving the contrast of reconstructed images using algorithms like linear error correcting codes and proposed decryption operations for random grids.
This document presents a technique for steganography using the least significant bit (LSB) and an encryption method. It discusses how the LSB technique works by replacing the LSB of pixels in a cover image with bits from a secret image. It then proposes encrypting the LSB plane of the encoded image by altering its columns at regular intervals before generating the stego image. This increases security by making it harder to extract the secret image through steganalysis while maintaining image quality. MATLAB code demonstrates embedding a secret image in a cover image using LSB, encrypting the LSB plane, generating the stego image, and successfully extracting the secret image.
This document describes a proposed system for implementing visual cryptography for biometric images with hashing and steganography for secure authentication. The system splits a user's fingerprint image into two shares, hashes the shares, and uses one share for authentication along with a one-time password. It aims to improve on existing systems by adding an additional layer of security through visual cryptography, hashing, and steganography compared to traditional username/password authentication. The system flow includes user registration, splitting the fingerprint into shares, hashing the shares, storing one on the server and giving the other to the user, and authenticating by combining and comparing the hashes.
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.
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 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.
This document proposes research on improving the quality of reconstructed secret images in visual cryptography. It summarizes previous work on visual cryptography, including early binary schemes, grayscale extensions, and approaches for color images. The proposed research would compare secret image reconstruction with and without error diffusion techniques. The goal is to develop a method to generate meaningful color shares with high visual quality by synchronizing visual information pixels across color channels and using error diffusion during encryption. This approach could help address limitations of prior color visual cryptography methods.
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.
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.
Steganography is the technique of hiding the fact that communication is taking place,by hiding data in other data. Many different carrier file formats such as image, audio, video, DNA etc can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in images, there exist a large variety of steganographic techniques. In this paper different steganographic techniques are described.
Copyright protection scheme based on visual Cryptography: A Reviewiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
The document summarizes several existing approaches for copyright protection of digital images based on visual cryptography. It discusses six different methods: (1) R. Hwang's method from 2000 that uses 2-2 visual cryptography to generate an owner share from a host image and watermark, (2) C.S. Hsu and Y.C. Hou's 2005 method that employs sampling distribution of means to generate a master share, (3) M.S. Wang and W.C. Chen's 2007 method that uses singular value decomposition to generate a master share, (4) Y.C. Hou and P.H. Huang's 2011 method that compares randomly selected pixels to generate a master share, (5) B
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.
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.
A self recovery approach using halftone images for medical imageryiaemedu
This document summarizes a proposed approach for securely transferring medical images over the internet using visual cryptography and halftone images. The approach uses error diffusion techniques to generate a halftone host image from the grayscale medical image. Shadow images are then created from the halftone host image using visual cryptography algorithms. When stacked together, the shadow images reveal the secret medical image. The halftone host image also contains an embedded logo that can be extracted to verify the integrity of the reconstructed image without a trusted third party.
A Cryptographic Key Generation on a 2D Graphics using RGB pixel Shuffling and...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
This document proposes a cryptographic key generation technique for 2D graphics images using RGB pixel shuffling and transposition. The technique extracts RGB pixel values from an input image, shuffles them to generate a cipher image, and can decrypt the image back to its original form. It aims to increase image security during transmission by manipulating pixel values rather than expanding pixel data. The algorithm is implemented in Java. Experimental results show the technique can encrypt and decrypt images while maintaining the original size and shape. Advantages include effectively increasing security against attacks and easily reconstructing image features from RGB values.
This document presents a new randomized visual cryptography scheme for sharing color images. The scheme uses (n-1) natural images and one noise-like share image to encrypt a color secret image. The encryption process extracts features from the natural images without altering them. When decryption is performed using the share image and extracted natural image features, the secret image can be recovered without distortion. The proposed approach avoids pixel expansion and allows secret images to be recovered by stacking shares while maintaining security. Experimental results demonstrate encrypting a secret image using three natural images and recovering it without error. The scheme can encrypt images of variable sizes and overcomes limitations of previous methods.
Natural Image Based Visual Secret Sharing Schemetheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Natural Image Based Visual Secret Sharing Schemetheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Visual Cryptography using Image ThresholdingIRJET Journal
This document proposes a novel visual cryptography algorithm using image thresholding that generates shares of an image without requiring a key. The technique thresholds the secret image to create two shares such that individual shares do not reveal information about the secret image. The original image can be reconstructed by performing an OR operation on the pixel values of the shares using the threshold value, without any loss of quality or information. The algorithm was tested on color images in MATLAB and successfully recovered the original image from the shares.
Encryption-Decryption RGB Color Image Using Matrix Multiplicationijcsit
An enhanced technique of color image encryption based on random matrix key encoding is proposed. To
encrypt the color image a separation into Red Green and Blue (R, G, B) channels will applied. Each
channel is encrypted using a technique called double random matrix key encoding then three new coding
image matrices are constructed. To obtain the reconstructed image that is the same as the original image
in the receipted side; simple extracted and decryption operations can be maintained. The results shown
that the proposed technique is powerful for color image encryption and decryption and a MATLAB and
simulations were used to get the results.
The proposed technique has high security features because each color component is separately treated
using its own double random matrix key which is generated randomly and make the process of hacking the
three keys very difficult.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
This paper studies color visual cryptography techniques. It discusses using visual information pixel synchronization and error diffusion to improve image quality in color visual cryptography schemes. Visual information pixel synchronization helps keep pixel positions consistent across color channels, improving contrast. Error diffusion distributes quantization errors during encoding, generating shares with better visibility. The paper provides an example applying these concepts to encrypt and reconstruct a color image from shares with high visual quality. In summary, the paper analyzes how visual information pixel synchronization and error diffusion can enhance color visual cryptography methods.
Similar to International Journal of Engineering Research and Development (20)
A Novel Method for Prevention of Bandwidth Distributed Denial of Service AttacksIJERD Editor
Distributed Denial of Service (DDoS) Attacks became a massive threat to the Internet. Traditional
Architecture of internet is vulnerable to the attacks like DDoS. Attacker primarily acquire his army of Zombies,
then that army will be instructed by the Attacker that when to start an attack and on whom the attack should be
done. In this paper, different techniques which are used to perform DDoS Attacks, Tools that were used to
perform Attacks and Countermeasures in order to detect the attackers and eliminate the Bandwidth Distributed
Denial of Service attacks (B-DDoS) are reviewed. DDoS Attacks were done by using various Flooding
techniques which are used in DDoS attack.
The main purpose of this paper is to design an architecture which can reduce the Bandwidth
Distributed Denial of service Attack and make the victim site or server available for the normal users by
eliminating the zombie machines. Our Primary focus of this paper is to dispute how normal machines are
turning into zombies (Bots), how attack is been initiated, DDoS attack procedure and how an organization can
save their server from being a DDoS victim. In order to present this we implemented a simulated environment
with Cisco switches, Routers, Firewall, some virtual machines and some Attack tools to display a real DDoS
attack. By using Time scheduling, Resource Limiting, System log, Access Control List and some Modular
policy Framework we stopped the attack and identified the Attacker (Bot) machines
Hearing loss is one of the most common human impairments. It is estimated that by year 2015 more
than 700 million people will suffer mild deafness. Most can be helped by hearing aid devices depending on the
severity of their hearing loss. This paper describes the implementation and characterization details of a dual
channel transmitter front end (TFE) for digital hearing aid (DHA) applications that use novel micro
electromechanical- systems (MEMS) audio transducers and ultra-low power-scalable analog-to-digital
converters (ADCs), which enable a very-low form factor, energy-efficient implementation for next-generation
DHA. The contribution of the design is the implementation of the dual channel MEMS microphones and powerscalable
ADC system.
Influence of tensile behaviour of slab on the structural Behaviour of shear c...IJERD Editor
-A composite beam is composed of a steel beam and a slab connected by means of shear connectors
like studs installed on the top flange of the steel beam to form a structure behaving monolithically. This study
analyzes the effects of the tensile behavior of the slab on the structural behavior of the shear connection like slip
stiffness and maximum shear force in composite beams subjected to hogging moment. The results show that the
shear studs located in the crack-concentration zones due to large hogging moments sustain significantly smaller
shear force and slip stiffness than the other zones. Moreover, the reduction of the slip stiffness in the shear
connection appears also to be closely related to the change in the tensile strain of rebar according to the increase
of the load. Further experimental and analytical studies shall be conducted considering variables such as the
reinforcement ratio and the arrangement of shear connectors to achieve efficient design of the shear connection
in composite beams subjected to hogging moment.
Gold prospecting using Remote Sensing ‘A case study of Sudan’IJERD Editor
Gold has been extracted from northeast Africa for more than 5000 years, and this may be the first
place where the metal was extracted. The Arabian-Nubian Shield (ANS) is an exposure of Precambrian
crystalline rocks on the flanks of the Red Sea. The crystalline rocks are mostly Neoproterozoic in age. ANS
includes the nations of Israel, Jordan. Egypt, Saudi Arabia, Sudan, Eritrea, Ethiopia, Yemen, and Somalia.
Arabian Nubian Shield Consists of juvenile continental crest that formed between 900 550 Ma, when intra
oceanic arc welded together along ophiolite decorated arc. Primary Au mineralization probably developed in
association with the growth of intra oceanic arc and evolution of back arc. Multiple episodes of deformation
have obscured the primary metallogenic setting, but at least some of the deposits preserve evidence that they
originate as sea floor massive sulphide deposits.
The Red Sea Hills Region is a vast span of rugged, harsh and inhospitable sector of the Earth with
inimical moon-like terrain, nevertheless since ancient times it is famed to be an abode of gold and was a major
source of wealth for the Pharaohs of ancient Egypt. The Pharaohs old workings have been periodically
rediscovered through time. Recent endeavours by the Geological Research Authority of Sudan led to the
discovery of a score of occurrences with gold and massive sulphide mineralizations. In the nineties of the
previous century the Geological Research Authority of Sudan (GRAS) in cooperation with BRGM utilized
satellite data of Landsat TM using spectral ratio technique to map possible mineralized zones in the Red Sea
Hills of Sudan. The outcome of the study mapped a gossan type gold mineralization. Band ratio technique was
applied to Arbaat area and a signature of alteration zone was detected. The alteration zones are commonly
associated with mineralization. The alteration zones are commonly associated with mineralization. A filed check
confirmed the existence of stock work of gold bearing quartz in the alteration zone. Another type of gold
mineralization that was discovered using remote sensing is the gold associated with metachert in the Atmur
Desert.
Reducing Corrosion Rate by Welding DesignIJERD Editor
This document summarizes a study on reducing corrosion rates in steel through welding design. The researchers tested different welding groove designs (X, V, 1/2X, 1/2V) and preheating temperatures (400°C, 500°C, 600°C) on ferritic malleable iron samples. Testing found that X and V groove designs with 500°C and 600°C preheating had corrosion rates of 0.5-0.69% weight loss after 14 days, compared to 0.57-0.76% for 400°C preheating. Higher preheating reduced residual stresses which decreased corrosion. Residual stresses were 1.7 MPa for optimal X groove and 600°C
Router 1X3 – RTL Design and VerificationIJERD Editor
Routing is the process of moving a packet of data from source to destination and enables messages
to pass from one computer to another and eventually reach the target machine. A router is a networking device
that forwards data packets between computer networks. It is connected to two or more data lines from different
networks (as opposed to a network switch, which connects data lines from one single network). This paper,
mainly emphasizes upon the study of router device, it‟s top level architecture, and how various sub-modules of
router i.e. Register, FIFO, FSM and Synchronizer are synthesized, and simulated and finally connected to its top
module.
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...IJERD Editor
This paper presents a component within the flexible ac-transmission system (FACTS) family, called
distributed power-flow controller (DPFC). The DPFC is derived from the unified power-flow controller (UPFC)
with an eliminated common dc link. The DPFC has the same control capabilities as the UPFC, which comprise
the adjustment of the line impedance, the transmission angle, and the bus voltage. The active power exchange
between the shunt and series converters, which is through the common dc link in the UPFC, is now through the
transmission lines at the third-harmonic frequency. DPFC multiple small-size single-phase converters which
reduces the cost of equipment, no voltage isolation between phases, increases redundancy and there by
reliability increases. The principle and analysis of the DPFC are presented in this paper and the corresponding
simulation results that are carried out on a scaled prototype are also shown.
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVRIJERD Editor
Power quality has been an issue that is becoming increasingly pivotal in industrial electricity
consumers point of view in recent times. Modern industries employ Sensitive power electronic equipments,
control devices and non-linear loads as part of automated processes to increase energy efficiency and
productivity. Voltage disturbances are the most common power quality problem due to this the use of a large
numbers of sophisticated and sensitive electronic equipment in industrial systems is increased. This paper
discusses the design and simulation of dynamic voltage restorer for improvement of power quality and
reduce the harmonics distortion of sensitive loads. Power quality problem is occurring at non-standard
voltage, current and frequency. Electronic devices are very sensitive loads. In power system voltage sag,
swell, flicker and harmonics are some of the problem to the sensitive load. The compensation capability
of a DVR depends primarily on the maximum voltage injection ability and the amount of stored
energy available within the restorer. This device is connected in series with the distribution feeder at
medium voltage. A fuzzy logic control is used to produce the gate pulses for control circuit of DVR and the
circuit is simulated by using MATLAB/SIMULINK software.
Study on the Fused Deposition Modelling In Additive ManufacturingIJERD Editor
Additive manufacturing process, also popularly known as 3-D printing, is a process where a product
is created in a succession of layers. It is based on a novel materials incremental manufacturing philosophy.
Unlike conventional manufacturing processes where material is removed from a given work price to derive the
final shape of a product, 3-D printing develops the product from scratch thus obviating the necessity to cut away
materials. This prevents wastage of raw materials. Commonly used raw materials for the process are ABS
plastic, PLA and nylon. Recently the use of gold, bronze and wood has also been implemented. The complexity
factor of this process is 0% as in any object of any shape and size can be manufactured.
Spyware triggering system by particular string valueIJERD Editor
This computer programme can be used for good and bad purpose in hacking or in any general
purpose. We can say it is next step for hacking techniques such as keylogger and spyware. Once in this system if
user or hacker store particular string as a input after that software continually compare typing activity of user
with that stored string and if it is match then launch spyware programme.
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...IJERD Editor
This paper presents a blind steganalysis technique to effectively attack the JPEG steganographic
schemes i.e. Jsteg, F5, Outguess and DWT Based. The proposed method exploits the correlations between
block-DCTcoefficients from intra-block and inter-block relation and the statistical moments of characteristic
functions of the test image is selected as features. The features are extracted from the BDCT JPEG 2-array.
Support Vector Machine with cross-validation is implemented for the classification.The proposed scheme gives
improved outcome in attacking.
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeIJERD Editor
- Data over the cloud is transferred or transmitted between servers and users. Privacy of that
data is very important as it belongs to personal information. If data get hacked by the hacker, can be
used to defame a person’s social data. Sometimes delay are held during data transmission. i.e. Mobile
communication, bandwidth is low. Hence compression algorithms are proposed for fast and efficient
transmission, encryption is used for security purposes and blurring is used by providing additional
layers of security. These algorithms are hybridized for having a robust and efficient security and
transmission over cloud storage system.
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...IJERD Editor
A thorough review of existing literature indicates that the Buckley-Leverett equation only analyzes
waterflood practices directly without any adjustments on real reservoir scenarios. By doing so, quite a number
of errors are introduced into these analyses. Also, for most waterflood scenarios, a radial investigation is more
appropriate than a simplified linear system. This study investigates the adoption of the Buckley-Leverett
equation to estimate the radius invasion of the displacing fluid during waterflooding. The model is also adopted
for a Microbial flood and a comparative analysis is conducted for both waterflooding and microbial flooding.
Results shown from the analysis doesn’t only records a success in determining the radial distance of the leading
edge of water during the flooding process, but also gives a clearer understanding of the applicability of
microbes to enhance oil production through in-situ production of bio-products like bio surfactans, biogenic
gases, bio acids etc.
Gesture Gaming on the World Wide Web Using an Ordinary Web CameraIJERD Editor
- Gesture gaming is a method by which users having a laptop/pc/x-box play games using natural or
bodily gestures. This paper presents a way of playing free flash games on the internet using an ordinary webcam
with the help of open source technologies. Emphasis in human activity recognition is given on the pose
estimation and the consistency in the pose of the player. These are estimated with the help of an ordinary web
camera having different resolutions from VGA to 20mps. Our work involved giving a 10 second documentary to
the user on how to play a particular game using gestures and what are the various kinds of gestures that can be
performed in front of the system. The initial inputs of the RGB values for the gesture component is obtained by
instructing the user to place his component in a red box in about 10 seconds after the short documentary before
the game is finished. Later the system opens the concerned game on the internet on popular flash game sites like
miniclip, games arcade, GameStop etc and loads the game clicking at various places and brings the state to a
place where the user is to perform only gestures to start playing the game. At any point of time the user can call
off the game by hitting the esc key and the program will release all of the controls and return to the desktop. It
was noted that the results obtained using an ordinary webcam matched that of the Kinect and the users could
relive the gaming experience of the free flash games on the net. Therefore effective in game advertising could
also be achieved thus resulting in a disruptive growth to the advertising firms.
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...IJERD Editor
-LLC resonant frequency converter is basically a combo of series as well as parallel resonant ckt. For
LCC resonant converter it is associated with a disadvantage that, though it has two resonant frequencies, the
lower resonant frequency is in ZCS region[5]. For this application, we are not able to design the converter
working at this resonant frequency. LLC resonant converter existed for a very long time but because of
unknown characteristic of this converter it was used as a series resonant converter with basically a passive
(resistive) load. . Here, it was designed to operate in switching frequency higher than resonant frequency of the
series resonant tank of Lr and Cr converter acts very similar to Series Resonant Converter. The benefit of LLC
resonant converter is narrow switching frequency range with light load[6] . Basically, the control ckt plays a
very imp. role and hence 555 Timer used here provides a perfect square wave as the control ckt provides no
slew rate which makes the square wave really strong and impenetrable. The dead band circuit provides the
exclusive dead band in micro seconds so as to avoid the simultaneous firing of two pairs of IGBT’s where one
pair switches off and the other on for a slightest period of time. Hence, the isolator ckt here is associated with
each and every ckt used because it acts as a driver and an isolation to each of the IGBT is provided with one
exclusive transformer supply[3]. The IGBT’s are fired using the appropriate signal using the previous boards
and hence at last a high frequency rectifier ckt with a filtering capacitor is used to get an exact dc
waveform .The basic goal of this particular analysis is to observe the wave forms and characteristics of
converters with differently positioned passive elements in the form of tank circuits.
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...IJERD Editor
LLC resonant frequency converter is basically a combo of series as well as parallel resonant ckt. For
LCC resonant converter it is associated with a disadvantage that, though it has two resonant frequencies, the
lower resonant frequency is in ZCS region [5]. For this application, we are not able to design the converter
working at this resonant frequency. LLC resonant converter existed for a very long time but because of
unknown characteristic of this converter it was used as a series resonant converter with basically a passive
(resistive) load. . Here, it was designed to operate in switching frequency higher than resonant frequency of the
series resonant tank of Lr and Cr converter acts very similar to Series Resonant Converter. The benefit of LLC
resonant converter is narrow switching frequency range with light load[6] . Basically, the control ckt plays a
very imp. role and hence 555 Timer used here provides a perfect square wave as the control ckt provides no
slew rate which makes the square wave really strong and impenetrable. The dead band circuit provides the
exclusive dead band in micro seconds so as to avoid the simultaneous firing of two pairs of IGBT’s where one
pair switches off and the other on for a slightest period of time. Hence, the isolator ckt here is associated with
each and every ckt used because it acts as a driver and an isolation to each of the IGBT is provided with one
exclusive transformer supply[3]. The IGBT’s are fired using the appropriate signal using the previous boards
and hence at last a high frequency rectifier ckt with a filtering capacitor is used to get an exact dc
waveform .The basic goal of this particular analysis is to observe the wave forms and characteristics of
converters with differently positioned passive elements in the form of tank circuits. The supported simulation
is done through PSIM 6.0 software tool
Amateurs Radio operator, also known as HAM communicates with other HAMs through Radio
waves. Wireless communication in which Moon is used as natural satellite is called Moon-bounce or EME
(Earth -Moon-Earth) technique. Long distance communication (DXing) using Very High Frequency (VHF)
operated amateur HAM radio was difficult. Even with the modest setup having good transceiver, power
amplifier and high gain antenna with high directivity, VHF DXing is possible. Generally 2X11 YAGI antenna
along with rotor to set horizontal and vertical angle is used. Moon tracking software gives exact location,
visibility of Moon at both the stations and other vital data to acquire real time position of moon.
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...IJERD Editor
Simple Sequence Repeats (SSR), also known as Microsatellites, have been extensively used as
molecular markers due to their abundance and high degree of polymorphism. The nucleotide sequences of
polymorphic forms of the same gene should be 99.9% identical. So, Microsatellites extraction from the Gene is
crucial. However, Microsatellites repeat count is compared, if they differ largely, he has some disorder. The Y
chromosome likely contains 50 to 60 genes that provide instructions for making proteins. Because only males
have the Y chromosome, the genes on this chromosome tend to be involved in male sex determination and
development. Several Microsatellite Extractors exist and they fail to extract microsatellites on large data sets of
giga bytes and tera bytes in size. The proposed tool “MS-Extractor: An Innovative Approach to extract
Microsatellites on „Y‟ Chromosome” can extract both Perfect as well as Imperfect Microsatellites from large
data sets of human genome „Y‟. The proposed system uses string matching with sliding window approach to
locate Microsatellites and extracts them.
Importance of Measurements in Smart GridIJERD Editor
- The need to get reliable supply, independence from fossil fuels, and capability to provide clean
energy at a fixed and lower cost, the existing power grid structure is transforming into Smart Grid. The
development of a smart energy distribution grid is a current goal of many nations. A Smart Grid should have
new capabilities such as self-healing, high reliability, energy management, and real-time pricing. This new era
of smart future grid will lead to major changes in existing technologies at generation, transmission and
distribution levels. The incorporation of renewable energy resources and distribution generators in the existing
grid will increase the complexity, optimization problems and instability of the system. This will lead to a
paradigm shift in the instrumentation and control requirements for Smart Grids for high quality, stable and
reliable electricity supply of power. The monitoring of the grid system state and stability relies on the
availability of reliable measurement of data. In this paper the measurement areas that highlight new
measurement challenges, development of the Smart Meters and the critical parameters of electric energy to be
monitored for improving the reliability of power systems has been discussed.
Study of Macro level Properties of SCC using GGBS and Lime stone powderIJERD Editor
The document summarizes a study on the use of ground granulated blast furnace slag (GGBS) and limestone powder to replace cement in self-compacting concrete (SCC). Tests were conducted on SCC mixes with 0-50% replacement of cement with GGBS and 0-20% replacement with limestone powder. The results showed that replacing 30% of cement with GGBS and 15% with limestone powder produced SCC with the highest compressive strength of 46MPa, meeting fresh property requirements. The study concluded that this ternary blend of cement, GGBS and limestone powder can improve SCC properties while reducing costs.
Generating privacy-protected synthetic data using Secludy and MilvusZilliz
During this demo, the founders of Secludy will demonstrate how their system utilizes Milvus to store and manipulate embeddings for generating privacy-protected synthetic data. Their approach not only maintains the confidentiality of the original data but also enhances the utility and scalability of LLMs under privacy constraints. Attendees, including machine learning engineers, data scientists, and data managers, will witness first-hand how Secludy's integration with Milvus empowers organizations to harness the power of LLMs securely and efficiently.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
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
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
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.
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
Connector Corner: Seamlessly power UiPath Apps, GenAI with prebuilt connectorsDianaGray10
Join us to learn how UiPath Apps can directly and easily interact with prebuilt connectors via Integration Service--including Salesforce, ServiceNow, Open GenAI, and more.
The best part is you can achieve this without building a custom workflow! Say goodbye to the hassle of using separate automations to call APIs. By seamlessly integrating within App Studio, you can now easily streamline your workflow, while gaining direct access to our Connector Catalog of popular applications.
We’ll discuss and demo the benefits of UiPath Apps and connectors including:
Creating a compelling user experience for any software, without the limitations of APIs.
Accelerating the app creation process, saving time and effort
Enjoying high-performance CRUD (create, read, update, delete) operations, for
seamless data management.
Speakers:
Russell Alfeche, Technology Leader, RPA at qBotic and UiPath MVP
Charlie Greenberg, host
"Frontline Battles with DDoS: Best practices and Lessons Learned", Igor IvaniukFwdays
At this talk we will discuss DDoS protection tools and best practices, discuss network architectures and what AWS has to offer. Also, we will look into one of the largest DDoS attacks on Ukrainian infrastructure that happened in February 2022. We'll see, what techniques helped to keep the web resources available for Ukrainians and how AWS improved DDoS protection for all customers based on Ukraine experience
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.
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
Northern Engraving | Nameplate Manufacturing Process - 2024Northern Engraving
Manufacturing custom quality metal nameplates and badges involves several standard operations. Processes include sheet prep, lithography, screening, coating, punch press and inspection. All decoration is completed in the flat sheet with adhesive and tooling operations following. The possibilities for creating unique durable nameplates are endless. How will you create your brand identity? We can help!
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
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.
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.
Your One-Stop Shop for Python Success: Top 10 US Python Development Providersakankshawande
Simplify your search for a reliable Python development partner! This list presents the top 10 trusted US providers offering comprehensive Python development services, ensuring your project's success from conception to completion.
Your One-Stop Shop for Python Success: Top 10 US Python Development Providers
International Journal of Engineering Research and Development
1. International Journal of Engineering Research and Development
e-ISSN: 2278-067X, p-ISSN: 2278-800X, www.ijerd.com
Volume 10, Issue 6 (June 2014), PP.01-08
1
Non Expanded Visual Cryptography for Color Images using
Pseudo-Randomized Authentication
1
Pooja, 2
Dr.Lalitha Y. S
1
P.G Student Digital Electronics, Appa Institute of Engineering & Technology, Gulbarga
2
Prof. E&CE Department Appa Institute of Engineering & Technology, Gulbarga
Abstract:- With the growth of digital media, it is becoming more prevalent to find a method to protect the
security of that media. An effective method for securely transmitting images is found in the field of Visual
Cryptography (VC). Visual cryptography scheme is a cryptographic technique which allows visual information
(e.g. printed text, handwritten notes, and picture) to be encrypted in such a way that the decryption can be
performed by the human visual system(HVS), without the aid of computers. In this paper, a novel method of VC
is presented for halftone images which represent the resultant image in the same size as the original secret
image. This scheme proposed the new algorithms for the (2, 2) visual cryptography. According to visual
cryptography the decryption is performed by human visual system. Proposed method based on with the aid of
computer at the time of decryption. The proposed schemes are for gray scale image, color image and by stacking
the shares; the resultant image achieved in same size with original secret image. The proposed scheme uses the
concept of pseudo randomization and pixel reversal approach in all methods.
Keywords:- Information Security, Information hiding, Halftone image, Visual cryptography, Secret share.
I. INTRODUCTION
With the rapid advancement of network technology, multimedia information is transmitted over the
Internet conveniently. Various confidential data such as military maps and commercial identifications are
transmitted over the Internet. While using secret images, security issues should be taken into consideration
because hackers may utilize weak link over communication network to steal information that they want .To deal
with the security problems of secret images, various image secret sharing schemes have been developed.
Visual cryptography is the concept of dividing a secret image into “n” shares and revealing secret
image by stacking a qualified subset of “n” shares. The scheme is perfectly secure and very easy to implement.
Visual cryptography takes the input as one secret image and creates the shares by the process of encryption, later
decryption is done by HVS.VC scheme eliminates complex computation problem in decryption process, and the
secret images can be restored by stacking operation. This property makes visual cryptography especially useful
for the low computation load requirement.
The field of VC has been developed over the last several years. The original method was proposed by
Naor and Shamir [1] for binary images. This provides a perfectly secure system where secret messages are
contained in “shares". Individually these shares resemble random noise, but when they are stacked and aligned
perfectly, their message is decrypted using only the human visual system. While this method gives security for
text and binary images, the growth of digital media requires the expansion of this technique to provide security
for gray and color images. Several methods have been developed for securing gray and color images, including
halftoning [2], dithering [3], color subpixel groupings [4], and meaningful image shares [5, 6].Through this
expansion of the original method, VC provides a secure way to store and transmit text, binary images, gray
images, and color images.
II. PRELIMINARIES AND RELATED WORK
2.1 Basic (2, 2) VC scheme for gray images:
Figure 1: Construction of (2, 2) VC Scheme
2. Non Expanded Visual Cryptography for Color Images using Pseudo-Randomized Authentication
2
Naor & Shamir [1] implemented a (2, 2) visual cryptography where decoded image is double than that
of the original secret image as pixel p expanded into two sub pixels. This is called pixel expansion, affecting the
contrast of resulting image. Earlier pixel expansion and contrast optimization work revealed that researchers
tried to lower expansion and optimize secret picture contrast. They also portray process of creating shares using
mathematical representations. The focus is on security and contrast condition [13].
The algorithm is as follows:
1. Convert the gray-level image into a halftone image.
2. For each black or white pixel in the halftone image, decompose it into a 2×2 block of the two
transparencies according to the rules in Fig.1. If the pixel is white, randomly select one combination
from the former two rows in Fig.1 as the content of blocks in Shares 1 and 2. If the pixel is black,
randomly select one combination from the latter two rows as the content of the blocks in the two
transparencies.
3. Repeat Step 2 until every pixel in the halftone image is decomposed, hence resulting in two
transparencies of visual cryptography to share the secret image.
2.2 Image Halftoning:
A halftone image is made up of a series of dots rather than a continuous tone. These dots can be different
sizes, different colors, and sometimes even different shapes. Larger dots are used to represent darker, more
dense areas of the image, while smaller dots are used for lighter areas. Color halftoning generates a halftone
pattern for each of these inks. When these patterns are printed over each other, the human viewer will observe a
color that depends on the amounts of the color inks.
Figure 2: Image halftoning.
Visual cryptographic solutions operate on binary or binaries inputs. Natural (continuous-tone) images
must be first converted into halftone images by using the density of the net dots to simulate the original gray or
color levels in the target binary representation. The halftone version of the input image is used instead of the
original secret image to produce the shares. The decrypted image is obtained by stacking the shares together.
Because binary data can be displayed either as frosted or transparent when printed on transparencies or viewed
on the screen, overlapping shares that contain seemingly random information can reveal the secret image
without additional computations or any knowledge of cryptographic keys.
2.2.1 Error diffusion
Error diffusion [7], [8] produces halftone images of much higher quality than other halftone. It quantifies
each pixel using a neighborhood operation.
The error diffusion scans the image one row at a time and one pixel at a time. The current pixel is compared
to a threshold (127) value. If it is above the value a white pixel is generated in the resulting image. If the pixel is
below the half way value, a black pixel is generated. The generated pixel is either full bright or full black.
Error is calculated which is the difference between original image and halftone image. The error is then
added to the next pixel in the image and the process repeats. To which neighbor and how this error is pushed is
decided by an error diffusion matrix.
Color halftoningGrey Scale haftoning vs
3. Non Expanded Visual Cryptography for Color Images using Pseudo-Randomized Authentication
3
X 7/48 5/48
3/48 5/48 7/48 5/48 3/48
1/48 3/48 5/48 3/48 1/48
Figure3: Jarvis error diffusion weight matrixes
In Figure 3 error diffusion weight matrix is shown. The error occurred at the position (i, j) is weighted
by 7/48 and added to the pixel value at (i+1, j). The same error is weighted by 5/48 and added to the pixel at
(i+1, j+1) and so on. The same process moves to the pixel at the next position and performs the above described
steps until all pixels have been proceeding.
III. EXPERIMENTAL DESIGNS
We have design some schemes on visual cryptography and visual secret sharing. The approach used for
these schemes is randomization and pixel reversal. We have done several experiments and came up some new
approaches of (2, 2) visual cryptography.
3.1 Randomized Visual cryptography scheme for grayscale images:
The algorithm is as follows:
Encryption:
1. Take any grayscale image as input image.
2. Convert the gray-level image into a halftone image by Jarvis error diffusion.
3. Generate the shares using pseudo randomized and pixel reversal approach as shown in fig 6.
Decryption:
4. Combine the shares to recover secret message.
Figure4: Flow chart for grayscale image
4. Non Expanded Visual Cryptography for Color Images using Pseudo-Randomized Authentication
4
3.2 Randomized Visual cryptography scheme for color images:
The algorithm is as follows:
Encryption:
1. Take any 24-bit color image as an input image. Each R-G-B color component is represented by 8-
bits.Input image is represented by 224 =16777216 color shades. Such types of images are stored in
METLAB in various forms e.g. .bmp, .tiff etc.
2. Split up color image into individual Red, Green and Blue component.
3. Using Jarvis operator we get individual R-G-B color component Halftone image. The pixel in halftone
quantized image is represented by a single bit; so that the overall memory storage required will be
reduced as well it reduces the number of computations.
4. Concatenating of R-G-B component into a colored Halftone image.
5. Generate the shares using pseudo randomized algorithm and pixel reversal as shown in fig 6.
Decryption:
6. Combine the shares to reconstruct secret image.
Figure5: Flow chart for color image
3.3 Pseudo Randomized Visual cryptography for halftone images (generating shares):
Encryption:
The (2, 2) visual cryptography scheme has one secret halftone (gray scale or color) image (SI) as algorithm
input, where SI is said to be a matrix Sij and i and j shows pixel positions and i, j = 1, 2, 3 . . . n.
Input: Secret gray scale or color halftone image (Sij)
Output: Valid Shares Share 1, Share 2.
All steps of algorithm in this scheme are shown below.
1. Pixel Sij with position i and j is the input called original pixel.
2. Apply pixel reversal i.e Sij´ = 255 - Sij.
3. Use random number generator (0.1 to 0.9) to reduce Sij´ randomly.
4. Take the difference of Sij´ with original pixel Sij.
5. Use random number generator to reduce reversed value of Sij´ randomly.
6. Apply pixel reversal i.e Sij´´ = 255 - Sij´.
7. Store in matrix as image called share 1.
8. Take the difference of two random number generators with original pixel Sij.
9. Apply pixel reversal i.e Sij´´´ = 255 - Sij´.
10. Store Sij´´´ in matrix as image called share 2.
11. Repeat point 1 to 10 for all pixels from original image (i.e matrix of original image).
5. Non Expanded Visual Cryptography for Color Images using Pseudo-Randomized Authentication
5
This algorithm is shown in Figure below:
Figur6: Pseudo-Randomized Visual Cryptography (PRVC)
Pair Key Structure:
The input image has been converted to the halftone image. A pair key should be given in order to the
sender and receiver to get paired mutually. If the key value matches between the sender and receiver, the
receiver can further reveal the secret input message. If the pair key fails the receiver can not reveal the secret
message. This structure is designed in order to promote good security level in modern visual secret sharing
(VSS).
Decryption:
Decryption is done just inverse of encryption using proposed algorithm for generating the shares. This
results in no loss of contrast of the original image. The following final equation is used to decrypt the shares:
Decrypted image(S) = (510-Share1-Share2+255*random generator#). / (1+random generator#)
Discussions: This VC scheme use gray scale (or color) secret image. In (2, 2) visual cryptography by Naor &
Shamir was implemented in [9]. Where the decoded image is twice that of original secret image because the
pixel p expanded into two subpixels this effect is called pixel expansion. That affects the contrast of the
resulting image. The previous work on pixel expansion and contrast optimization shows that researcher did
efforts to reduce the expansion and optimize the contrast of the secret picture [10,11,12].Further they portrait the
process of creating the shares using mathematical representations and mainly they focus the security and
contrast condition [13].
In the previous scheme of pseudo randomized VC [14] the original secret image is divided so that it
reveals the secret image after OR operation of qualified shares. And also the decoded image is darker than the
secret image. Some contrast in change and impairments are visible after following these schemes. Based on
observation this algorithm could not give perfect meaningless shares in case of the dark or high contrast secret
image, so added preprocessing elements to change the dark or high level of gray image into lighter one (called
preprocessed image). This is to be done before giving input secret image to algorithm. They defined two way of
preprocessing of the input image as follows.
Change the pixel values to white (255) on the bases of the position of the pixel. Use odd and even
combination of the pixel values in the matrix as follows:
Method 1: If i=j=odd and i=j=even1
Pixel (i, j) = 255.
Method 2: If i=odd & j=even OR i=even & j=odd
Pixel (i, j) = 255.
This preprocessing converts the secret image into lighter one in contrast.
In the proposed scheme the decoded image is same in size of original secret message there is no pixel
expansion effect found. Also there is no loss of contrast of the resulting image , it is same as input image. The
decoded secret image has increase the spatial resolution however mostly of visual cryptography scheme has
shown the same effect in their decoded image.
6. Non Expanded Visual Cryptography for Color Images using Pseudo-Randomized Authentication
6
(A) (B)
(C) (D)
(E)
Figure 7: Pseudo-Randomized visual Cryptography results
(A) Secret Image (B) Halftone Image(C) Share 1 (D) Share 2 (E) Stacking of Share 1 and Share 2
(A) (B)
(C) (D)
7. Non Expanded Visual Cryptography for Color Images using Pseudo-Randomized Authentication
7
(E) (F)
(G) (H)
Figure8: Pseudo-Randomized visual Cryptography results for color image (A) Secret Image
(B) R Component
(C)G Component (D)B Component(E)Halftone image
(F) Share 1(G) Share 2 (H) Stacking of Share 1 and Share 2.
IV. RESULTS AND DISCUSSION
It is seen from figure8 that the secret image has better results without pre-processing after giving the
true gray scale picture. But with the use of preprocessing the shares reveal information about the secret and this
is further improved by the use of proposed algorithm. This shows the perfect meaningless stacked shares. Also it
is seen from Figure9 that the secret color image has better results without pre-processing.
The comparisons of the existing and proposed works as shown in the Table2.
Table2: Comparison of algorithms
Algorithm Complexity Pixel
Expansion
Security Quality
Naor Shamir (basic 2×2) Medium Double Increase Poor
Proposed Technique Less No Expansion Increase Average
V. CONCLUSIONS AND FUTURE WORK
It is seen that the (2, 2) pseudo-randomized visual cryptography which generates shares, based on pixel
reversal, randomized reduction in original pixel and subtractions of the original pixel. The original secret image
is divided so that it reveals the secret image after inverse operation of qualified shares. This scheme reveals
reduced pixel expansion, required for retrieval of the secret image and no loss in contrast of the decrypted
image.
Both original and retrieved image having same sizes are the results of the proposed scheme. But pixel
size increase provides easier alignment of shares which is still a research area. The proposed schemes revealed
good security due to its randomness.
The proposed scheme works well for text, logo. Whereas for grayscale image and color image it works
average. Because of halftoning, quality of the image is degraded.
The future work is to improve the contrast, resolution and reduce the pixel expansion in the resultant
secret image. Further extend this work to use this technique with 3D images for creating the shares that have
partial secret and reveal that secret by stacking to each other.
8. Non Expanded Visual Cryptography for Color Images using Pseudo-Randomized Authentication
8
ACKNOWLEDGEMENT
I would like to give this work to my parent, who has created the author of this thesis. I would like to thank
Dr.Lalitha Y.S my advisor for her understanding and research guidance.
REFERENCES
[1]. Moni Naor and Adi Shamir. Visual cryptography. EUROCRYPT, pages 1{12, 1994}.
[2]. Luiz Velho and Jonas de Miranda Gomes. Digital halftoning with space filling curves. Computer
Graphics, 25(4):81{90, July 1991.
[3]. Chang-Chou Lin and Wen-Hsiang Tsai. Visual cryptography for gray-level images by dithering
techniques. Pattern Recognition Letters, 24:349{358, 2003}
[4]. Young-Chang Hou. Visual cryptography for color images. Pattern Recognition, 36:1619{1629, August
2002}.
[5]. Der-Chyuan Lou, Hong-Hao Chen, Hsien-Chu Wu, and Chwei-Shyong Tsai. A novel authenticable
color visual secret sharing scheme using non-expanded meaningful shares. Displays, 32:118{134,
February 2011.
[6]. C-C Chang, W-L Tai, and C-C Lin. Hiding a secret color image in two color images. The Imaging
Science Journal, 53:229{240, May 2005.
[7]. K. T. Knox, Error Image in Error Diffusion, Proc. Of SPIE, vol. 16, 268-279.
[8]. P. T. Metaxas, Thesis Parallel Digital Halftoning by Error Diffusion, Department of Computer Science,
Wellesley College.
[9]. Zhi Zhou, Gonzalo R. Arce and Giovanni Di Crescenzo,"Half Visual Cryptography", IEEE
Transaction on image processing, vol. 15, no. 8, 2006.
[10]. C. Blundo, P. D'Arco, A. De Santis and D. R. Stinson, "Contrast optimal threshold visual
cryptography schemes", SIAM J. on Discrete Math. 16, 2003, 224-261.
[11]. Carlo Blundo, Alfredo De Santis, Douglas R. Stinson, "On the Contrast in Visual Cryptography
Schemes", Journal of Cryptology: the journal of the International Association for Cryptologic
Research, 1996
[12]. Stelvio Cimato, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci, "Ideal contrast visual
cryptography schemes with reversing", Information Processing Letters, Elsevier,
www.elsevier.com/locate/ipl.
[13]. Jim Cai, "A Short Survey On Visual Cryptography Schemes", 2004 http://
www.cs.toronto.edu/~jcai/paper.pdf.
[14]. Ch.Ratna Babu, M.Sridhar, “Information Hiding in Gray Scale Images using Pseudo - Randomized
Visual Cryptography Algorithm for Visual Information Security”, International Conference on
Information Systems and Computer Networks, 2013.
AUTHOR’S PROFILE
Poojareddy B. Goure received her BE degree in Electronics and Communication
engineering in 2012 from Visvesvaraya Technological University, Karnataka.
Currently, she is pursuing M.Tech in Digital Electronics from AIET, Gulbarga, and
Karnataka. She is working on the project “Non Expanded Visual Cryptography for
Color Images using Pseudo-Randomized Authentication”. Her areas of interest are
Image Processing, VLSI and Software Engineering.
Lalitha Y.S was born on December 7, 1969 in India. She received B.E degree in
Electronics and Communication Engineering and M.E. degree in Power Electronics
from Gulbarga University Gulbarga, India, in 1991 and 2002 respectively. She is
working as Professor in Appa Institute of Engineering & Technology, Gulbarga,
India. Her research interests include image Processing, Wavelet Transform coding.
She attended Four National Conferences and three International Conferences.