Vsual Cryptography : A Branch Of Secret Sharing Data

being attacked, encrypt it with a secret key to obtain an encrypted bit stream . For that AES encryption is used. After AES encryption, will embed at the fourth bit position of . Some related information about the mosaic image generation process into the mosaic image for use in the secret image recovery process are also embed at the last fourth bit position of . Such information, described as a bit stream I like M, includes the following data items: 1) encryption key; and 2) total length of before encryption. After all this process Target image with mosaic image, residual value and all information that required to recover original image are transmitted to receiver

Goal of coding theory is different to data hiding method even though both methods use the error correction codes [23]. In coding theory, syndrome equation in the first stage of decoder block is used to detect and correct error which is not expected in advance at the encoder block, whereas in data hiding, syndrome is used to choose proper coefficients to insert a watermark signal and decrease distortion. In the embedding process, by choosing proper e(x), some of the host image bits are modified intentionally.

Multimedia security is ever demanding area of research covering different aspects of electrical engineering and computer science. In this chapter, our main focus is encryption of JPEG2000 compatible images. Though both stream and block cipher have been investigated in the literature, but this chapter provides a detailed study of block cipher as applied to images, since JPEG2000 generates various subband sizes as blocks. In the first section, we briefly define various encryption components like wavelet transform, bit plane decomposition, XOR operation, artificial neural network, seed key generator and chaotic map functions, for interest of the reader. Later in section 2, we present literature review of various encryption techniques from two perspectives: applications to highlight scope of research in this domain; and approaches to provide overall view of multimedia encryption. The section three provides a new two-layer encryption technique for JPEG2000 compatible images. The first step provides a single layer of encryption using a neural network to generate a pseudo-random sequence with a 128-bit key, which XORs with bit planes obtained from image subbands to generate encrypted sequences. The second step develops another layer of encryption using a cellular neural network with a different 128-bit key to develop sequences with hyper chaotic behavior. These sequences XOR with selected encrypted bit planes (obtained in step 1) to generate doubly-encrypted bit planes. Finally,

Here we briefly describe the LSB matching revisited based on adaptive steganography. In 2010 Weiqi Luo et al. [20] proposed an edge adaptive scheme which select the regions for embedding according to the size of secret message and the difference between two successive pixels in the cover image. For lesser embedding rates, simply sharper edge regions are used while keeping the other smoother regions as they are. When the embedding rate enhances, more edge regions can be released adaptively for data hiding by modifying just a few parameters. LSB matching revisited (LSBMR)[4] considers a pair of pixels as an embedding component, in which the LSB of the first pixel embeds one bit of secret message, and the relationship (odd–even combination) of the two pixel values carries another bit of secret message.The modification rate of pixels can decrease from 0.5 to 0.375 bits/pixel (bpp) in the case of a maximum embedding rate, meaning lesser changes to the cover image at the same payload compared to LSB replacement and LSB matching. It has been shown that such a scheme can avoid the LSB replacement style asymmetry, and thus it should make the detection slightly more difficult than the LSB matching scheme.The approach consist of two parts-embeddding and extraction. The embedding part first initializes some parameters, which are used for successive data preprocessing and region selection, and then estimates the capacity of selected regions. If the regions are big enough for hiding the secret message , then data hiding is performed on the selected regions. Then,it does some postprocessing to get the stego image. Otherwise the scheme needs to revise the parameters, and then repeats region selection and

Abstract— Steganography is a technique of hiding the secret information. Steganography hides the existence of the secret data and make the communication undetectable. Secret data can be communicated in an appropriate multimedia carrier such as image, audio or video. Image steganography is extensively used technique. In this technique secret data is embedded within the image. Steganography techniques can be categorized into two groups - adaptive and non-adaptive. Each of these have its strengths and weaknesses. Adaptive steganography embeds the secret information in the image by adapting some of the local features of the image. Non-adaptive steganography embeds secret data equally in each and every pixel of the image. Several techniques have been proposed for hiding the

Image Steganography: In today’s digital world secret messages get embedded in to the digital image which is called as Image Steganography where cover object used is Image . Because of the limited power of the Human vision system this method is most commonly used [5].

