scholarly journals A Novel Invariant Based Commutative Encryption and Watermarking Algorithm for Vector Maps

2021 ◽  
Vol 10 (11) ◽  
pp. 718
Author(s):  
Yu Li ◽  
Liming Zhang ◽  
Xiaolong Wang ◽  
Xingang Zhang ◽  
Qihang Zhang
Keyword(s):  
Encryption Scheme ◽  
Chaotic Encryption ◽  
Watermark Image ◽  
Distribution Method ◽  
Data Format ◽  
Geometric Attacks ◽  
Vector Maps ◽  
Random Position ◽  
Watermarking Scheme ◽  
Secure Transmission

Commutative encryption and watermarking (CEW) is an emerging method that combines encryption technology with digital watermarking technology. It has the dual capability of secure transmission and copyright protection. However, the existing CEW methods for vector maps have good robustness in resisting geometric attacks but poor resistance to vertex attacks (e.g., addition, deletion, etc.). To solve this problem, here we propose a novel invariant-based CEW algorithm for vector maps, which consists of permutation-based encryption scheme and coordinates-based watermarking scheme. In the encryption scheme, the encryption key is generated via the Gaussian distribution method combined with the SHA-512 hash method; then, the double random position permutation strategy is applied to the vector map encryption. In watermarking embedding scheme, the original watermark image is scrambled via logistic chaotic encryption before embedding, and the coordinates of all the vertices are normalized. Then, the scrambled watermark image is embedded into the normalized coordinates. Results show that: proposed method is more robust to conventional attacks (e.g., vertex addition and deletion, reordering and data format conversion) and geometric attacks (e.g., scaling and translation). In addition, compared with the existing CEW methods for vector maps, the proposed method has higher security and stronger robustness against vertex attacks.

scholarly journals Realization of a New Robust and Secure Watermarking Technique Using DC Coefficient Modification in Pixel Domain and Chaotic Encryption

Cryptography ◽  
2020 ◽  
pp. 1-21
Author(s):  
Shabir A. Parah ◽  
Javaid A. Sheikh ◽  
Nilanjan Dey ◽  
G.M. Bhat
Keyword(s):  
Image Watermarking ◽  
Spatial Domain ◽  
Experimental Investigations ◽  
Chaotic Encryption ◽  
Computationally Efficient ◽  
Image Block ◽  
Geometric Attacks ◽  
Information And Communication ◽  
Dc Coefficient ◽  
Watermarking Scheme

