2013
DOI: 10.5120/12124-8176
|View full text |Cite
|
Sign up to set email alerts
|

Encrypted Reversible Data Hiding on Compressed Image

Abstract: The paper presents a new approach in Image steganography. Information security is the important research field. Steganography process hides message into cover file and forms a stego file. In image steganography there is a need of method which will increase the security, reduce the distortion in the stego file and recovers the data without any loss. In the era of multimedia and internet there is need of reducing time for transmission. The proposed approach is combination of compression, data hiding technique an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…Table 1 shows the classification of schemes based on the literature from the last decade. Neural-based Poetry Generation [4] neuralB Arbitrary Algorithm Encryption [5] AAE Encoding Hiding the Message into An Excel Graph [6] EXCELg RJDA Algorithm [7] RJDA Alphabet Index Matrix (English & Malayalam) [8] ALPHAiM Encoding of Hindi Text [9] EnHindiT Visual Cryptography Schemes [10] VCrypS Homomorphic Encryption Scheme [11] HES A Boots Trappable Encryption Scheme [12] trapEnS Huffman Coding Algorithm [13] HCA Elliptic Curve Cryptography(Ecc) [14] ECC DWT Domain of A Carrier Image [15] DWT Watermark [16] Ws Encapsulation Schemes [17] ENCAPs [25] AES Rivest-Shamir-Adlema Algorithm (RSA) [11], [18], [19], [26] RSA Data Encryption Standard (DES) [23], [27] DES LSB [5], [12], [28] LSB Homomorphic Encryption Scheme [21], [22], [26] HES Conventional Encryption Algorithms Blowfish [23] CEABW Binary RSA Encryption Algorithm (BREA) [19] BREA Symmetric Key Encryption [23], [29], [30] SKE RDH Schemes [31] RDH Huffman Encoding Algorithm [28] HEA Transposition Cryptography Algorithm [32] TCA A Boots trappable Encryption Scheme [12] BTRS ECC Decryption [14] ECC ECR (Encryption with Cover Text and Reordering) [33] ECR…”
Section: Review Categorymentioning
confidence: 99%
“…Table 1 shows the classification of schemes based on the literature from the last decade. Neural-based Poetry Generation [4] neuralB Arbitrary Algorithm Encryption [5] AAE Encoding Hiding the Message into An Excel Graph [6] EXCELg RJDA Algorithm [7] RJDA Alphabet Index Matrix (English & Malayalam) [8] ALPHAiM Encoding of Hindi Text [9] EnHindiT Visual Cryptography Schemes [10] VCrypS Homomorphic Encryption Scheme [11] HES A Boots Trappable Encryption Scheme [12] trapEnS Huffman Coding Algorithm [13] HCA Elliptic Curve Cryptography(Ecc) [14] ECC DWT Domain of A Carrier Image [15] DWT Watermark [16] Ws Encapsulation Schemes [17] ENCAPs [25] AES Rivest-Shamir-Adlema Algorithm (RSA) [11], [18], [19], [26] RSA Data Encryption Standard (DES) [23], [27] DES LSB [5], [12], [28] LSB Homomorphic Encryption Scheme [21], [22], [26] HES Conventional Encryption Algorithms Blowfish [23] CEABW Binary RSA Encryption Algorithm (BREA) [19] BREA Symmetric Key Encryption [23], [29], [30] SKE RDH Schemes [31] RDH Huffman Encoding Algorithm [28] HEA Transposition Cryptography Algorithm [32] TCA A Boots trappable Encryption Scheme [12] BTRS ECC Decryption [14] ECC ECR (Encryption with Cover Text and Reordering) [33] ECR…”
Section: Review Categorymentioning
confidence: 99%
“…Data are compressed in two schemes: the lossy and lossless schemes. Although both schemes save storage space, they differ in the procedures each applies [22,23]. In lossless compression, original data can be rebuilt without any loss, while in lossy compression a part of the data is lost in the quantization process [17,23].…”
Section: Introductionmentioning
confidence: 99%
“…Although both schemes save storage space, they differ in the procedures each applies [22,23]. In lossless compression, original data can be rebuilt without any loss, while in lossy compression a part of the data is lost in the quantization process [17,23]. In the proposed work, to increase capacity, LZW data compression technique is used for compressing the secret data.…”
Section: Introductionmentioning
confidence: 99%