Chaotic Map for Securing Digital Content

2018 ◽  
pp. 1151-1167
Author(s):  
Dhiraj Pandey ◽  
U. S. Rawat
Keyword(s):  
Secret Sharing ◽  
Chaotic Map ◽  
Logistic Map ◽  
Visual Cryptography ◽  
Visual Quality ◽  
Digital Data ◽  
Digital Information ◽  
Pixel Expansion ◽  
Empirical Results ◽  
Logistic Chaotic Map

Progressive Visual Cryptography (PVC) is quite suitable for sharing sensitive digital data. Previous research on PVC, such as Fang et al. (2006) and W.P.Fang et al.(2008) were all carrying pixel-expansion problem and also gives a poor visual quality on the recovered stacked image. Recently, Hou & Quan (2011) have developed a progressive scheme for secret sharing. It is observed that shares generated by the scheme are free from pixel expansion problem, but shares are not fully secure. In this paper, a new progressive sharing algorithm based on logistic chaotic map has been proposed to overcome the said limitation of Hou (2011) scheme. The irregular outputs of the logistic map are used to encode a secret digital information carrying image. The performance of the algorithm in the scheme of Hou (2011) is critically analyzed and compared with new suggested scheme. Empirical results are presented to showcase the performance of the authors' proposed scheme in terms of its effectiveness (imperceptibility and security) and feasibility.

Chaotic Map for Securing Digital Content

2016 ◽  
Vol 3 (1) ◽  
pp. 20-35 ◽  
Author(s):  
Dhiraj Pandey ◽  
U. S. Rawat
Keyword(s):  
Secret Sharing ◽  
Chaotic Map ◽  
Logistic Map ◽  
Visual Cryptography ◽  
Visual Quality ◽  
Digital Content ◽  
Digital Information ◽  
Pixel Expansion ◽  
Empirical Results ◽  
Logistic Chaotic Map

Progressive Visual Cryptography (PVC) is quite suitable for sharing sensitive digital data.Previous research on PVC, such as Fang et al. (2006) and W.P.Fang et al.(2008) were all carrying pixel-expansion problem and also gives a poor visual quality on the recovered stacked image. Recently, Hou&Quan (2011) have developed a progressive scheme for secret sharing. It is observed that shares generated by the scheme are free from pixel expansion problem, but shares are not fully secure. In this paper, a new progressive sharing algorithm based on logistic chaotic map has been proposed to overcome the said limitation of Hou (2011) scheme. The irregular outputs of the logistic map are used to encode a secret digital information carrying image. The performance of the algorithm in the scheme of Hou (2011) is critically analyzed and compared with new suggested scheme. Empirical results are presented to showcase the performance of the authors' proposed scheme in terms of its effectiveness (imperceptibility and security) and feasibility.

K out of N Secret Sharing Scheme for Multiple Color Images with Steganography and Authentication

2016 ◽  
Vol 16 (02) ◽  
pp. 1650010 ◽  
Author(s):  
P. Mohamed Fathimal ◽  
P. Arockia Jansi Rani
Keyword(s):  
Secret Sharing ◽  
Visual Quality ◽  
Color Images ◽  
Pixel Expansion ◽  
Image Sharing ◽  
Digital Ecosystem ◽  
Sharing Scheme ◽  
Text Steganography ◽  
Key Aspects

With our lives trundling toward a fully-digital ecosystem in break-neck speed, today’s encryption and cryptography are facing the challenge of ensuring security and future-readiness of our transactions. When such transactions involve multiple hands, transmission of such data in discrete and recoverable parts (secret shares) guarantees confidentiality. This paper’s objective is to present a foolproof way of multiple secret sharing, eliminating issues such as half-toning and degradation of visual quality of the recovered images. This [Formula: see text] out of [Formula: see text] steganography and authenticated image sharing (SAIS) scheme for multiple color images generates [Formula: see text] relevant shares with the ability to reconstruct the secret images using [Formula: see text] shares and facility to find out any move for appropriation of share cover images. The key aspects of this proposed scheme is to use simple Boolean and arithmetic operations with reduction of computational complexity from [Formula: see text] to [Formula: see text] and to share multiple images without any pixel expansion.

scholarly journals A Chaos based image Encryption Scheme using one Dimensional Exponential Logistic Map.