Steganography is art of hiding the secret message within an ordinary message and extraction of its destination. Steganography take cryptography a step farther by hiding an encrypted message so that no one finds the existence of the message. If anyone scans your data will fail to know that it contain encrypted data. Steganography maintain the secure communication between the communicating parties. There are different techniques that are used for hiding the secret data as Steganography, Cryptography and Watermarking. There are various drawbacks of the cryptography that are covered by the Steganography. This paper reviews the Steganography techniques and various matrices for performance analysis of Steganography techniques.

Often there has been a need to protect information from 'prying eyes'. In the electronic age, information that could otherwise benefit or educate a group or individual can also be used against such groups or individuals. Industrial espionage among highly competitive businesses often requires that extensive security measures be put into place. And, those who wish to exercise their personal freedom, outside of the oppressive nature of governments, may also wish to encrypt certain information to avoid suffering the penalties of going against the wishes of those who attempt to control.

            Some data is very sensitive and therefore it has to be hidden away from parties who are not supposed to view it. In this age of computers, their capacity for transfer and retrieval of information may be exploited by other parties to gain access to confidential and potentially dangerous data. Therefore, measures have been taken to ensure that data is not accessed by others which is done by using several methods which, besides physical security, includes the use of encryption algorithms which are programs that change the way information looks by rendering it illegible.

The core idea of this image encryption scheme (Tiegang Gao et al.,2007) is based on total shuffling matrix using the Logistic map, and the substitution of the shuffled image with a keystream

Since from the earlier times, people are bothered about how to securely transmit secret messages. Both Cryptographic techniques and steganographic techniques are used to achieve this aim. In cryptography, the existence of the encrypted message is visible to the world, whereas in Steganography, only the sender and the receiver know the existence of the message. Darrel Hankerson, Alfred Menezes, and Scott Vanstone explained the various arithmetic behind elliptic curves and addresses some issues that arise in ECC implementation in detail [1]. Lawrence C. Washington provides an introduction to both the number theoretic and the cryptographic sides of elliptic curves. To securely transfer text and image through the network, various techniques have been developed in recent years using Elliptic Curve Cryptography [2]. S. Maria Celestin Vigila and K. Muneeswaran proposed an image encryption algorithm using ECC. They generated the values of k and nB by a random number generator, Comparative Linear Congruential Generator (CLCG) to give credibility [3]. Ali Soleymani, Md Jan Nordin, and Zulkarnain Md Ali creates a mapping table which has the intensity values ranging from 0 to 255 along the row and the corresponding columns of each row contain the elliptic curve coordinates. All the pixels of an image are mapped to related points on the elliptic curve using the table and encryption is done using receiver’s public key. To view the cipher image, we refer to the mapping table and find the

In this paper, we've got proposed a technique that detects tampering involving facial regions via evaluating the dissimilarity among the brightness distributions. We have considered two cases of tampered images; images with three face and pictures with two faces. For images with three faces, distance comparison between histograms of three faces is carried out for detecting tampered face. For images with two faces, the distance between two faces is checked against a threshold to detect if the image is tampered. Both bin-by-bin procedures and move-bin measures are calculated as distance

In [1] the existing system focuses on the data securityapproach when combined with encryption and steganographic techniques for secret communication by hiding it inside the multimedia files. The high results are achieved by providing the security to data before transmitting it over the internet. The files such as images, audio, video contains collection of bits

Information sharing is an essential usefulness in distributed storage. In this article, we demonstrate to safely, productively, and adaptably impart information to others in distributed storage. We portray new open key cryptosystems, which create steady size figure messages such that productive assignment of decoding rights for any arrangement of figure writings are conceivable. One can total any arrangement of mystery keys and make them as conservative of a solitary key, yet including the force of every last one of keys being accumulated. As it were, the mystery key holder can discharge a consistent size total key for adaptable decisions of figure content set in distributed storage, yet the other scrambled

Security is the first priority in today digital world for secure communication between sender and receiver. Various Cryptography techniques are developed time to time for secure communication. Quantum Cryptography is one of the latest and advanced cryptography technique, it is different from all other cryptography technique and more secure. It based on the Quantum of physics since its name which make it more secure from all other cryptography and UN breakable. In this paper about quantum cryptography i.e working, limitation and advantages discussed.