A Novel Video Copyright Protection Scheme Based on Blockchain and Double Watermarking

With the continuous development of multimedia, more and more digital works such as videos are spread, stored, and used in the network. In recent years, digital copyright infringement disputes have occurred frequently. The traditional copyright protection system has some problems, such as difficulty confirming copyright, monitoring infringement, and obtaining evidence for rights protection. To this end, we have designed and implemented a novel video copyright protection scheme based on the blockchain and double watermarking technology. We use the image correlation coefficient method to extract video keyframes. And we combine with Contourlet Transform domain, QR decomposition, and SIFT algorithm to improve the robustness of watermark against geometric attacks on the premise of invisibility. After that, we use Arnold Transformation (Cat Map) based on the Maximum Entropy Threshold Segmentation to encrypt the robust watermark and strengthen the security. Moreover, based on the characteristics of the fragile watermarking, we accurately locate the attacked video’s tamper position and complete the integrity authentication of the watermarked video. In addition, the hash digest of the video watermark and the user ID of the copyright owner is signed by SM2 and uploaded to the blockchain. The user can register the copyright after passing the identity authentication. We conduct tests and security analysis on the blockchain performance of the system, the performance of the commercial cryptography algorithm, and the security of the watermarking system. The experimental results show that the blockchain used in this system conforms to the industry standard, the performance of SM2 and SM3 is better than ECC-256 and SHA-256, and the system security is well guaranteed.

A new color image encryption technique using DNA computing and Chaos-based substitution box

In many cases, images contain sensitive information and patterns that require secure processing to avoid risk. It can be accessed by unauthorized users who can illegally exploit them to threaten the safety of people’s life and property. Protecting the privacies of the images has quickly become one of the biggest obstacles that prevent further exploration of image data. In this paper, we propose a novel privacy-preserving scheme to protect sensitive information within images. The proposed approach combines deoxyribonucleic acid (DNA) sequencing code, Arnold transformation (AT), and a chaotic dynamical system to construct an initial S-box. Various tests have been conducted to validate the randomness of this newly constructed S-box. These tests include National Institute of Standards and Technology (NIST) analysis, histogram analysis (HA), nonlinearity analysis (NL), strict avalanche criterion (SAC), bit independence criterion (BIC), bit independence criterion strict avalanche criterion (BIC-SAC), bit independence criterion nonlinearity (BIC-NL), equiprobable input/output XOR distribution, and linear approximation probability (LP). The proposed scheme possesses higher security wit NL = 103.75, SAC ≈ 0.5 and LP = 0.1560. Other tests such as BIC-SAC and BIC-NL calculated values are 0.4960 and 112.35, respectively. The results show that the proposed scheme has a strong ability to resist many attacks. Furthermore, the achieved results are compared to existing state-of-the-art methods. The comparison results further demonstrate the effectiveness of the proposed algorithm.

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

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.

Sharing symmetries in non-linear systems: Generalized Heisenberg–Weyl algebra on the de Sitter space-time out of the sphere S3

In this paper, we exploit the formal equivalence of the Solution Manifold of two distinct physical systems to create enough symmetries so as to characterize them by Noether Invariants, thus favoring their future quantization. In so doing, we somehow generalize the Arnold Transformation for non-necessarily linear systems. Very particularly, this algorithm applies to the case of the motion on the de Sitter space-time providing a finite-dimensional algebra generalizing the Heisenberg–Weyl algebra globally. In this case, the basic (contact) symmetry is imported from the motion of a (non-relativistic) particle on the sphere [Formula: see text].

3-Image Bit-Level Encryption Algorithm Based on 3D Nonequilateral Arnold Transformation and Hyperchaotic System

In this paper, we propose a novel 3-image bit-level encryption algorithm based on 3D nonequilateral Arnold transformation and hyperchaotic system. Firstly, the three plain images with N × M are decomposed into 8-bit planes and then they overlap into a 3D bit matrix with size N × M × 24 . Then, the 3D bit matrix is scrambled by 3D nonequilateral Arnold transformation and the scrambled 3D bit matrix is integrated and transformed into three 2D pixel-level images. Finally, the hyperchaotic system is used to diffuse the three 2D pixel-level images; then three diffused images are rearranged to be one color image, resulting in the encrypted image. Numerical simulations and analyses of the proposed encryption scheme are given to validate the feasibility and safety of the method. The statistical analyses like histogram, correlation, and entropy confirm that the proposed method can effectively resist statistical attacks and security key analysis shows that the key space is large enough to render the brute-force attack ineffective in proposed method. The differential analysis confirms that the proposed method is effective against differential attacks and the results of the experiment confirmed that the method can resist occlusion attack.

Reversible Data Hiding on Image Encryption with Index Boundary for Partial Confidential Documents

An efficient data hiding method is proposed in the smart cyber-attacks such as data theft, virus attacks on the transmitting of whole confidential data, partial confidential data via private and government networks. The transmitting data over the internet is one of the better solutions to make a work easy and fast even though protecting data from the smart hackers is vital role in the cyber-crimes. There are various protection techniques of confidential data like digital watermarking, digital signals with embedding data into images, audio and videos. The existing watermarking techniques using RSA is a time consuming process for number of iterations to be performed even in signal decryption of image. These complexities of iterations to be overcome by the Least Significant Bits, DWT transformation and Arnold transformation were failing in all aspects of security requirements. The proposed method of reversible data hiding has an efficient encryption in medical images, health care image and data transmitting in various organizations.