Chittaranjan Pradhan

Non blind digital watermarking technique using DCT and Cross chaos map

Digital watermarking is the process of embedding secret information into a digital signal which may be used to verify its authenticity or the identity of its owners. In this paper, a non-blind digital image watermarking algorithm based on Discrete cosine transform, Cross chaotic map and Arnold transform has been described. Initially, Arnolds transformation is applied on the watermark signal. Then, Cross chaos sequence is applied on this encrypted watermark to encrypt further. Discrete cosine transformation is applied to the cover image to transform the signal from the spatial domain to the frequency domain, where the watermark signal is embedded. It is a kind of non-blind scheme as the extraction needs the original image. Peak signal to noise ratio (PSNR) is used to evaluate the algorithm. The quality of the extracted watermark is evaluated using term Normalized cross-correlation (NC). From the results, it may be concluded that our algorithm is resistant enough against the common attacks.

Secured selective encryption algorithm for MPEG-2 video

Rising popularity of internet technology has opened up many popular internet applications like Video on Demand, Internet TV, Video Conferencing, Telemedicine etc. But unwanted third party, the adversary can have access to the content if there is no security. Therefore, the security and privacy of the video content has become a challenging issue in the last decade. Many encryption algorithms have been proposed to meet the security requirements of the different applications. But, lack of application friendliness limits those algorithm form practical implementation. In this paper, we have proposed one selective video encryption algorithm to address the real-time security requirements. We propose one bits selection algorithm to select the higher intense bits to achieve higher visual degradation. In this paper, we have used AES encryption algorithm for encryption. This enhances the cryptographic security of the algorithm which will be well suited for real-time data transmission application.

Imperceptible Watermarking Technique using Arnold's Transform and Cross Chaos Map in DCT Domain

Digital watermarking is the process of embedding secret information into a digital signal which may be used to verify its authenticity or the identity of its owners. In this paper, we have taken image as the medium of watermarking. Here, we have discussed an imperceptible watermarking technique by using double encryptions in DCT domain. For the encryption process, Arnold’s transform and Cross chaos map are used. Like other algorithms, this one is also evaluated by Peak signal to noise ratio (PSNR). From the experimental results, it can be proved that this algorithm gives better PSNR value, which makes the algorithm to imperceptible. General Terms Security.

Non blind watermarking technique using enhanced one time pad in DWT domain

The unlimited growth in internet and multimedia leads to large usage of images resulting in huge storage and distribution of multimedia contents. With increasing use of digital transmission techniques the potential risks for multimedia content is high which lead to necessity of protection for authenticity and confidentiality. To protect the confidentiality, one time pad is supposed to be the most secure algorithm. This paper proposes a secure algorithm to protect the watermark image over a public network in digital watermarking and is embedded in Discrete Wavelet Transformation (DWT). The unique key same as size of watermark is generated from the cover image. One time pad is applied using generated unique key to encrypt the watermark image. The encrypted image so formed is embedded into cover image in DWT domain. The experimental results show the effectiveness and robustness of the algorithm using PSNR and NC calculations.

Robust watermarking technique using Arnold's transformation and RSA in discrete wavelets

Copyright protection is a major concern in digital data transmission over public channel. For copyright protection, watermarking technique is extensively used. A robust watermarking scheme using Arnolds transformation and RSA algorithm in the DWT domain has been proposed in our paper. The combined encryption has been taken to provide more security to the watermark before the embedding phase. The PSNR value shows the difference between original cover and embedded cover is minimal. Similarly, NC values show the robustness and resistance capability of the proposed technique from the common attacks such as JPEG compression, scaling etc. Thus, this combined version of Arnolds transformation and RSA algorithm can be used in case of higher security requirement of the watermark signal.

Blind digital watermarking algorithm based on DCT domain and fractal images

Multimedia distribution across public network and internet is growing fast. With diverse evolution in technology of distribution and storage, various factors are challenging multimedia and internet technologies. Digital watermarking solves the problems of several threats and protects the digital data from being compromised or altered. It also provides copyright protection to avoid illegal modification of digital data. In this paper we have proposed a blind digital watermarking algorithm based on fractal images on Discrete Cosine Transform (DCT) domain. The fractal code is converted to its respected binary images and used as a watermark image. The cover image is decomposed to its respective grayscale equivalents of RGB components. The fractal codes as watermark binary images are embedded into grayscale equivalent of RGB components of cover image. The embedding is done in mid frequency to secure the codes from several attacks. The robustness and imperceptibility of the algorithm is shown in results and analysis.

Comparative study of image encryption using 2D chaotic map

Securing digital image during transmission is very much important in the current era. For this purpose, cryptographic techniques as well as chaotic maps can be applicable. In this paper, we have given a detailed study of the image encryption using different 2D chaotic maps such as Arnold 2D cat map, Baker map, Henon map, Cross chaos map and 2D logistic map. The security analysis of these techniques has been done by the help of NPCR (Number of Pixels Change Rate) and UACI (Unified Average Changing Intensity) values. The experimental results of NPCR and UACI show the effectiveness of the encryption processes of different techniques.

Chaotic Variations of AES Algorithm

Advanced Encryption Standard (AES) algorithm is considered as a secured algorithm. Still, some security issues lie in the S-Box and the key used. In this paper, we have tried to give focus on the security of the key used. Here, the proposed modified algorithms for the AES have been simulated and tested with different chaotic variations such as 1-D logistic chaos equation, cross chaos equation as well as combination of both. For the evaluation purpose, the CPU time has been taken as the parameter. Though the variations of AES algorithms are taking some more time as compared to the standard AES algorithm, still the variations can be taken into consideration in case of more sensitive information. As we are giving more security to the key used for AES algorithm, our proposed algorithms are very much secured from unauthorized people.

Enhanced digital watermarking scheme using fractal images in wavelets

Digital communication is under risk due to different types of attacks on its confidentiality, integrity and authenticity. Copyright information need to be protected to preserve owners information over untrusted network. Innovation in technology is also bringing challenges to secure the originality of owner information. Digital watermarking comes as a solution to protect and secure the owners information through the means of different embedding technique to avoid security risks and threats. Our paper proposed a technique to embed fractal images in Discrete Wavelet Transform (DWT). The binary watermark image is generated from fractal codes. The color cover image is decomposed to its grayscale equivalents. The grayscale equivalents of color image are used to embed the watermark image which is generated from fractal codes in mid frequency blocks to protect the codes from attacker. Same watermark images are embedded into grayscale equivalents separately to increase the robustness and security of the scheme. The result analysis shows the robustness and imperceptibility of the algorithm.

Comparative analysis of color image encryption using 3D chaotic maps

Digital image encryption can be done either by using the cryptography techniques or chaotic maps. Here, we have given focus to the chaotic maps due to the simplicity as compared to the cryptography techniques. In this paper, we have presented the color image encryption using different 2D chaotic maps, such as 2D Logistic map, Henon map, Baker nap, Arnold cat map and Cross chaos map. The efficiency of these image encryption techniques is verified by the differential attack. NPCR (number of pixels change rate) and UACI (unified average changing intensity) have been chosen as the evaluation parameters.