Image Content Protection Research Articles

DRPChain: A new blockchain-based trusted DRM scheme for image content protection

The unauthorized replication and distribution of digital images pose significant challenges to copyright protection. While existing solutions incorporate blockchain-based techniques such as perceptual hashing and digital watermarking, they lack large-scale experimental validation and a dedicated blockchain consensus protocol for image copyright management. This paper introduces DRPChain, a novel digital image copyright management system that addresses these issues. DRPChain employs an efficient cropping-resistant robust image hashing algorithm to defend against 14 common image attacks, demonstrating an 85% success rate in watermark extraction, 10% higher than the original scheme. Moreover, the paper designs the K-Raft consensus algorithm tailored for image copyright protection. Comparative experiments with Raft and benchmarking against PoW and PBFT algorithms show that K-Raft reduces block error rates by 2%, improves efficiency by 300ms compared to Raft, and exhibits superior efficiency,decentralization, and throughput compared to PoW and PBFT. These advantages make K-Raft more suitable for digital image copyright protection. This research contributes valuable insights into using blockchain technology for digital copyright protection, providing a solid foundation for future exploration.

DETECTING THE SECURITY LEVEL OF VARIOUS CRYPTOSYSTEMS USING MACHINE LEARNING MODELS

In contemporary data management, cloud storage is widely adopted, yet it remains susceptible to security vulnerabilities. Utilizing cryptography techniques is essential for enhancing data security in such environments. One promising approach is hybrid cryptography, which combines multiple algorithms to bolster protection. Our proposed solution integrates RDH with DES algorithms, leveraging their respective strengths to fortify data security before it's stored in the cloud. Extensive testing has validated the efficacy of this approach. Specifically, we introduce an RDH with DES block-based transformation algorithm tailored for image content protection. Notably, our framework enables direct image retrieval and convolution on the content-protected images, enhancing usability alongside security. Keywords: deployment models, Infrastructure as a service, cryptosystems, machine learning

Advances in medical image watermarking: a state of the art review.

Watermarking has been considered to be a potent and persuasive gizmo for its application in healthcare setups that work online, especially in the current COVID-19 scenario. The security and protection of medical image data from various manipulations that take place over the internet is a topic of concern that needs to be addressed. A detailed review of security and privacy protection using watermarking has been presented in this paper. Watermarking of medical images helps in the protection of image content, authentication of Electronic Patient Record (EPR), and integrity verification. At first, we discuss the various prerequisites of medical image watermarking systems, followed by the classification of Medical Image Watermarking Techniques (MIWT) that include state-of-the-art. We have classified MIWT's into four broader classes for providing better understanding of medical image watermarking. The existing schemes have been presented along with their cons so that the reader may be able to grasp the shortcomings of the technique in order to develop novel techniques proving the inevitability of the presented review. Further, various evaluation parameters along with potential challenges pertaining to medical image watermarking systems have been discussed to provide a deep insight into this research area.

Reversible data hiding in encrypted image with local-correlation-based classification and adaptive encoding strategy

In recent years, reversible data hiding in encrypted images has attracted more and more attention due to its wide application in secret information transmission and image content protection. In this paper, we propose a reversible data hiding scheme for encrypted image based on classification and multi-layer processing. The image owner utilizes a block-level encryption method, including block-level bitwise exclusive-or operation and block permutation, to obtain encrypted image such that the correlation of pixels in most blocks is preserved. Therefore, there provably exist identical consecutive high-order bit planes (ICHOBPs) from the most significant bit (MSB) where the number of ICHOBPs is defined as local correlation. Further, a local-correlation-based classification mechanism is proposed such that these blocks can be classified into different types. The data hider adopts multi-layer processing to fully exploit the local correlation in each block. First, ICHOBPs of each block are utilized as redundant space for data embedding. For those blocks with a small number of ICHOBPs, an adaptive coding strategy is proposed to improve embedding capacity. Especially for those blocks whose correlation is not well preserved, we propose a special processing method to exploit redundant space. Experimental results show that our method can effectively improve the embedding capacity than other similar ones with keeping high quality in security analysis.

Protection of computers from side electromagnetic radiation during monitor images formation