The proliferation of information and communication technology has made exchange of information easier than ever. Security, Duplication and manipulation of information in such a scenario has become a major challenge to the research community round the globe. Digital watermarking has been found to be a potent tool to deal with such issues. A secure and robust image watermarking scheme based on DC coefficient modification in pixel domain and chaotic encryption has been presented in this paper. The cover image has been divided into 8×8 sub-blocks and instead of computing DC coefficient using Discrete Cosine Transform (DCTI, the authors compute DC coefficient of each block in spatial domain. Watermark bits are embedded by modifying DC coefficients of various blocks in spatial domain. The quantum of change to be brought in various pixels of a block for embedding watermark bit depends upon DC coefficient of respective blocks, nature of watermark bit (0 or 1) to be embedded and the adjustment factor. The security of embedded watermark has been taken care of by using chaotic encryption. Experimental investigations show that besides being highly secure the proposed technique is robust to both signal processing and geometric attacks. Further, the proposed scheme is computationally efficient as DC coefficient which holds the watermark information has been computed in pixel domain instead of using DCT on an image block.

Realization of a New Robust and Secure Watermarking Technique Using DC Coefficient Modification in Pixel Domain and Chaotic Encryption

2017 ◽  
Vol 25 (4) ◽  
pp. 80-102 ◽  
Author(s):  
Shabir A. Parah ◽  
Javaid A. Sheikh ◽  
Nilanjan Dey ◽  
G.M. Bhat
Keyword(s):  
Image Watermarking ◽  
Spatial Domain ◽  
Experimental Investigations ◽  
Chaotic Encryption ◽  
Computationally Efficient ◽  
Image Block ◽  
Geometric Attacks ◽  
Information And Communication ◽  
Dc Coefficient ◽  
Watermarking Scheme

The proliferation of information and communication technology has made exchange of information easier than ever. Security, Duplication and manipulation of information in such a scenario has become a major challenge to the research community round the globe. Digital watermarking has been found to be a potent tool to deal with such issues. A secure and robust image watermarking scheme based on DC coefficient modification in pixel domain and chaotic encryption has been presented in this paper. The cover image has been divided into 8×8 sub-blocks and instead of computing DC coefficient using Discrete Cosine Transform (DCTI, the authors compute DC coefficient of each block in spatial domain. Watermark bits are embedded by modifying DC coefficients of various blocks in spatial domain. The quantum of change to be brought in various pixels of a block for embedding watermark bit depends upon DC coefficient of respective blocks, nature of watermark bit (0 or 1) to be embedded and the adjustment factor. The security of embedded watermark has been taken care of by using chaotic encryption. Experimental investigations show that besides being highly secure the proposed technique is robust to both signal processing and geometric attacks. Further, the proposed scheme is computationally efficient as DC coefficient which holds the watermark information has been computed in pixel domain instead of using DCT on an image block.

scholarly journals Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

2019 ◽  
Vol 9 (4) ◽  
pp. 642 ◽  
Author(s):  
Xu Xi ◽  
Xinchang Zhang ◽  
Weidong Liang ◽  
Qinchuan Xin ◽  
Pengcheng Zhang
Keyword(s):  
Singular Value Decomposition ◽  
Singular Value ◽  
Two Dimensional ◽  
Triangle Mesh ◽  
Vector Map ◽  
Vector Maps ◽  
Feature Sequence ◽  
Zero Watermarking ◽  
Value Decomposition ◽  
Watermarking Scheme

Digital watermarking is important for the copyright protection of electronic data, but embedding watermarks into vector maps could easily lead to changes in map precision. Zero-watermarking, a method that does not embed watermarks into maps, could avoid altering vector maps but often lack of robustness. This study proposes a dual zero-watermarking scheme that improves watermark robustness for two-dimensional (2D) vector maps. The proposed scheme first extracts the feature vertices and non-feature vertices of the vector map with the Douglas-Peucker algorithm and subsequently constructs the Delaunay Triangulation Mesh (DTM) to form a topological feature sequence of feature vertices as well as the Singular Value Decomposition (SVD) matrix to form intrinsic feature sequence of non-feature vertices. Next, zero-watermarks are obtained by executing exclusive disjunction (XOR) with the encrypted watermark image under the Arnold scramble algorithm. The experimental results show that the scheme that synthesizes both the feature and non-feature information improves the watermark capacity. Making use of complementary information between feature and non-feature vertices considerably improves the overall robustness of the watermarking scheme. The proposed dual zero-watermarking scheme combines the advantages of individual watermarking schemes and is robust against such attacks as geometric attacks, vertex attacks and object attacks.

Quantum color image watermarking based on fast bit-plane scramble and dual embedded

2018 ◽  
Vol 16 (07) ◽  
pp. 1850060 ◽  
Author(s):  
Ri-Gui Zhou ◽  
Peng Liu Yang ◽  
Xing Ao Liu ◽  
Hou Ian
Keyword(s):  
Nearest Neighbor ◽  
Color Image ◽  
Interpolation Method ◽  
Image Watermarking ◽  
Extraction Process ◽  
Watermark Image ◽  
Color Image Watermarking ◽  
Encryption Algorithms ◽  
Bit Plane ◽  
Watermarking Scheme

Most of the studied quantum encryption algorithms are based on square images. In this paper, based on the improved novel quantum representation of color digital images model (INCQI), a quantum color image watermarking scheme is proposed. First, INCQI improved from NCQI is used to represent the carrier and watermark images with the size [Formula: see text] and [Formula: see text], respectively. Secondly, before embedding, the watermarking needs to be preprocessed. That is, the watermark image with the size of [Formula: see text] with 24-qubits color information is disordered by the fast bit-plane scramble algorithm, and then further expanded to an image with the size [Formula: see text] with 6-qubits pixel information by the nearest-neighbor interpolation method. Finally, the dual embedded algorithm is executed and a key image with 3-qubits information is generated for retrieving the original watermark image. The extraction process of the watermark image is the inverse process of its embedding, including inverse embedding, inverse expand and inverse scrambling operations. To show that our method has a better performance in visual quality and histogram graph, a simulation of different carrier and watermark images are conducted on the classical computer’s MATLAB.

Commutative Watermarking-Encryption of Multimedia Data Based on Histograms

2019 ◽  
pp. 141-163
Author(s):  
Roland Schmitz ◽  
Shujun Li ◽  
Christos Grecos ◽  
Xinpeng Zhang
Keyword(s):  
Image Data ◽  
Multimedia Data ◽  
Encryption Scheme ◽  
Calibration Point ◽  
Still Image ◽  
Audio Data ◽  
The Mean ◽  
Histogram Bins ◽  
Watermarking Scheme ◽  
Desynchronization Attacks

Histogram-based watermarking schemes are invariant to pixel permutations and can thus be combined with permutation-based ciphers to form a commutative watermarking-encryption scheme. In this chapter, the authors demonstrate the feasibility of this approach for audio data and still image data. Typical histogram-based watermarking schemes based on comparison of histogram bins are prone to desynchronization attacks, where the whole histogram is shifted by a certain amount. These kind of attacks can be avoided 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 histogram-based schemes, especially commutativity of watermarking and permutation-based encryption, are preserved. The authors also report on the results of testing robustness of the still image watermark against JPEG and JPEG2000 compression and on the possibility of using histogram-based watermarks for authenticating the content of an image.

3D Chaotic Encryption Scheme for Compressed Image

2010 ◽  
Vol 30 (2) ◽  
pp. 399-404
Author(s):  
李娟 Li Juan ◽  
冯勇 Feng Yong ◽  
杨旭强 Yang Xuqiang
Keyword(s):  
Encryption Scheme ◽  
Chaotic Encryption
Sign in / Sign up

Export Citation Format

Share Document