Text encryption via double-random phase-encoding

Sang, Jun; Ling, Shenggui; Alam, Mohammad S.

doi:10.1117/12.886117

Cited by 1 publication

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to reduce the pixel expansion problem two multi-pixel encryption size invariant visual cryptography schemes have been introduced in [10] which improve the visual quality of the recovered secret image by reducing the variance of the darkness levels. Another 2-phase method has been introduced in [12], which employs optimization and a stamping process on binary images and overcomes the problem of pixel expansion and avoids using a pattern book. Very recently, a reversible data hiding scheme for binary images is proposed in [11] that combines pattern substitution and human visual perception.…”

Section: Introductionmentioning

confidence: 99%

“…Thus, bigger size of blocks may be used to distribute the data over the entire image. A double-random phase-encoding based image hiding method has been employed in [12] where the data recovery is shown to have very high probability and the data security could be guaranteed by employing the optical information processing method. In order to ensure accurate data recovery, certain methods use appending the parity bit along with the pixel to be inserted in block (Please see [13], pages 428-433).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Fast and Efficient Data Hiding Scheme in Binary Images

Yadav

Ojha

2012

2012 Eighth International Conference on Intelligent Information Hiding and Multimedia Signal Processing

View full text Add to dashboard Cite

Several data hiding techniques have been proposed in the literature in recent years for binary images. However most of them suffer from image distortion. One such data hiding technique introduced in [7] is based on optimization and dynamic programming. The technique uses block pattern encoding and the resulting images not only contain more data bits, but are also shown to be optimally distortion minimizing. Although the technique is quite effective and produces good results, time taken in encryption is abnormally high with O(n 2 ) complexity. In this paper we have proposed a simpler method for data hiding in binary images that reduces the time complexity of the algorithm to O(n) while keeping the distortion low. We use a twofold encryption by inserting the data in the image using block pattern encoding table similar to [7] and then using XOR operation to increase the security of the data. The proposed algorithm follows a greedy approach which takes into consideration the local minimum cost of bit replacement leading to a significant difference in the execution time.Keywords-block pattern encoding, binary image, block, data hiding, and execution time.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%