2019 ◽  
Vol 1 ◽  
pp. 223-237
Author(s):  
Terlumun Gbaden
Keyword(s):  
Correlation Coefficient ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Scheme ◽  
One Dimensional ◽  
Encryption And Decryption ◽  
Secret Keys ◽  
Encryption Decryption ◽  
Logistic Chaotic Map ◽  
Encrypted Images

The widespread use of images in various sectors of life makes its protection increasingly necessary and important. An improvement over encryption and decryption algorithm using exponential logistic chaotic map was proposed. In this work, we adopt an encryption/decryption strategy for colour images using the exponential logistic chaotic map. The proposed encryption/decryption algorithms are implemented in MATLAB for computer simulation. The experimental results indicate that the proposed algorithms can be used successfully to encrypt/decrypt images with secret keys. The performance analysis using histogram uniformity analysis and correlation coefficient show that the algorithms give larger space, quick speed and easy to realize. The encrypted images have good encryption effect and low correlation coefficient rendering it a good candidate for confidential and secure means of transmitting image information in untrusted networks.

scholarly journals An Investigation into the Performance of Particle Swarm Optimization with Various Chaotic Maps

2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Akugbe Martins Arasomwan ◽  
Aderemi Oluyinka Adewumi
Keyword(s):  
Particle Swarm Optimization ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
Particle Swarm ◽  
Test Problems ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Mathematical Problems ◽  
Logistic Chaotic Map

This paper experimentally investigates the effect of nine chaotic maps on the performance of two Particle Swarm Optimization (PSO) variants, namely, Random Inertia Weight PSO (RIW-PSO) and Linear Decreasing Inertia Weight PSO (LDIW-PSO) algorithms. The applications of logistic chaotic map by researchers to these variants have led to Chaotic Random Inertia Weight PSO (CRIW-PSO) and Chaotic Linear Decreasing Inertia Weight PSO (CDIW-PSO) with improved optimizing capability due to better global search mobility. However, there are many other chaotic maps in literature which could perhaps enhance the performances of RIW-PSO and LDIW-PSO more than logistic map. Some benchmark mathematical problems well-studied in literature were used to verify the performances of RIW-PSO and LDIW-PSO variants using the nine chaotic maps in comparison with logistic chaotic map. Results show that the performances of these two variants were improved more by many of the chaotic maps than by logistic map in many of the test problems. The best performance, in terms of function evaluations, was obtained by the two variants using Intermittency chaotic map. Results in this paper provide a platform for informative decision making when selecting chaotic maps to be used in the inertia weight formula of LDIW-PSO and RIW-PSO.

scholarly journals Image Security using Digital Image Watermarking and Visual Cryptography Techniques

2020 ◽  
Vol 9 (4) ◽  
pp. 2386-2391
Keyword(s):  
Digital Media ◽  
Digital Image ◽  
Image Watermarking ◽  
Visual Cryptography ◽  
Digital Data ◽  
Digital Image Watermarking ◽  
Digital Information ◽  
Secret Key ◽  
Public Networks ◽  
Real Time Application

In today’s world, the enhancement in internet technologies, digital data are mostly used to share the information in public networks. There are many traditional security techniques used to provide security to the digital information. But the existing methods don’t provide much of the security to digital media like image, video, audio, etc. The digital watermarking is employed in the protection of digital information. This paper gives a review on digital image watermarking based on the visual cryptography to reach secure protection for the images. The secret information can be inserted in the original images. The secret key is generated from the watermark image with the help of visual cryptography to claim the ownership of images. Various types of Visual Cryptography and Digital Image Watermarking techniques are explained in real time application.

scholarly journals Collusion Attacks in XOR Based RG-VSS

2019 ◽  
Vol 8 (10) ◽  
pp. 2339-2345
Keyword(s):  
Secret Sharing ◽  
Data Security ◽  
Visual Cryptography ◽  
Visual Quality ◽  
Visual Secret Sharing ◽  
Security Issue ◽  
Collusion Attacks ◽  
Secret Image ◽  
The Past

Visual secret sharing (VSS) is a well-known technique from the past few decades for data security. Recently, XOR based VSS has attracted many researchers due to its lossless or good visual quality of reconstructed secret image. Cheating in visual cryptography based VSS was introduced by Horng et. al. in 2006. Cheating occurs when a dishonest participant presents fake share and performs stacking of fake share with honest participants who have genuine share, thereby revealing the fake secret image instead of the original secret image. Cheating occurs when some XOR based VSS are exposed to collusion attacks. Here, in this paper, we have demonstrated and proved that there is a security issue in existing XOR based VSS schemes.

