• No results found

Separable & Secure Data Hiding & Image Encryption Using Hybrid Cryptography

N/A
N/A
Protected

Academic year: 2022

Share "Separable & Secure Data Hiding & Image Encryption Using Hybrid Cryptography"

Copied!
5
0
0

Loading.... (view fulltext now)

Full text

(1)

Separable & Secure Data Hiding & Image Encryption Using Hybrid Cryptography

1 Vinay Wadekar, 2 Ajinkya Jadhavrao, 3 Sharad Ghule, 4 Akshay Kapse

1,2,3,4

Computer Engineering, University Of Pune, Pune, Maharashtra 412207, India

Abstract -This work proposes a technique for separable data hiding in encrypted images. In the first phase, a content owner encrypts the original uncompressed image using an encryption key. Then, a data-hider encrypts image using key and add data into it. With an encrypted image containing additional data, if a receiver has the data-hiding key, he can extract the additional data though he does not know the image content. If the receiver has the encryption key, he can decrypt the received data to obtain an image similar to the original one, but cannot extract the additional data. If the receiver has both the data-hiding key and the encryption key, he can extract the additional data and recover the original content without any error by exploiting the spatial correlation in natural image when the amount of additional data is not too large.

Keywords - encryption, data hiding, separable, hybrid cryptography

1. Introduction

In some applications, an inferior assistant or a channel administrator hopes to append some additional message, such as the origin information, image notation or authentication data, within the encrypted image though he does not know the original image content. And it is also hopeful that the original content should be recovered without any error after image decryption and message extraction at receiver side. A content owner encrypts the original image using an encryption key, and a data-hider can embed additional data into the encrypted image using a data-hiding key though he does not know the original content. With an encrypted image containing additional data, a receiver may first decrypt it according to the encryption key, and then extract the embedded data and recover the original image according to the data-hiding key. In the scheme, the data extraction is not separable from the content decryption. In other words, the additional data must be extracted from the decrypted image, so that the principal content of original image is revealed before data extraction, and, if someone has the data-hiding key but not the encryption key, he cannot extract any

information from the encrypted image containing additional data.

2. Literature Survey

As in ‘Reversible Data Hiding in Encrypted Image By Reserving Room Before Encryption’[1] method the for hiding data into image LSB Replacement technique is used

& data and image encryption is done using only one algorithm. In LSB Replacement the only least significant bit are replace by data, therefore less data can put in image.

3. Proposed System

In proposed system we are using Bit Plane Complexity Segmentation (BPCS) algorithm to embed data into image.

The BPCS algorithm has more load balancing capacity than other algorithms. Load balancing capacity means how much data we can insert in image with or without disturbing image. Also we are using different algorithms for encryption of data and image. So the security of data and image get increased.

Figure 1: Proposed Architecture.

(2)

3.1 Algorithms

In this proposed system we will use algorithms RSA &

Advanced Encryption Standard (AES) for encryption of data and image respectively. And BPCS algorithm will be used for hiding encrypted data into encrypted image.

A) RSA Algorithm :-

RSA stands for Ron Rivest, Adi Shamir and Leonard Adleman, who first publicly described it in 1977.

The RSA algorithm involves three steps: key generation, encryption and decryption.

Key Generation:

RSA involves a public key and a private key. The public key can be known to everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted using the private key.

The keys for the RSA algorithm are generated the following way:

1. Choose two distinct prime numbers p and q.

• For security purposes, the integers p and q should be chosen at random, and should be of similar bit-length.

Prime integers can be efficiently found using a primality test.

2. Compute n = pq. (1)

• n is used as the modulus for both the public and private keys

3. Compute

φ(n) = (p – 1)(q – 1),

(1) where φ is Euler's totient function.

4. Choose an integer e such that 1 < e < φ(n) and greatest common divisor of (e, φ(n)) = 1; i.e., e and φ(n) are coprime.

•e is released as the public key exponent.

5. Determine d as :-

