Robust and Secure Watermarking for Propagation of Digital Multimedia by Paillier Homomorphic Cryptosystem With Arnold Transformation

Abstract

Sharing of digital media over internet is becoming easier due to content authentication and security provided by digital watermarking. It also locates application in other fields like copyright protection, tele-medicine, military, tamper detection, and many more. This paper represents the robust watermarking approach using Paillier homomorphic cryptosystem with Arnold transformation. In this, the watermarking system is primarily prepared at an encrypted DWT-DCT domain. Cryptosystem is exploited at this time to encrypt the original media. For more security of multimedia content, the watermark image is scrambled through Arnold scrambling technique. The embedding process is done here to produce the encrypted watermark image followed by the encryption process. At recovery phase, decryption of encrypted watermark image to get the original and watermark image is done. The experimental result has shown that watermarking method is more robust and offers the security of digital media.

A Novel and Fast Encryption System Based on Improved Josephus Scrambling and Chaotic Mapping

“…According to the characteristics of the scrambling method, the above algorithms can be divided into two categories: one is that the size of the original image remains unchanged [1,[4][5][6][7][8][9][10][11][12][13][14]19,23,28,29], and the other is that the plaintext image is decomposed into another size for scrambling [15][16][17][18][20][21][22][24][25][26][27].…”

“…In the first category, some researchers utilized the extended Arnold map to permute the plaintext image [6,9]. Specifically, the pixel coordinates are set as the initial values of the chaotic map and the new positions of the pixels are obtained by iterating the chaotic system.…”

“…For instance, in [8], the hash values of the plaintext image calculated by the SHA256 algorithm are used as the initial values of the non-coupled map lattice function. However, these schemes suffer from some drawbacks, such as the weak scrambling effect [6,9], a long permutation time [7], or a low application value because of its one-time-pad-like property [8,11,12,14,23]. For the characteristic of easy implementation, permutations based on index matrices which are derived from sorting and matching random sequences has been used in many encryption schemes [4,5,28,29].…”