×

A maximum entropy-based chaotic time-variant fragile watermarking scheme for image tampering detection. (English) Zbl 1335.68085

Summary: The fragile watermarking technique is used to protect intellectual property rights while also providing security and rigorous protection. In order to protect the copyright of the creators, it can be implanted in some representative text or totem. Because all of the media on the Internet are digital, protection has become a critical issue, and determining how to use digital watermarks to protect digital media is thus the topic of our research. This paper uses the Logistic map with parameter \(u=4\) to generate chaotic dynamic behavior with the maximum entropy 1. This approach increases the security and rigor of the protection. The main research target of information hiding is determining how to hide confidential data so that the naked eye cannot see the difference. Next, we introduce one method of information hiding. Generally speaking, if the image only goes through Arnold’s cat map and the Logistic map, it seems to lack sufficient security. Therefore, our emphasis is on controlling Arnold’s cat map and the initial value of the chaos system to undergo small changes and generate different chaos sequences. Thus, the current time is used to not only make encryption more stringent, but also to enhance the security of the digital media.

MSC:

68P25 Data encryption (aspects in computer science)
94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[2] Hsu, Multiresolution watermarking for digital images, IEEE Trans. Circuit Syst. II: Analog Digital Signal Process. 45 pp 1097– (1998) · doi:10.1109/82.718818
[3] DOI: 10.1016/j.jss.2011.02.029 · doi:10.1016/j.jss.2011.02.029
[4] DOI: 10.1007/s11554-011-0218-5 · doi:10.1007/s11554-011-0218-5
[5] DOI: 10.1016/j.patcog.2005.02.007 · Zbl 02225501 · doi:10.1016/j.patcog.2005.02.007
[9] Walton, Information authentication for a slippery new age, Dr. Dobbs Journa. 20 pp 18– (1995)
[10] DOI: 10.1142/S021812749800098X · Zbl 0935.94019 · doi:10.1142/S021812749800098X
[12] Lagendijk, Watermarking digital image and video data: A state-of-the-art overview, IEEE Signal Process. Mag. 17 pp 20– (2000) · doi:10.1109/79.879337
[13] DOI: 10.1016/j.patrec.2004.08.017 · doi:10.1016/j.patrec.2004.08.017
[14] DOI: 10.1016/j.asoc.2011.10.003 · doi:10.1016/j.asoc.2011.10.003
[15] DOI: 10.1016/S0378-4371(01)00090-5 · Zbl 0978.37026 · doi:10.1016/S0378-4371(01)00090-5
[16] Pareek, Image encryption using chaotic logistic map, Image Vision Computing. 24 pp 926– (2006) · doi:10.1016/j.imavis.2006.02.021
[17] DOI: 10.1016/j.entcs.2010.07.016 · Zbl 1247.92036 · doi:10.1016/j.entcs.2010.07.016
[18] DOI: 10.1016/j.mejo.2008.06.042 · doi:10.1016/j.mejo.2008.06.042
[19] Jie Dai, A result regarding convergence of random logistic maps, Statistics Probability Lett. 40 pp 11– (2000) · Zbl 0984.60034
[20] Savely, An explicit solution for the logistic map, Phys. A: Stat. Mech. Its Appl. 264 pp 222– (1999) · doi:10.1016/S0378-4371(98)00439-7
[21] DOI: 10.1016/S0378-4371(01)00088-7 · Zbl 0978.37056 · doi:10.1016/S0378-4371(01)00088-7
[22] Zhao, A chaos-based robust wavelet-domain watermarking algorithm, Chaos, Solitons Fractals. 22 pp 47– (2004) · Zbl 1060.93522 · doi:10.1016/j.chaos.2003.12.104
[23] Zhao, A novel wavelet image watermarking scheme combined with chaos sequence and neural network, Lecture Note Comput. Sci. 3174 pp 663– (2004) · doi:10.1007/978-3-540-28648-6_106
[25] DOI: 10.1016/j.asoc.2007.03.011 · Zbl 05391596 · doi:10.1016/j.asoc.2007.03.011
[26] DOI: 10.1016/j.aeue.2011.01.016 · doi:10.1016/j.aeue.2011.01.016
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.