(2) i.e., d is multiplicative inverse of e mod φ(n).

Encryption

If X wants to send message M to Y, then he first turns M into integer m such that 1<= m <= n

Then computes cipher text c

(2) And send c.

Decryption

Y can recover m from c using private key exponent d

(3) original message M by reversing the padding scheme.

B) AES Algorithm

The Advanced Encryption Standard (AES) is a specification for the encryption of electronic data established by the U.S. National Institute of tandards and Technology (NIST) in 2001.

AES is based on a design principle known as a substitution-permutation network.

Steps :-

1. Key Expansion—round keys are derived from the cipher key using Rijndael's key schedule

2. Initial Round

i. Add RoundKey—each byte of the state is combined with the round key using bitwise xor

3. Rounds

i. SubBytes—a non-linear substitution step where each byte is replaced with another according to a lookup table.

ii. ShiftRows—a transposition step where each row of the state is shifted cyclically a certain number of steps.

iii. MixColumns - a mixing operation which operates on the columns of the state, combining the four bytes in each column.

iv. AddRoundKey

4. Final Round (no Mix Columns) 1. SubBytes

2. ShiftRows 3.AddRoundKey

C) BPCS Algorithm

BPCS steganography was introduced by Eiji Kawaguchi and Richard O. Eason, to overcome the short comings of traditional steganographic techniques such as Least Significant Bit (LSB) technique, Transform embedding technique, Perceptual masking technique.

This traditional technique has limited data hiding capacity and they can hide up to 10 – 15% of the vessel data amount. BPCS steganography makes use of important

characteristic that of human vision.

In BPCS, the vessel image is divided into informative region” and “noise-like region” and the secret data is hidden in noise blocks of vessel image without degrading image quality . In LSB technique, data is hidden in last four bits i.e. only in the 4 LSB bits . But in BPCS technique, data is hidden in MSB planes along with the

(3)

LSB planes provided secret data is hidden in complex region .

4. Mathematical Model

Let us consider S be a Systems such that S= {U, ES, K, DE, DS}, where

 U= {U1, U2, U3…….Un | ‘U’ is a Set of all Sender}

 R= {R1, R2, R3…….Rn | ‘R’ is a Set of all Receiver}

 ES = {ERSA, EAES | ‘ES’is a Set of Encryption Service }

 K= {K1, K2, K3…….Kn | K is a Set of Keys }

 DE = {UID, PUB_KEY, PRV_KEY | DE is a Set of data table for storing of Keys on Encryption /Decryption Server }

 Ds={BPCS|Ds is a set of image and data combining algorithms }

4.1 Events EVENT 1

Encrypt image file initially using AES at user side Let f(Es) be a function of Encryption Service.

Thus, f(Es) {F1,F2,F3……Fn} € F

EVENT 2

Encrypt data file initially using RSA at user side Let f(Es) be a function of Encryption Service.

Thus, f(Es) {F1,F2,F3……Fn} € F

EVENT3

Combine Image and Data using BPCS algorithm.

Let , f(Ds) be a function of image and data Combination algorithms.

thus, f(Ds) {ERSA U EAES } € E

EVENT4

Send that encrypted image to receiver . Let f(Us) be a function receiver.

Thus, f(Us) {R1,R2,R3……Rn} € R

EVENT 5

Send AES key to receiver , who want to decrypt image.

Let f(EAES) be a function of Encryption Service.

Thus, f(EAES) {R1,R2,R3……Rn} € R

EVENT 6

Send RSA private key to receiver , who only want to decrypt data.

Let f(ERSA) be a function of Encryption Service.

Thus, f(ERSA) {R1,R2,R3……Rn} € R

EVENT 7

Valid receiver can decrypt image using AES key.

Let f(EAES) be a function of Encryption Service.

Thus, f(EAES) {K1,K2,K3……Kn} € K

EVENT 8

Valid receiver can decrypt data using RSA private key.

