Hybrid watermarking based on chaos and histogram modification

Chrysochos, E.; Fotopoulos, V.; Xenos, Michalis; Skodras, Athanassios

doi:10.1007/s11760-012-0307-3

Cited by 30 publications

(33 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The scheme proposed by Chrysochos et al [12] is based on the idea of (selectively) swapping two selected neighboring histogram bins a and b so that a message bit is encoded by the heights of the two bins (denoted by hist(a) and hist(b)): a 1-bit is encoded by hist(a) > hist(b) and a 0-bit by hist(a) < hist(b). Here, swapping two histogram bins a and b means changing all pixel values a to b and vice versa.…”

Section: Histogram Based Watermarking Schemesmentioning

confidence: 99%

“…1. Examples include the image watermarking schemes proposed in [10,12] and the video watermarking scheme proposed in [13]. The last scheme makes use of both the spatial histograms of single frames and the temporal histogram for a given video sequence.…”

Section: The Proposed Cwe Frameworkmentioning

confidence: 99%

“…The watermarking part is designed following the basic principle of the histogram based watermarking scheme proposed in [12]. However, since this scheme suffers from two severe limitations, namely a very small key space and a small capacity, we have devised a modified watermarking scheme to overcome both problems.…”

Section: Watermarking Partmentioning

confidence: 99%

“…Basic Scheme For embedding the watermark, we select each bin pair randomly from all remaining candidates rather than in a sequential order as in the original scheme [12], which leads to a significantly bigger key space. The process is driven by a stream cipher that serves as a secret pseudo-random number generator.…”

Section: Watermarking Partmentioning

confidence: 99%

See 3 more Smart Citations

Communications and Multimedia Security

Chadwick

Decker

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a new approach to commutative watermarkingencryption (CWE). A permutation cipher is used to encrypt the multimedia data, which leaves the global statistics of the multimedia data intact. Therefore, any non-localized watermarking scheme that depends only on global statistics of the multimedia data can be combined with the permutation cipher to form a CWE scheme. We demonstrate this approach by giving a concrete implementation, which manipulates the global histogram to achieve watermark embedding/detection.

show abstract

Section: Histogram Based Watermarking Schemesmentioning

confidence: 99%

Section: The Proposed Cwe Frameworkmentioning

confidence: 99%

Section: Watermarking Partmentioning

confidence: 99%

Section: Watermarking Partmentioning

confidence: 99%

See 2 more Smart Citations

Communications and Multimedia Security

Chadwick

Decker

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Recently, this fact has been utilized to devise a commutative watermarking-encryption (CWE) scheme by choosing a permutation cipher for encryption and a histogram-based scheme for watermarking [1]. However, typical histogram-based watermarking schemes like [1], [2] work by comparing selected histogram bins, where the selection process is controlled by a watermarking key. If the whole histogram is shifted by a small amount, i.e.…”

Section: Introductionmentioning

confidence: 99%

Towards More Robust Commutative Watermarking-Encryption of Images

Schmitz

Grecos

et al. 2013

2013 IEEE International Symposium on Multimedia

View full text Add to dashboard Cite

Abstract-Histogram-based watermarking schemes are invariant against pixel permutations and can be combined with permutation-based ciphers. However, typical histogram-based watermarking schemes based on comparison of histogram bins are prone to de-synchronization attacks, where the whole histogram is shifted by a certain amount. In this paper we investigate the possibility of avoiding this kind of attacks by synchronizing the embedding and detection processes, using the mean of the histogram as a calibration point. The resulting watermarking scheme is resistant to three common types of shifts of the histogram, while the advantages of previous histogrambased schemes, especially commutativity of watermarking and permutation-based encryption, are preserved. I. INTRODUCTIONIt is well known that histogram-based watermarking schemes are resistant to permutations of image pixels. In particular, this implies robustness against rotation, scaling and translation (RST) of images. Recently, this fact has been utilized to devise a commutative watermarking-encryption (CWE) scheme by choosing a permutation cipher for encryption and a histogram-based scheme for watermarking [1]. However, typical histogram-based watermarking schemes like [1], [2] work by comparing selected histogram bins, where the selection process is controlled by a watermarking key. If the whole histogram is shifted by a small amount, i.e. by adding a small number to each pixel's value, the detector will use different bin pairs for extracting the embedded watermark and will produce wrong results. To overcome this problem, in the present paper, we extend the scheme described in [1] by deploying a synchronization process between embedder and detector that is based on the global mean of the histogram. A similar approach is used in the scheme [3], but this watermarking scheme does not use a sufficiently long secret watermarking key and has a limited capacity.The rest of the paper is organized as follows: In Section II we briefly summarize previous histogram-based watermarking algorithms. Section III describes the three types

show abstract