Ta Minh Thanh

Incomplete Cryptography Method Using Invariant Huffman Code Length to Digital Rights Management

This paper describes the basic idea of a novel Digital Rights Management(DRM) method which is composed of an incomplete cryptography using invariant huffman code length feature and the user identification mechanism to control the quality of the digital contents. We adopt the huffman code length feature of the DCT coefficient in the JPEG codec to the implement incomplete cryptography. The encoding process and the decoding process are presented by randomly selected the coefficients that belong to same category in the huffman table. In the our scheme, the copyright information is embedded into the decoded content while decoding process, and the size of digital contents are invariance during process. Experimental results with simulation confirmed that the modified codes keep compatibility with standard JPEG format, and revealed the proposed method is suitable for DRM in the network distribution system.

Fundamental Incomplete Cryptography Method to Digital Rights Management Based on JPEG Lossy Compression

Generally, DRM(Digital Rights Management) system is achieved with individual function modules of cryptography, watermarking and so on. In this typical system flow, all digital contents are temporarily disclosed with perfect condition via decryption process. This paper describes the fundamental idea of a novel DRM method which is composed of an incomplete cryptography and user identification mechanism to control the quality of digital contents. Our proposed prototype JPEG codec based on a simple incomplete cryptography can easily control the open level of contents, besides at decoding process, an identification code embedded with an authorized key is used to prevent unauthorized duplication or business of digital contents. Experimental results with simulation confirmed that the modified codes keep compatibility with standard JPEG format, and revealed that the proposed method is suitable for DRM in the network distribution system.

A proposal of digital rights management based on incomplete cryptography using invariant Huffman code length feature

Digital rights management (DRM) system is a promising technique to allow copyrighted content to be commercialized in digital format without the risk of revenue loss due to piracy. However, traditional DRMs are achieved with individual function modules of cryptography and watermarking. Therefore, all digital contents are temporarily disclosed in perfect condition via decryption process in the user-side risking illegal redistribution. This paper describes the basic idea of a novel DRM method composed of an incomplete cryptography using invariant Huffman code length feature and the user identification mechanism to control the quality of digital contents. The proposed incomplete cryptography consists of two processes: the incomplete encoding and the incomplete decoding. These processes are presented by randomly selecting the coefficients that belong to the same category or different category of Huffman code. In our scheme, the copyright information is embedded into the decoded content during the decoding process, and the size of digital contents are invariant during the process. Experimental results with simulation confirmed that the modified codes are compatible with standard JPEG format, and revealed the proposed method to be suitable for DRM in the network distribution system.

The novel and robust watermarking method based on q-logarithm frequency domain

In general, watermarking techniques on transform domain are always mainly researched in literature since it is robust against several attacks. In this paper, we continue to focus on the transform domain and extend it to the novel frequency domain, called q-logarithm frequency domain (q-LFD), for robust watermarking. In order to achieve the robustness of embedding method, we embed the scrambled watermark information into the low-band frequency of q-LFD by using the quantization index modulation (QIM) technique. According to the simulation results, our method can improve the quality of embedded image and also the robustness of watermark based on the optimized parameters: q of q-LFD and Q of QIM. Experimental results show that our proposed method is also robust against geometric attacks, processing attacks, filtering attacks, and so on.

Comparison of Watermarking Schemes Using Linear and Nonlinear Feature Matching

Recently, the feature point matching based water-marking techniques have been paying attention for resisting the geometric attacks. We present a performance analysis of robust watermarking using linear and nonlinear feature. In particular, we consider the geometric attacks and the signal processing attacks for image watermarking. In order to analyze the efficiency of linear and nonlinear feature, we employ the linear and the nonlinear feature matching technique in the image watermarking. The extracted feature points can survive against several attacks, therefore, those can be used as reference points for restoration before the extraction of the watermark information. For blindness and robustness, we embed the watermark into the low-band of the discrete cosine transform (DCT) domain. Experimental results show that our performance analysis of watermarking methods using linear and nonlinear feature matching against the geometric attacks and the signal processing attacks. These include the JPEG compression, the filtering attacks, and so on.