A Study on Visual Cryptography for Colour Images

2017 ◽  
Vol 7 (7) ◽  
pp. 260
Author(s):  
R. Shanmuga Priya ◽  
A. Senthilkumar
Keyword(s):  
Image Processing ◽  
Computational Complexity ◽  
Secret Sharing ◽  
Human Visual System ◽  
Visual Information ◽  
Visual Cryptography ◽  
Pixel Expansion ◽  
Image Processing Techniques ◽  
Printed Text ◽  
Processing Techniques

The intent of this paper is to present some of the major things about visual cryptography for colour images. The idea behind this technique is quite simple and powerful. Visual cryptography deals with visual information like picture, printed text and written notes etc. Visual cryptography also called secret sharing. As the name implies visual cryptography which has a single secret image and more than one shadow images and provided for numerous users. Visual cryptography process depends on various measures such as accuracy, computational complexity, pixel expansion, contrast whether generated it is meaningless or meaningful. Encryption performed by image processing techniques and the decryption carried out by human visual system with the stacking images. Visual cryptography need not require any complicated cryptographic proficiency. So, the intruders or hackers get hard to hack the details programmatically. However, this papers deals with visual cryptography for colour images.

Sharing Multiple Digital Images via Halftoning Methods

2012 ◽  
Vol 182-183 ◽  
pp. 1992-1997
Author(s):  
Kai Hui Lee ◽  
Pei Ling Chiu
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Encryption Algorithm ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Binary Images ◽  
Multiple Secrets ◽  
Image Area ◽  
Display Quality ◽  
Encryption Method

The visual secret sharing for multiple secrets (VSSM) technique allows for the encryption of more than one secret images in a given image area. Previous research on VSSM schemes has a pixel expansion problem that limits the capability to increase the capacity of secret image encryption. Moreover, the VSSM schemes focus on sharing binary images to date. These drawbacks limit the applicability of existing VSSM schemes. In this study, we propose a novel encryption algorithm to address these problems. The proposed algorithm adopts a visual cryptography (VC)–based encryption method that can eliminate the pixel expansion problem and is applicable to halftone secret images. The experimental results demonstrate that the proposed approach not only can increase the capacity of VSSM schemes, but also can maintain an excellent level of display quality in the recovered secret images.

scholarly journals An optimization of color halftone visual cryptography scheme based on Bat algorithm

2021 ◽  
Vol 30 (1) ◽  
pp. 816-835
Author(s):  
Firas Mohammed Aswad ◽  
Ihsan Salman ◽  
Salama A. Mostafa
Keyword(s):  
Visual Information ◽  
Mean Squared Error ◽  
Signal To Noise Ratio ◽  
Visual Cryptography ◽  
Visual Quality ◽  
Bat Algorithm ◽  
Pixel Expansion ◽  
Low Contrast ◽  
Secret Image ◽  
Visual Cryptography Scheme

Abstract Visual cryptography is a cryptographic technique that allows visual information to be encrypted so that the human optical system can perform the decryption without any cryptographic computation. The halftone visual cryptography scheme (HVCS) is a type of visual cryptography (VC) that encodes the secret image into halftone images to produce secure and meaningful shares. However, the HVC scheme has many unsolved problems, such as pixel expansion, low contrast, cross-interference problem, and difficulty in managing share images. This article aims to enhance the visual quality and avoid the problems of cross-interference and pixel expansion of the share images. It introduces a novel optimization of color halftone visual cryptography (OCHVC) scheme by using two proposed techniques: hash codebook and construction techniques. The new techniques distribute the information pixels of a secret image into a halftone cover image randomly based on a bat optimization algorithm. The results show that these techniques have enhanced security levels and make the proposed OCHVC scheme more robust against different attacks. The OCHVC scheme achieves mean squared error (MSE) of 95.0%, peak signal-to-noise ratio (PSNR) of 28.3%, normalized cross correlation (NCC) of 99.4%, and universal quality index (UQI) of 99.3% on average for the six shares. Subsequently, the experiment results based on image quality metrics show improvement in size, visual quality, and security for retrieved secret images and meaningful share images of the OCHVC scheme. Comparing the proposed OCHVC with some related works shows that the OCHVC scheme is more effective and secure.

Sign in / Sign up

Export Citation Format

Share Document