Robust Image Sharing Scheme Using One Dimensional Chaotic Logistic Map

2018 ◽  
pp. 157-168
Author(s):  
Vikrant Kumar Saini ◽  
Amitesh Singh Rajput ◽  
Balasubramanian Raman
Keyword(s):  
Logistic Map ◽  
One Dimensional ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Robust Image ◽  
Chaotic Logistic Map

scholarly journals Dynamical properties of a novel one dimensional chaotic map

2022 ◽  
Vol 19 (3) ◽  
pp. 2489-2505
Author(s):  
Amit Kumar ◽  
◽  
Jehad Alzabut ◽  
Sudesh Kumari ◽  
Mamta Rani ◽  
...  
Keyword(s):  
Time Series ◽  
Lyapunov Exponent ◽  
Chaotic Behavior ◽  
Chaotic Map ◽  
Logistic Map ◽  
Maximal Lyapunov Exponent ◽  
Bifurcation Diagrams ◽  
One Dimensional ◽  
Dynamical Properties ◽  
Chaotic Logistic Map

<abstract><p>In this paper, a novel one dimensional chaotic map $ K(x) = \frac{\mu x(1\, -x)}{1+ x} $, $ x\in [0, 1], \mu &gt; 0 $ is proposed. Some dynamical properties including fixed points, attracting points, repelling points, stability and chaotic behavior of this map are analyzed. To prove the main result, various dynamical techniques like cobweb representation, bifurcation diagrams, maximal Lyapunov exponent, and time series analysis are adopted. Further, the entropy and probability distribution of this newly introduced map are computed which are compared with traditional one-dimensional chaotic logistic map. Moreover, with the help of bifurcation diagrams, we prove that the range of stability and chaos of this map is larger than that of existing one dimensional logistic map. Therefore, this map might be used to achieve better results in all the fields where logistic map has been used so far.</p></abstract>

Chaotic logistic map, parabola, and gravity

2019 ◽  
Author(s):  
Matheus Pereira Lobo
Keyword(s):  
Logistic Map ◽  
Chaotic Logistic Map

I am trying to connect gravity with chaos via the parabola in the logistic map.

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.

Distortion less secret image sharing scheme for Internet of Things system

2017 ◽  
Vol 22 (S1) ◽  
pp. 2293-2307 ◽  
Author(s):  
Li Li ◽  
M. Shamim Hossain ◽  
Ahmed A. Abd El-Latif ◽  
M. F. Alhamid
Keyword(s):  
Internet Of Things ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Secret Image Sharing Scheme

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 Efficient Secret Image Sharing Scheme with Authentication and Cheating Prevention

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Lina Zhang ◽  
Xuan Dang ◽  
Li Feng ◽  
Junhan Yang
Keyword(s):  
Distributed Storage ◽  
Limited Resources ◽  
Secret Image Sharing ◽  
Authentication Codes ◽  
Authentication Code ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Hash Algorithm ◽  
Security Levels

Due to the widespread adoption and popularity of digital images in distributed storage, Secret Image Sharing (SIS) has attracted much attention. However, preventing the cheating of shares is an important problem that needs to be solved in the traditional SIS scheme. An adversary without image shares may participate in the restoration phase as a share owner. In this phase, the adversary can obtain real shares or prevent recovering real images by submitting fake shadows. Our schemes are based on the original Thien-Lin’s scheme. In the scheme I, we use some XOR operations to get two authentication codes through all secret pixel values to achieve a lightweight and fast-calculated authentication scheme for cheating prevention. This scheme is suitable for small devices with limited resources. In scheme II, we use a hash algorithm to generate the authentication code. This scheme is suitable for environments with larger storage space and higher security levels. Since all pixel values are involved in the authentication in our proposed schemes, it can prevent fake shadow images from cheating. Meanwhile, the shadow size is almost the same as the original Thien-Lin’s scheme. Experimental results and theoretical analysis show that the proposed schemes are feasible and effective.

scholarly journals An Image Encryption Algorithm with Total Diffusion

2018 ◽  
Vol 11 (1) ◽  
pp. 15-25
Author(s):  
Jakub Oravec ◽  
Ján Turán ◽  
Ľuboš Ovseník
Keyword(s):  
Image Encryption ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Diffusion Stage ◽  
Suitable Combination ◽  
Image Pixels ◽  
Encrypted Images ◽  
Two Stages ◽  
Image Encryption Algorithm ◽  
Chaotic Logistic Map

Abstract This paper proposes an image encryption algorithm which uses four scans of an image during the diffusion stage in order to achieve total diffusion between intensities of image pixels. The condition of total diffusion is fulfilled by a suitable combination of techniques of ciphertext chaining and plaintext related diffusion. The proposed encryption algorithm uses two stages which utilize chaotic logistic map for generation of pseudo-random sequences. The paper also briefly analyzes approaches described by other researchers and evaluates experimental results of the proposed solution by means of commonly used measures. Properties of our proposal regarding modifications of plain images prior to encryption or modifications of encrypted images prior to decryption are illustrated by two additional experiments. The obtained numeric results are compared with those achieved by other proposals and briefly discussed.

scholarly journals A Novel (2, 3)-Threshold Reversible Secret Image Sharing Scheme Based on Optimized Crystal-Lattice Matrix

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2063
Author(s):  
Jiang-Yi Lin ◽  
Ji-Hwei Horng ◽  
Chin-Chen Chang
Keyword(s):  
Crystal Lattice ◽  
Three Dimensional ◽  
Lattice Models ◽  
Cover Image ◽  
Secret Image Sharing ◽  
Secret Data ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Growth Phenomenon

The (k, n)-threshold reversible secret image sharing (RSIS) is technology that conceals the secret data in a cover image and produces n shadow versions. While k (kn) or more shadows are gathered, the embedded secret data and the cover image can be retrieved without any error. This article proposes an optimal (2, 3) RSIS algorithm based on a crystal-lattice matrix. Sized by the assigned embedding capacity, a crystal-lattice model is first generated by simulating the crystal growth phenomenon with a greedy algorithm. A three-dimensional (3D) reference matrix based on translationally symmetric alignment of crystal-lattice models is constructed to guide production of the three secret image shadows. Any two of the three different shares can cooperate to restore the secret data and the cover image. When all three image shares are available, the third share can be applied to authenticate the obtained image shares. Experimental results prove that the proposed scheme can produce secret image shares with a better visual quality than other related works.

Sign in / Sign up

Export Citation Format

Share Document