Fig 2 - uploaded by Kapil Mishra
Content may be subject to copyright.
Public key or asymmetric key cryptography 

Public key or asymmetric key cryptography 

Source publication
Article
Full-text available
Exponentially increasing multimedia data over the internet raises concerns over its security. In the current work, we present a new technique for encrypting digital images based upon the pixel shuffling combined with changing pixel values using 128-bit secret key using henon chaotic map. Chaotic maps are characterized by their high sensitivity towa...

Context in source publication

Context 1
... Asymmetric key techniques, sender and receiv- er use different keys for encryption and decryption, as shown in figure 2 below. These techniques do not require secure key exchange but are generally more complex than symmetric key techniques [1,14]. ...

Similar publications

Article
Full-text available
This paper presents a secured computation of modular exponentiation to resist higher-order differential power analysis (HODPA) attacks in asymmetric cryptosystems like RSA. HODPA attacks can be resisted by segmenting secret sensitive data and its intermediate values into multiple shares. In modular exponentiation-based cryptosystems, the exponent p...

Citations

... In [42], The authors proposed a new technique based on pixel shuffling associated with changing pixel values using both 128-bit secret key and Henon choatic map. As choatic maps are sensitively high towards the initial parameters, chaotic ...
Thesis
Full-text available
Since image transmission via computer networks, especially the Internet, is developing at a rapid speed, the security of digital images has become a key concern. In this thesis, I am proposing a new medical image encryption scheme. The first stage incorporates the use of the Fibonacci sequence, the second stage incorporates the use of an S-box, and the third stage makes use of the Tan Bessel logistic function. The proposed scheme's performance is evaluated using various metrics. According to the results of the evaluation, the proposed scheme proved that it is resistant to statistical attacks and robust against differential attacks.
... However the issue of data storage in cloud computing as face images being inputs has never been attempted through hybrid algorithm. [10] had attempted to encrypt images in clouds through 'Chaotic maps' and stated that image encryption is quite easier to encode and decode than plain texts since they deal with RGB-colours and attributes like: illumination, gradient, contrast and size as variables. ...
... A new technique towards image encryption through Henon chaotic-map and tested the developed model through progression of tests for measuring the performance metrics [10]. Through the examination and evaluation the authors found that the developed algorithm was recorded as highly sensitive against the statistical attacks and varied brutalforces. ...
Article
Cloud as a storage in the recent technological development had been focused by researchers, since it offers more insight towards meta-data based security and safety along with techniques in encryption and decryption of messages. “Data” being a crucial and complicated means-of-information in current technological era, it has been majorly accessed and utilized for varied purposes (example: image storage/access) by people globally through ‘cloud computing’ via social platforms, personal data-storage, professional data-accumulation, research based studies, etc. Thus to protect data in cloud, especially the images, the current study developed the algorithm by combining ‘AES’ and ‘Fernet’ where double-level encryption with CNN Auto-Encoders. Thus by developing the model, the study aims to provide more secured cloud computing model than existing models. The original images as input are processed, encrypted/decrypted, converted into bitmap images as outputs that are decrypted by users with ‘key’ when needed. The study was a success and found to be effective in image encryption field with high RMSE (0.040206), less MSE-Loss (0.001616) and MAE (0.0266323) scores than estimated scores.
... The input image is divided into many blocks with 4 x 4 size, then pixel values are shuffled in these blocks by using chaotic map to get the partial encrypted image. Kapil et al. in [4], presented a new technique for encrypting images by using pixel shuffling combined with changing pixel values by using 128-bit secret key generated by henon chaotic map. Lingfeng et al. in [5], designed a technique that consists of three steps to encrypt images. ...
Article
Full-text available
– In recent years, with rapid development in information and communication technologies, sharing digital images in social media have facilitated. However, since images privacy matters in our society, keeping images protected became a big challenge we have to deal with. In this paper, we propose a new image encryption method using Image Pixel Shuffling and 3D Chaotic map. First, the plain image is encoded using pixel shuffling, then the result is XORed with a key, and finally, the 3D chaotic map is performed on it. The security will be increased by using three steps to encrypt the image. Our results show that the proposed approach has a good performance and it is better than those of some notable image encryption algorithms. We got entropy value 7.9901 of cipher image, NPCR of 99.6628%, and UACI of 33.6781%. MATLAB was used to implement the proposed image encryption approach.
... The proposed work is a lossless method. So the experimental result is compared with two recently reported lossless [23][24][25][26][27][28][29][30] method (where exact replica of original image is stored) "Cipher Secret Image using Hybrid Visual Cryptography"(CSIHVC) [18] proposed by R.I. Hasan et al and "Secret Image Enhanced Sharing using Visual Cryptography"(SIESVC) [17] proposed by K. Brindha and N. Jayanthi. Table I, Table II, Table III, Table IV and Table V show the comparative study of Entropy test, Poker test, Run test, Frequency test and Serial test [21] respectively between proposed method and two recently reported color image cryptography (lossless) in literature. ...
Article
Shared visual cryptography is a method to protect image-based secrets where an image is kept as multiple shares having less computational decoding process. Steganography is a technique to hide secret data in some carrier like-audio, image etc. Steganography technique is categorized into four categories. i) Spatial Domain Technique- Image pixel values are converted into binary and some of the binary values changed to hide secret data. ii) Transform Domain Technique- the message is hidden in cover image and then it is transformed in the frequency domain. iii) Distortion Technique- information is stored by changing the value of the pixel. iv) Visual Cryptography Technique- Image is broken into two or more parts called shares. This article proposes a hybrid visual crypto-steganography approach which exploits the advantages of both approaches to protect image based secret in communication. Most of the visual cryptography is applied on black and white images but the proposed method can be applied directly on color images having three channels. This method does not change the image size. Also an exact replica of original image can be reconstructed therefore this process does not result in image quality degradation. This article proposes novel color image share cryptography where seven shares are generated from one color image (correlated/decorrelated color space). These shares are sent to the receiver and original image is reconstructed using all those shares. Share generation and image reconstruction is based on simple operation like pixel shuffling, reversing binary string of the image information, ratio of pixel intensity values. Row key matrix and column key matrix are generated using random function. Pixel positions are shuffled using these two key matrixes. These seven shares namely Row Key, Column Key, Remainder matrix, Quotient matrix, R ratio matrix, G ratio matrix and B ratio matrix are generated. Then Row key matrix, Column key matrix, Remainder matrix, Quotient matrix, I1, I2 and I3 ratio matrix are hidden into separate cover images by LSB encoding technique and sent over the network. Receiver can reconstruct the image if all shares are available only. The proposed method is applied on standard images in the literature and images captured using standard digital camera. Comparison study with existing methods shows that the proposed method performs better in terms of NIST metrics. The method has many applications in the area of visual cryptography, shared cryptography, image based authentication etc.
... The scheme ensured data security without modifying the information of the original carrier. Mishra et al. [19] proposed a new digital image encryption algorithm based on chaotic mapping. The algorithm could not only guarantee the security of the key, but also resist a variety of brute force or statistical attacks. ...
Article
Full-text available
The encrypted image retrieval in cloud computing is a key technology to realize the massive images storage & management and images safety. In this paper, a novel feature extraction method for encrypted image retrieval is proposed. Firstly, the improved Harris algorithm is used to extract the image features. Next, the SURF (Speeded-Up Robust Features) algorithm and the BOW (Bag of Words) model are applied to generate the feature vectors of each image. Then, LSH (Local Sensitive Hash) algorithm is applied to construct the searchable index for the feature vectors. The chaotic encryption scheme is utilized to protect images and indexes security. Finally, secure similarity search is executed on the cloud server. Experimental results show that compared with the existing encryption retrieval schemes, the proposed retrieval scheme not only reduces the time consumption, but also improves the image retrieval accuracy.
... The cascade structure uses the trained neural network to filter the training data which is used along with a boostingbased learning algorithm to learn an optimal set of neural network parameters for each successive partition. In [10], a new cryptographic method is proposed for image encryption. This approach is based on shuffling pixels and changing their values using 128-bit secret key and Henon chaotic map. ...
Article
This research contribution reports a new symmetric encryption algorithm for ciphering the unique identification numbers (12- digit Aadhaar, Ration, Mobile, and region numbers in India) and biometric images. In this algorithm, existing unique number identifying a particular person are fully and partially utilized to produce secret key and cipher image respectively. For verification and authentication, person unique numbers are divided into two parts in the secret key generation. In the first part, the Aadhaar number is preprocessed with out-shuffle and coupling methods. In the second part, the remaining unique numbers are used for authentication. Finally, both parts are replaced with atomic symbols of periodic table property and extended ASCII values select depends on the day of the week to generate the complete secret key. On the other hand, biometric images split as small images and shuffle them with the dynamic pattern. Scrambling the pixel positions of shuffled images are accomplished by tree traversal algorithm and a novel technique. Meanwhile, 8-bit binary conversion of shuffled image values and cyclic shift process is performed. Even though the key space is less, the authentication and verification process eliminates the prediction of secret keys. Experimental result of the proposed encryption e has shown that various attacks and security is assured. The performance of the proposed encryption scheme is better than existing approaches.