Reliable protection of confidential data processedin critical information infrastructure elements of public institutions and private organizations is topical task today. Of particular interest are methods to prevent the leakage of confidential data by localizinginformative (dangerous) signals that both carry an informative component,and have a signal level higher than predefined threshold.The increase in signal energy from personal computers is caused byincreasing of its transistorsswitching speed. Modern passive shielding methodsfor secured computers, similar to the well-known program TEMPEST,require either costly and large shieldingunitsor technological simplificationby using of low-cost fragmentary shieldingof computer’s individual elements.Therefore, localization of side electromagnetic radiation produced by personal computer is needed.The paper presents a cost-effective approach to reducing the level of computer’s electromagnetic radiationby passive method.The radiation are localized and measured by its estimation on personal computer’s elements, namely unshielded communication lines between video processor and amonitor, fragments of electric tracks on motherboards, etc.During experiments authorsused ad-hoc miniature electric (ball antenna) and magnetic (Hall sensor) antennas connectedto selective voltmeters. This approach significantly reduces the cost of equipmentand measurementsas well as requirements to analytics’ qualification forimproving computer’s protection.Also, the alternative approach for computer protection is proposed. The approach is based on image content protection by distorting the image on the monitorinstead of reducing electromagnetic radiation caused by signals from the monitor. The protection includes image scrambling using Arnold transform that randomly “shuffle”the lines in each frame.

Reversible data hiding in encrypted images with block-based adaptive MSB encoding

Contemporary cloud storage and social media networks have matured and; as a result, the privacy protection of image content in these applications have attracted more attention. Reversible data hiding in encrypted images (RDHEI) is an efficient technique to embed additional data such as timestamps, watermarks, and copyright information into encrypted images to protect the image content. This paper proposes a reversible data hiding scheme in encrypted images based on a block-based adaptive MSB encoding technique (BAME-RDHEI). The content owner first uses a block-based image encryption method, including block permutation, pixel permutation in each block, and the block-based bitwise exclusive-or operation, to encrypt an image. This specific image encryption method preserves the relevance of the MSB bit planes in each block, and the block-based adaptive MSB encoding technique can be applied to classify and encode eight block types according to the number of MSB bit planes where all the values are all ‘1’ or ‘0’. After embedding the indicators that are generated by Huffman coding into the first MSB bit plane of each block, the remaining values of these MSB bit planes can be vacated for data embedding. The receiver can extract additional data, decrypted the image or recover the original image according to the different keys. The experimental results demonstrate that our proposed scheme provides enhanced security, significantly improves the embedding rate, and obtains higher visual quality for the decrypted image compared to other state-of-the-art schemes.

Cryptographic Algorithm Using Newton-Raphson Method and General Bischi-Naimzadah Duopoly System.

Image encryption is an excellent method for the protection of image content. Most authors used the permutation-substitution model to encrypt/decrypt the image. Chaos-based image encryption methods are used in this model to shuffle the rows/columns and change the pixel values. In parallel, authors proposed permutation using non-chaotic methods and have displayed good results in comparison to chaos-based methods. In the current article, a new image encryption algorithm is designed using combination of Newton-Raphson’s method (non-chaotic) and general Bischi-Naimzadah duopoly system as a hyperchaotic two-dimensional map. The plain image is first shuffled by using Newton-Raphson’s method. Next, a secret matrix with the same size of the plain image is created using general Bischi-Naimzadah duopoly system. Finally, the XOR between the secret matrix and the shuffled image is calculated and then the cipher image is obtained. Several security experiments are executed to measure the efficiency of the proposed algorithm, such as key space analysis, correlation coefficients analysis, histogram analysis, entropy analysis, differential attacks analysis, key sensitivity analysis, robustness analysis, chosen plaintext attack analysis, computational analysis, and NIST statistical Tests. Compared to many recent algorithms, the proposed algorithm has good security efficiency.

Quantum image encryption algorithm based on bit-plane permutation and sine logistic map

Quantum cryptography improves efficiency and security of image content protection owing to the characteristics of qubits. In this paper, a novel quantum image encryption algorithm based on bit-plane permutation and sine logistic map is presented. The image to be encrypted is firstly represented with novel enhanced quantum representation model and then the quantum Arnold transform is used to scramble pixel positions. The bit-plane cross-exclusive OR and shift operations are designed to change the pixel values. The final ciphertext image is obtained through a diffusion process utilizing sine logistic map, which extremely enlarges key space. The quantum circuits of each procedure are given. Simulation results and theoretical analysis verify that the proposed quantum image scheme has good performance in the aspect of security and the computational complexity is superior to its classical counterpart.

Effective Revisable Data Hiding in Encrypted Image for Protection of Image Content