Let f(ERSA) be a function of Encryption Service.

Thus, f(ERSA) {K1,K2,K3……Kn} € K

EVENT 9

Valid receiver can decrypt data using RSA private key.

Let f(EAES U ERSA) be a function of Encryption Service.

Thus, f( EAES U ERSA ) {K1,K2,K3……Kn} € K

4.2 Venn Diagram

Activity 1: Image will get encrypted using AES algorithm.

Activity 2 : Data will get encrypted using RSA algorithm.

(4)

Activity 3: Combine Image and Data using BPCS algorithm.

Activity 4: Send that encrypted image to receiver .

Activity 5: Send AES key to receiver , who only want to decrypt image.

Activity 6: Send RSA key to receiver , who only want to decrypt Data.

Activity 7: Valid receiver can decrypt image using AES key.

Activity 8: Valid receiver can decrypt Data using RSA key.

Activity 9: Valid receiver can decrypt Image usingAES key and Data using RSA key .

5. Conclusion

The encrypted data can hide in encrypted image by sender.

There may be image encryption and data hiding two separate functions. There are two different encryption keys for data and image.

At receiver side, he can decrypt data from image only if having data encryption key and can decrypt image if having image encryption key. It is on sender which key is

(5)

to be provided to which user. Key’s are sent via SMS on mobile. By this sender has full control over image and data.

6. References

[1] Kede Ma, Weiming Zhang, Xianfeng Zhao, Member, IEEE, Nenghai Yu, and Fenghua Li, “Reversible Data Hiding in Encrypted Images by Reserving Room Before Encryption” IEEE Trans. Inform. Forensics Security, vol.

8, no. 3, pp. 53–58, March. 2013.

[2] Xinpeng Zhang , “Separable Reversible Data Hiding in Encrypted Image” IEEE Trans. Inform. Forensics Security, vol. 7, no. 2, pp. 53–58, April. 2012.

[3] Shrikant Khaire, DR. SANJAY L. ALBALWAR

“Review: Steganography – Bit Plane Complexity Segmentation (BPCS) Technique” International Journal of Engineering Science and Technology Vol. 2(9), 2010, 4860-4868

Author Details

Vinay Wadekar :

Studying in Final Year Computer Science Engineering, at University Of Pune in 2014-15.

Current research interest in security of data, hacking.

Ajinkya Jadhavrao :

Studying in Final Year Computer Science Engineering, at University Of Pune in 2014-15.

Current research interest in data encryption.

Sharad Ghule:

Studying in Final Year Computer Science Engineering, at University Of Pune in 2014-15.

Current research interest in data embedding in image.

Akshay Kapse:

Studying in Final Year Computer Science Engineering, at University Of Pune in 2014-15.

Current research interest in image processing.

References

Related documents

Membership for the MH QI Team, also known as the Mental Health Action Team, is composed of the Director of Mental Health Services, the Assistant Director of Mental Health

In Athi River Early Childhood Development and Education (ECDE) has been left to parents resulting topoor and adequate science and mathematics instructional resources. Other

No such study of (CA) n dinucleotide indels of mtDNA HVR III 514 – 524 region in Indian population has been reported so far; this study was aimed to evaluate the (CA) n

Various laparoscopic tech- niques have been described for the treatment of ovarian endometriomas: cyst wall laser vaporization preceded or not by medical therapy, drainage and

( d ) Scatter diagram of the amplitude of the conductance blockade versus translocation time for DNA translocation through a 10-nm diameter nanopore in a graphene monolayer.

Abstract: - The aim of this paper is to estimate the mean monthly values of clearness index in five meteorological stations in Iraq (Mosul , Kirkuk , Rutba , Baghdad

We can boldly say that technique use here is similar to (Jacob and Preetha, 2013), but added data modification techniques to it which makes it one step

The museum halls have several superiorities to distribute Beacons. Firstly, Beacons can be placed nearby or behind a collection, or be put at a specific place, take the lobby