Analysis of modified triple &amp;#x2014; A steganography technique using Fisher Yates algorithm

Alam, Shahzad; Zakariya, Syed Mohammad; Akhtar, Nadeem

doi:10.1109/his.2014.7086199

Cited by 9 publications

(8 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper provides a robust and secure LSB substitution based method using Pseudo Random Number Generator (PRNG) that can hide a large volume of data. Comparing with the other methods [14,15] for embedding high capacity data using similar approach such as PRNG or Hash function, the proposed method produces good and encouraging results. In the next section, the literature survey of the similar steganographic techniques is discussed.…”

Section: Introductionmentioning

confidence: 85%

See 1 more Smart Citation

A LSB Based Image Steganography Using Random Pixel and Bit Selection for High Payload

Ali¹,

Ali²,

Sohrawordi³

et al. 2021

IJMSC

View full text Add to dashboard Cite

Security in digital communication is becoming more important as the number of systems is connected to the internet day by day. It is necessary to protect secret message during transmission over insecure channels of the internet. Thus, data security becomes an important research issue. Steganography is a technique that embeds secret information into a carrier such as images, audio files, text files, and video files so that it cannot be observed. In this paper, based on spatial domain, a new image steganography method is proposed to ensure the privacy of the digital data during transmission over the internet. In this method, least significant bit substitution is proposed where the information embedded in the random bit position of a random pixel location of the cover image using Pseudo Random Number Generator (PRNG). The proposed method used a 3-3-2 approach to hide a byte in a pixel of a 24 bit color image. The method uses Pseudo Random Number Generator (PRNG) in two different stages of embedding process. The first one is used to select random pixels and the second PRNG is used select random bit position into the R, G and B values of a pixel to embed one byte of information. Due to this randomization, the security of the system is expected to increase and the method achieves a very high maximum hiding capacity which signifies the importance of the proposed method.

show abstract

Section: Introductionmentioning

confidence: 85%

“…Later on considering the nature of human vision system and sensitivity of light [13], some other methods were proposed in [14] called 4-4-4 and 3-3-2 methods. In first one, authors proposed the method for the situation where high capacity data transfer is more considerable than the security.…”

Section: Related Workmentioning

confidence: 99%

A LSB Based Image Steganography Using Random Pixel and Bit Selection for High Payload

Ali¹,

Ali²,

Sohrawordi³

et al. 2021

IJMSC

View full text Add to dashboard Cite

show abstract

“…This section compares the proposed data hiding technique with state-of-the-art data hiding methods. The comparison is made based on hiding capacity HC, peak signal to noise ratio PSNR, and structure similarity index SSI M. The proposed technique is compared with well-know data hiding techniques of Honsinger et al [9], Macq and Dewey [50], Fridrich et al [8], Lin and Li [51], Jaiswal et al [52], Goljan et al [53], Vleeschouwer et al [54], Khan et al [55], Alam et al [56], Wang et al [57], Khan and Tiziano [20], Khamrui and Mandal [58], Chang et al [28], Lee and Chen [59], Lin and Shiu [29], Koikara and Goswami [60], Hou et al [61], Wang et al [62], and Huang et al [63]. The comparison is made using three different cover images (Lena, Mandrill, and Pepper).…”

Section: Comparisonmentioning

confidence: 99%

A Modulo Function-Based Robust Asymmetric Variable Data Hiding Using DCT

Khan

Arif

et al. 2020

Symmetry

View full text Add to dashboard Cite

This work presents a new asymmetric data hiding technique that hides a variable number of secret message bits in the discrete cosine transform (DCT) coefficients of a cover image using a modular distance technique. Prior to data hiding, the proposed framework transforms a cover image from a spatial domain to various frequency coefficients using DCT. The DCT coefficients are arranged in two groups: one with low-frequency coefficient, and the other with the medium and high-frequency coefficients. The medium and higher frequency coefficients are processed for variable data hiding asymmetrically. The proposed technique hides variable sets of secret information bits in different coefficients. The variation in hidden secret information is maintained using a key developed based on the modulo of distance of a coefficient from the reference point. The same key is also used to retrieve the confidential information at the receiver ends. The results reveal that the presented framework does not create any visually significant distortion, and thus the hidden information does not attract the human visual system (HVS). The technique also results in high data hiding efficiency.

show abstract

“…To safeguard the electronic documents from potential hackers, public-key cryptography [1,3,6] known as digital signatures are used to authenticate the data sent over the channels. The image encryption and decryption algorithm is designed and implemented to provide confidentiality and protection in transmission of information in digital form [9]. Encryption can protect the privacy of data, but other methods are still needed to protect the integrity and authenticity of data.…”

Section: Introductionmentioning

confidence: 99%

Digital image authentication and encryption using digital signature

Alam

Jamil

Saldhi

et al. 2015

2015 International Conference on Advances in Computer Engineering and Applications

Self Cite

View full text Add to dashboard Cite

In this paper, a methodology for digital image authentication using digital signature is proposed. The hash of the original image is taken and is encrypted by RSA. The digital signature obtained is concealed in the image. Digital signature is sent along with the encrypted image which decreases the probability of meticulous attack by the intruder. The encrypted image is shuffled using Chaotic Logistic Map to get the final shuffled encrypted image. The use of Logistic Map improves the randomness in the image. For the authentication, a comparator is employed which evaluates correctness of the hash extracted. The simulations have been carried out to examine the proposed authentication and encryption technique.

show abstract

Analysis of modified triple — A steganography technique using Fisher Yates algorithm

Cited by 9 publications

References 16 publications

A LSB Based Image Steganography Using Random Pixel and Bit Selection for High Payload

A LSB Based Image Steganography Using Random Pixel and Bit Selection for High Payload

A Modulo Function-Based Robust Asymmetric Variable Data Hiding Using DCT

Digital image authentication and encryption using digital signature

Contact Info

Product

Resources

About