Use Of Visual Cryptography For Binary Images

Image hiding, Audio hiding, text hiding, order hiding are the concept of computer age [2].

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

Multimedia content is also in collaboration with Encryption & Decryption standards (CBR).The below paper is the general

To achieve this goal, I have organized my paper into three different sections. Each section will focus on a segment on the history of encryption. In the first section I discuss classical and medieval encryption methods: steganography, and substitution ciphers. In the second section I will exclusively talk about encryption methods used in World War II, such as: Enigma Machine, and JN-25. In the third section I will talk about modern encryption methods: symmetric vs asymmetric key systems. Lastly I will conclude with a finishing paragraph, with my works cited.

So steganography is the technique of concealing of message or information within other message or image. With the advantage of that, it could not showing itself that I have any secret information. In steganography we can many types of format for delivering the secret information within it. But the best carrier file format is image file, as it has low frequency over internet. More variety of steganography technique can be used for hiding secret information. All of them has some differences in their complexity, strong and weak

Moreover, it is feasible to utilize the relation between two or more different network protocols to enable secret communication. These applications fall under the term inter-protocol steganography. [34]

Dead files by dead accounts may not be removed without the cooperation of the corresponding users. In the paper “Steganographic Schemes for File System and B-Tree” [3], they have introduced StegFD, a practical scheme to implement a steganographic file system in which a plausible deniability to owners of protected files is offered. StegFD hides the selected files in a file system securely in such a way that, an attacker will not be able to trace their existence, even if the attacker has full knowledge of the hardware and software and data structures of the file system .They have also proposed two schemes for implementing Steganographic B-trees in a StegFD volume. In paper “A Multi-User Steganographic File System on Untrusted Shared Storage” [4] the threat to steganographic file systems (StegFS) is described which arises when the storage system is untrusted and is shared by multiple users. In such cases, the attacker could obtain multiple snapshots of the storage content and analyze them to deduce the existence of secret user data. To solve this problem, they have introduced a Dummy-Relocatable Steganographic (DRSteg) file system. It employs new techniques to share and relocate dummy data at

Yong Feng et al, in 2009,the author proposed a new invertible two-dimensional chart, shouted Line chart, for picture encryption and decryption. It charts a picture to an array of pixels and next, charts it back from the array to alike sized image. A Line chart consists of two submaps: the left Line chart and the right Line chart that are utilized for picture encryption and decryption. In order to vanquish the shortcoming of standard picture encryption ways established on two-dimensional (2-D) charts that can be utilized merely for permutation, this paper presents a novel picture encryption way established on the Line charts, that can present two procedures of picture encryption simultaneously, permutation and substitution, employing the alike maps. The counseled picture encryption does not have data loss. Supplementary gains contain that it is fast and there is no check on the length of protection key that is desirable for disparate protection requirements. Simulation aftermath display the effectiveness of the new picture encryption scheme. [20]

In the version of security analysis and experimental results our proposed encryption scheme is fast and on the other hand provides good security and adds very less overhead on the data, this today is the requirement of most of the multimedia applications.

The process of Visual Cryptography, as developed through the original algorithm [12], was designed to be used with binary images. This is illustrated from the nature of the shares and the encryption process documented previously. If the secret messages being encoded contain text or binary images, the process shown in the original algorithm works well. However, the world is not composed of solely black and white pixels. With the increasing production of images in the digital age, gray and colour images have a pressing need for encryption and protection as much, or more, as binary images.

Abstract - This paper proposes a data hiding method using adaptive pixel pair matching and data encryption approach for secret data communication. Steganography is the science of hiding secret data in plain sight within cover data so that it can be securely transmitted over a network. The idea of PPM is to use the values of pixel pair as a reference coordinate, and search a coordinate in the neighborhood set of this pixel pair according to a given message digit. Before hiding the data within cover image, two encryption schemes chaos encryption for secret messages and selective encryption for cover object are used to increase the data protection. The results will prove that the proposed method not only provides better performance than those of LSB and OPAP, but also is secure under the detection of some well-known steganalysis techniques.

Xiaoheng Deng et al, 2013, they counsel an enhanced picture encryption algorithm established on hyper chaotic arrangement and permutation-diffusion structure. In the permutation procedure, the algorithm introduces plain-text feedback mechanism that makes the permutation result not merely associated alongside the chaotic sequences, but additionally connected to plain-text. And in the diffusion procedure, the algorithm introduces both cipher-text and plain-text feedback mechanisms to diffuse the permuted image. All of these methods make the mapping-relationship amid cipher-text and plain-text as well as hidden keys extra complex. At last, the protection scutiny such as key space scutiny, histograms, correlation coefficients, data entropy, key sensitivity scutiny, plaintext sensitivity, speed analysis. They additionally present sequence evaluation examinations, experimental aftermath display that the counseled picture encryption scheme is of extremely good presentation on protection and reliability, alongside elevated possible to be adopted for the safeguard picture contact applications.[54]

VISUAL cryptography (VC) is a branch of secret sharing data. In the VC scheme, a secret image is encoded into transparencies, and the content of each transparency is noise-like so that the secret information cannot be retrieved from any one transparency via human visual observation or signal analysis techniques. In general, a -threshold VC scheme has the following properties: The stacking of any out of those VC generated transparencies can reveal the secret by visual perception, but the stacking of any or fewer number of transparencies cannot retrieve any information other than the size of the secret image. Naor and Shamir [1] proposed a –threshold VC scheme based on basis matrices, and the model had been further studied and

part uses random sequences generated from chaos system with the help of an encryption key. This key is then used to encrypt media contents with a neural network structure. However, the apparent disadvantage in this scheme is that more sub-keys need to be transmitted to the receiver. In another research [45], the authors propose an image encryption/decryption algorithm based on chaotic neural network. The employed network comprises two layers each with three layers: chaotic neuron layer (CNL) and permutation neuron layer (PNL). The approach uses a 160-bit-long authentication code to generate initial conditions and the parameters of both layers. The overall process is repeated several times to make it robust and increasingly complex. The proposed method uses two more keys where a slight mismatch in one of them fails in successfully decrypting an image. The authors in [46] propose an encryption method based on a hybrid chaos-based encryption algorithm. The algorithm employs permutation–diffusion architecture that uses chaotic control parameters for permutation. These control parameters for the permutation stage are generated by a logistic map. In the diffusion stage, another chaotic logistic map with different initial conditions and parameters is used to generate initial conditions for a hyper-chaotic Hopfield neural network to generate a key stream for image homogenization of the shuffled image. In order to provide summarized view, the authors in [47] present survey of

Alongside watermarking, perceptual image hashing has emerged as an attractive way to verify the authenticity of digital images [1], [5], [6]. Also, image hashing and watermarking could be complementary in that the watermark has to depend on both a secret key and image content to eliminate any possibility of estimating the watermark based on watermarked image observations; hence, the need for image hashes [7], [8]. Indeed, a secure hash can be used in watermarking to solve the problem of multiple ownership claims.