Robust visual cryptography-based watermarking scheme for multiple cover images and multiple owners

Liu, Feng; Wu, Chuan

doi:10.1049/iet-ifs.2009.0183

Cited by 39 publications

(28 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…They can be generated through simple deterministic dynamical systems [1] and have promising applications in cryptography [2], random number generation [3,4], watermarking [5], communication [6,7], and systems modeling [8].…”

Section: Introductionmentioning

confidence: 99%

A smooth chaotic map with parameterized shape and symmetry

Chaves

Souza

Pimentel

2016

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

We introduce in this paper a new chaotic map with dynamical properties controlled by two free parameters. The map definition is based on the hyperbolic tangent function, so it is called the tanh map. We demonstrate that the Lyapunov exponent of the tanh map is robust, remaining practically unaltered with the variation of its parameters. As the main application, we consider a chaotic communication system based on symbolic dynamics with advantages over current approaches that use piecewise linear maps. In this context, we propose a new measure, namely, the spread rate, to study the local structure of the chaotic dynamics of a one-dimensional chaotic map.

show abstract

Section: Introductionmentioning

confidence: 99%

A smooth chaotic map with parameterized shape and symmetry

Chaves

Souza

Pimentel

2016

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

show abstract

“…The authors show that the method is efficient against geometric attacks. Another scheme which makes use of the visual cryptography, transform domain, chaos, noise reduction and error correcting code techniques is given in [26]. A non-blind DCT, cross-chaos and Arnold map based watermarking method is presented in [27].…”

Section: Introductionmentioning

confidence: 99%

Robust Chaotic Digital Image Watermarking Scheme based on RDWT and SVD

Çetinel

Çerkezi²

2016

IJIGSP

View full text Add to dashboard Cite

Abstract-In recent years chaos has received a great deal of attention from the researches specialized in communications, signal and image processing. The complexity property of the chaotic signal raised the idea of using such signals in secure communications. Digital image watermarking is a technique mainly developed for copyright protection and image authentication and it can be considered as one application area of the secure communication. In this study, a chaos based digital image watermarking algorithm based on redundant discrete wavelet transform (RDWT) and singular value decomposition (SVD) is proposed. To the best of our knowledge, there do not exist any digital watermarking scheme combining RDWT, SVD and chaos. Robustness and invisibility of the proposed method are improved by using the logistic mapping function to generate a chaotic image matrix serving as the watermark that is used to modify the singular values of the low frequency sub-band of the cover image obtained by applying RDWT. The method is shown to be robust against both the geometrical and image processing attacks and to provide better watermark concealment via computer simulations. Using a chaotic signal as the watermark allows the proposed scheme to meet the security requirements as well.

show abstract

“…Many applications of VCS have been proposed by now [12,14,21,25,29,38]. Besides, recently, many copyright protection schemes which take VCS as building blocks are proposed, for example [5,6,13,17,19,35]. Although some of these copyright protection schemes take the OR based VCS as building blocks, it is clear that, if we change the OR based VCS to the XOR based ones, then the copyright schemes are still valid and can be significantly simplified.…”

Section: Introductionmentioning

confidence: 99%

Optimal XOR Based (2,n)-Visual Cryptography Schemes

Liu

2015

Digital-Forensics and Watermarking

View full text Add to dashboard Cite

A (2, )-Visual Cryptography Scheme (VCS) is a kind of secret sharing scheme, where participants share a secret image, and any two of them can recover the secret image visually without any cryptographic knowledge and computation devices, but any one of them cannot get any information about the secret image other than the size of the secret image. This paper studies the (2, )− , and shows the smallest (optimal) pixel expansion of such schemes, and the largest possible contrast for the (2, ) − given its optimal pixel expansion. It also shows the largest (optimal) contrast of the (2, ) − , and the smallest possible pixel expansion of such schemes given their optimal contrast. The results of this paper show that the (2, ) − can achieve smaller pixel expansion and larger contrast than that of (2, ) − . It also shows that the construction of the basis matrix of optimal contrast (2, )− is equivalent to the construction of binary codes when they reach the maximum capability, and the construction of a specific class of optimal contrast (2, ) − for = 2 − 1 is given.

show abstract

Robust visual cryptography-based watermarking scheme for multiple cover images and multiple owners

Cited by 39 publications

References 18 publications

A smooth chaotic map with parameterized shape and symmetry

A smooth chaotic map with parameterized shape and symmetry

Robust Chaotic Digital Image Watermarking Scheme based on RDWT and SVD

Optimal XOR Based (2,n)-Visual Cryptography Schemes

Contact Info

Product

Resources

About