In this article, we propose a reversible method for hiding data, in which the original image and hidden data can be restored on the receiving side. The owner encrypts the original image using an encryption key to protect the privacy of the image content. Each block of encrypted image is added to the little secret by Hider data using the key data hiding. Data hiding process causes only a small change in each partial pixel flip block, which improves decoded image visual quality. The image can be easily decoded receiver using the key, data encryption key to hide the adaptive soft characteristic of the evaluation function along the direction of the isophote, the secret data can be extracted from a decoded image and original image recovery can be restored more successfully.

Image Encryption with Double Spiral Scans and Chaotic Maps

Image encryption is a useful technique of image content protection. In this paper, we propose a novel image encryption algorithm by jointly exploiting random overlapping block partition, double spiral scans, Henon chaotic map, and Lü chaotic map. Specifically, the input image is first divided into overlapping blocks and pixels of every block are scrambled via double spiral scans. During spiral scans, the start-point is randomly selected under the control of Henon chaotic map. Next, image content based secret keys are generated and used to control the Lü chaotic map for calculating a secret matrix with the same size of input image. Finally, the encrypted image is obtained by calculating XOR operation between the corresponding elements of the scrambled image and the secret matrix. Experimental result shows that the proposed algorithm has good encrypted results and outperforms some popular encryption algorithms.

Multiple-image encryption with bit-plane decomposition and chaotic maps

Image encryption is an efficient technique of image content protection. In this work, we propose a useful image encryption algorithm for multiple grayscale images. The proposed algorithm decomposes input images into bit-planes, randomly swaps bit-blocks among different bit-planes, and conducts XOR operation between the scrambled images and secret matrix controlled by chaotic map. Finally, an encrypted PNG image is obtained by viewing four scrambled grayscale images as its red, green, blue and alpha components. Many simulations are done to illustrate efficiency of our algorithm.

Encryption domain content-based image retrieval and convolution through a block-based transformation algorithm

In this paper, we propose a block-based transformation algorithm to achieve the purpose of image content protection. More importantly, under the proposed image content protection framework, image r...

Efficient image encryption with block shuffling and chaotic map

Image encryption is a useful technique for many applications, such as image content protection, image authentication, pay-TV and data hiding. In this paper, we propose an efficient image encryption algorithm with block shuffling and chaotic map. The proposed algorithm divides an input image into overlapping blocks, shuffles image blocks to make initial encryption, exploits a chaotic map and Arnold transform to generate secret matrices, and achieves final encryption by conducting exclusive OR operations between corresponding elements of each block and a random secret matrix. Many experiments are done to validate efficiency and advantages of the proposed algorithm.

Fragile and resistant image watermarking based on inverse difference pyramid decomposition

In the paper is presented one approach for image content protection based on layered still image decomposition with Inverse Difference Pyramid (IDP) and digital watermark insertion. Unlike the famo...

Digital image source coder forensics via intrinsic fingerprints

Recent development in multimedia processing and network technologies has facilitated the distribution and sharing of multimedia through networks, and increased the security demands of multimedia contents. Traditional image content protection schemes use extrinsic approaches, such as watermarking or fingerprinting. However, under many circumstances, extrinsic content protection is not possible. Therefore, there is great interest in developing forensic tools via intrinsic fingerprints to solve these problems. Source coding is a common step of natural image acquisition, so in this paper, we focus on the fundamental research on digital image source coder forensics via intrinsic fingerprints. First, we investigate the unique intrinsic fingerprint of many popular image source encoders, including transform-based coding (both discrete cosine transform and discrete wavelet transform based), subband coding, differential image coding, and also block processing as the traces of evidence. Based on the intrinsic fingerprint of image source encoders, we construct an image source coding forensic detector that identifies which source encoder is applied, what the coding parameters are along with confidence measures of the result. Our simulation results show that the proposed system provides trustworthy performance: for most test cases, the probability of detecting the correct source encoder is over 90%.

Efficient archiving of documents with protection of their authentic content

A new approach for efficient archiving and content protection of scanned documents, comprising texts and pictures, is presented in this paper. The offered approach presumes to compress the pictures and the texts in different way: the pictures – with lossy coding based on decomposition, called inverse difference pyramid (IDP), and the parts, containing text (graphics) – with lossless coding. For the reliable image content protection is offered new method for digital watermarking based on the IDP decomposition, which permits the insertion of multi-layer watermarks.