Blind Watermarking using QIM and the Quantized SVD Domain based on the q-Logarithm Function

We propose new image blind watermarking by using both the quantization index modulation (QIM) technique and the quantized singular value decomposition (SVD) domain based on the q-logarithm function. In order to reduce the distortion of the embedded image, we employ the q-logarithm transform on the Y component of the original image after performing the SVD domain. We call this domain the q-SVD domain. In our proposed method, the tradeoff of robustness and quality can be controlled by a predefined quantization coefficient Q of QIM and a parameter q of the q-SVD domain. Several experiments are conducted to show the robustness of our proposed method against processing attacks and geometric attacks.

An Incomplete Cryptography based Digital Rights Management with DCFF.

In general, DRM (Digital Rights Management) system is responsible for the safe distribution of digital content, however, DRM system is achieved with individual function modules of cryptography, watermarking and so on. In this typical system flow, it has a problem that all original digital contents are temporarily disclosed with perfect condition via decryption process. In this paper, we propose the combination of the differential codes and fragile fingerprinting (DCFF) method based on incomplete cryptography that holds promise for a better compromise between practicality and security for emerging digital rights management applications. Experimental results with simulation confirmed that DCFF keeps compatibility with standard JPEG codec, and revealed that the proposed method is suitable for DRM in the network distribution system.

Frame-patch matching based robust video watermarking using KAZE feature

A frame-patch matching based robust video watermarking using KAZE feature is proposed in this paper. We employed the KAZE feature for matching the feature points of frame-patch with those of all frames in video. In our method, the watermark information is embedded in Discrete Cosine Transform (DCT) domain of randomly generated blocks in the matched region. In the extraction process, we synchronized the embedded region from the distorted video by using KAZE feature matching. RST (rotation, scaling, translation) parameters are estimated and the watermark information can be extracted. Experimental results showed that our proposed method is very robust against geometrical attacks, video processing attacks, temporal attacks, and so on.

Nonspecific DCT-block fingerprinting based on incomplete cryptography for DRM system

In the present digital world, Digital Rights Management (DRM) is essential to enforce persistent data protection right from the moment it is published. In spite of a need for DRM there are significant weaknesses in the current technology. Generally, DRM system is achieved with individual function modules of cryptography, fingerprinting and so on. In this typical system flow, all digital contents are temporarily disclosed with perfect condition via decryption process. This paper describes the elemental idea of a DRM method which is composed of an incomplete cryptography based on nonspecific DCT-block (Discrete Cosine Transform) and user fingerprinting mechanism to control the quality of digital contents. There are two fundamental steps in our proposed cryptography: incomplete encoding and incomplete decoding. These two steps will create the scrambled content using as trial content and fingerprinted content is used to prevent unauthorized duplication or business of digital contents, respectively. Experimental results on standard JPEG (Joint Photographic Experts Group) format show that the proposed method is suitable for DRM in the network distribution system.

An image zero-watermarking algorithm based on the encryption of visual map feature with watermark information

We propose a new image zero-watermarking scheme based on the encryption of visual map feature (VMF) and permuted visual map feature (PVMF) of the original image with watermark information. To resist strong attacks, we employ the robust feature extracted from the host image by using the combination of QR decomposition and 1D-DCT. Since the feature extracted from the host image presents the coarse part of the host image, we call it VMF. For enhancing the security of VMF, we apply the permutation method on VMF based on the Torus permutation to obtain PVMF. We construct a new method of image zero-watermarking by the encryption of VMF and PVMF with copyright data, and then generate the master share and the ownership share. The master share is generated by comparison of two consecutive DC coefficients after the QR decomposition is applied. The ownership share is generated by encryption of the master share with copyright data. Experimental results show that the proposed method is robust against common processing and geometric attacks with low consuming time.