A Fast and Hardware-Efficient Visual Cryptography Scheme for Images

A reversible extended secret image sharing scheme based on Chinese remainder theorem

ABSTRACTA (k,n)‐scalable secret image sharing (SSIS) scheme shares a secret image into n independent shadow images. This (k,n)‐SSIS scheme can simultaneously provide the properties of threshold (k or more shadow images are required in reconstruction; but k − 1 or less shadow images reveal no information on the secret image) and the scalability (when k or more than k shadow images participate in reconstruction, more shadow images can reveal more information amount of secret image). In this paper, we deal with (k,n)‐SSIS scheme with the smooth scalability such that the information amount of revealed image is “smoothly” proportional to the number of involved shadows, the whole secret image can be reconstructed only when all the n shadow images participate in reconstruction. Comparing with the existing smooth (k,n)‐SSIS schemes, the proposed scheme has the less size of shadow image. Copyright © 2014 John Wiley & Sons, Ltd.

Due to the opportunities provided by the Internet, people are taking advantage of e-learning courses and enormous research efforts have been dedicated to the development of e-learning systems. So far, many e-learning systems are proposed and used practically. However, in these systems the e-learning completion rate is low. One of the reasons is the low study desire and motivation. In this work, we present an IoT-Based E-Learning testbed using Raspberry Pi mounted on Raspbian. We carried out some experiments with a student of our laboratory for brain waves and, encryption and decryption time of cipher algorithms. We used MindWave Mobile (MWM) to get the data. For experimental results, when using our system the concentration is 80 [%] from 0 [s] to 400 [s]. But, for 400 [s] to 1000 [s], concentration is decreased. In the case of not using our system, concentration is almost the same (about 40 [%]) from 0 [s] to 1000 [s]. From simulation results, we found that the decryption time is faster than encryption time, however for 3-DES and Raspberry Pi decryption time is higher than encryption time.

Cloud computing technologies comprise various kinds of significant desirable constrains such as security, liability, government surveillance, telecommunications capacity, anonymity and privacy. The usage of cipher text technology is considered as a desired technique for performing the process of encryption in order to solve the issue of granting security to the data that are shared in the cloud. Similarly, the architecture of multi-tenant in the cloud computing system grants benefits to both the service providers and end-users which shares a common cloud platform to multiple tenants (i.e.) users and suitable resources are also computed by implementing proposed architecture. Therefore in this research work, the concept of cipher text multi-tenant are integrated for providing enhanced security to the data shared in the cloud environment. Hence a Modified Elliptic Curve Cryptography (MECC) based on Diffee Hellman algorithm is proposed in this research paper which provides enhanced security using alternate key generation. The encryption, decryption, upload and download time are calculated and it is concluded that the algorithm that is proposed in this research paper consumes less time for all these measures when comparing with other existing algorithms. Characteristics like less memory, high operational performance, small sized keys and rapid key generation process, and effective resource savings enable the modified ECC to obtain high efficiency. The encryption time of the proposed MECC system was 51ms with the key length 4096 bits, whereas existing method had 92ms as encryption time. Likewise With the key length of 4096 bits, the decryption time for the proposed model was 159ms. Accordingly the proposed system has reduced cipher text key size of 836KB when compared with the existing AES, Blow Fish, and Two Fish. Additionally, the key generation time (35 s) also seems to be considerably reduced when compared with the existing methods. These statements reveal that the proposed system outshine the state of art methods in terms of key generation time, encryption and decryption time and computational complexity.

Values such as cellular sum in initial configurations and neighbor radius can potentially affect confusion and diffusion in cellular automata. Specifically, both confusion and diffusion characteristics in cellular automata usually are not sufficient to break up the high correlation between the secret image pixels when these two parameters are too small. Thus, using only One-Dimensional Reversible Memory Cellular Automata (ODRM-CA) to generate shadow images will lead to the leakage of original secret image’s information by some shadow images. In order to solve this problem, in this paper, we propose an image secret sharing (ISS) scheme with no third-party scrambling method. This is realized by increasing the values of cellular sum and neighbor radius to implement the scrambling process for the secret image, thus both processes of image scrambling and image secret sharing can be achieved by ODRM-CA. Experimental results show that this scheme can generate strong random shadow images to avoid leaking information of the original secret image.

Information security is major obstacle in different areas like military, network application, bank application. File is forward from one location to another location in the network. Many hackers are illegally access the information. To provide solution to this problem many authors has introduced different algorithms and techniques. The different algorithms like AES, DES and triple DES achieve more security but it takes more time for encryption and decryption files. These algorithm increases the complexity of the algorithm. In our algorithm we have investigate parameters of network security. This algorithm provides more security and takes smallest amount of time for file encryption and decryption. This algorithm can apply on different types of files like text, image, audio, video files. In the Byte Rotation Algorithm involve two techniques. One is random key generation technique is used. And second is parallel encryption and decryption is process using multithreading technique. Key size of random key generation technique is 128 bit.128 bit random key generation is difficult for crack to attacker.

Secret image sharing is a technique to share a secret image among a set of n participants. A trusted third party embeds the secret image into the cover image to generate shadow images such that at least t or more shadow images can reconstruct the secret image. In this paper, we consider an extreme and real-world situation, in which there is no one who is trusted by anyone else. In the proposed scheme, the participants can act as a dealer and communicate with each other in a secret channel. Each participant can generate her/his own shadow image independently, according to the cover image and the secret image. Experimental results are provided to show that the shadow images have satisfactory quality. In addition, our scheme has a large embedding capacity, and the secret image can be reconstructed losslessly.

We presents a novel (2, 2) secret sharing (SS) scheme for all grayscale images. Generally, a secret image is distribute more than two shadow images, which are dealt out among participants. In order to find out secret image, participants print shadow images to transparent papers. Then, a secret image will appear as stacking transparent papers. The secret sharing scheme in this paper distribute secret image into natural grayscale images using multiplexer and data hiding scheme. After then, two participant have two shadow images respectively. The merit of the proposed scheme is that shadow images have small loss in aspect of the quality with steganographic features. Therefore, the proposed secret sharing scheme in this paper is not easily detected by attackers. The experiment result verified that the proposed scheme, obviously outperforms previous SS schemes.

ABSTRACTFinancial agencies need to safeguard confidential information and mitigate the risks associated with data leakage. Data hosted on cloud servers must be protected by robust security measures. To achieve this objective, we have developed the Cloud Security and Encryption Algorithm with Configurable Dynamic Key Size (CSEDS), a comprehensive framework consisting of three integral components. In the first step, a configurable context signature manager analyzes and assesses user data sensitivity. Second, the cloud server's load and performance are evaluated by an investigator. Finally, a resilient cloud data cryptosystem is implemented to securely encrypt user data. We use elliptical curve (EC) method for encryption, ensuring security, and confidentiality for cloud‐hosted user data. Several factors were considered when evaluating the framework's effectiveness, including throughput, encryption time, and decryption time. Compared to existing systems, the CSEDS system outperforms the Hybrid Paillier‐Blowfish Algorithm (HPBA), Hybrid Cloud Cryptosystems (HCA), and genetic algorithms utilizing logical‐mathematical functions (GTLMF). The ECC Algorithm in our framework makes use of adaptive key sizes, based on cloud resources and sensitive user data. The proposed framework enhances security significantly, as demonstrated by our research and simulations. In comparison to GTLMF, CGA, HCA, and HPBA, our framework improves security levels by 5%, 2%, 3%, and 1%, respectively.

The visually meaningful image encryption (VMIE) technique is used to offer additional security to the noise-like encrypted image by implanting the secret image in the cover image. Generally, VMIE techniques follow two steps: pre-encryption and embedding. In this paper, an advanced V-Net architecture based VMIE technique is presented. V-Net architecture is based on a Convolution Neural Network (CNN) and offered medical image segmentation, that is utilized in the image into image steganography in the proposed work. In the proposed VMIE technique, the secret image is encrypted by utilizing the 5D chaotic map to provide high security, and the encrypted secret image is implanted into the cover image using a V-Net based embedding method. CNN-based image embedding methods offer high payload capacity and imperceptibility. In these methods, the encoder hides the secret image into the cover and the decoder reconstruct the secret image. Furthermore, a CNN-based efficient decoder is designed in the proposed method. Moreover, to validate the proposed method, standard evaluation parameters are analyzed.

Objectives: The implementation of Genetic algorithm in the symmetric block cipher Advanced Encryption Standard -128 (AES-128) algorithms to enhance the performance of cryptographic operations. Methods: Genetic algorithm is used for generating the best fit non-repetitive cipher key and for key distribution to design a dynamic Substitution box in AES-128. Findings: The study reveals that the efficiency of the cryptographic algorithm treated with Genetic algorithm is dependent on the variations in the number of generations and initial population size. The result shows that an optimum population size has less encryption and decryption time. Among the sample population size taken for the experiment, almost the average population size has minimum encryption and decryption time. Results from iteration variations shows that the average number of iterations has less encryption and decryption time. Improvements: The hybrid combination of Genetic algorithm and AES-128 can be further modified for images and audio messages also. Keywords: Genetic Algorithm, Iterations, Non-Repetitive Cipher Key, Population Size, Substitution Box

Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability

Visual secret sharing is the technique that divide the secret image into n multiple shares. Each share constitutes some information and when k shares out of n stack together the secret will reveal. However, less than k shares are not work. Sharing is the idea from secret sharing scheme that was presented in 1975 by Adi Shamir. The beauty of the visual secret sharing scheme is its decryption process i.e. To decrypt the secret using Human Visual System (HVS) without any computation. Visual cryptography is presented by Noar and Shamir in 1995 including also visual secret sharing. The resultant secret recover through this scheme is double in size of the original secret [17]. We have proposed the new algorithms for the (2, 2) visual cryptography and (3, 3) visual secret sharing. Our proposed schemes are for gray scale image and by stacking the shares, the resultant image achieved in same size with original secret image and Its shadow Image. We used randomization and pixel reversal approach in all methods.

An attempt is made for improvement of secret image invisibility in circulation images with dyadic wavelet based data hiding with run-length coded secret images of which location of codes are determined by random number. Through experiments, it is confirmed that secret images are almost invisible in circulation images. Also robustness of the proposed data hiding method against data compression of circulation images is discussed. Data hiding performance in terms of invisibility of secret images which are embedded in circulation images is evaluated with the Root Mean Square difference between the original secret image and extracted one from the circulation images. Mean while the conventional Multi- Resolution Analysis (MRA) based data hiding is attempted with a variety of parameters, level of MRA and the frequency component location of which secret image is replaced to it and is compared to the proposed method. It is found that the proposed data hiding method is superior to the conventional method. Also the conventional data hiding method is not robust against circulation image processing.

In this paper, we propose a (n, n)-threshold reversible secret image sharing scheme using histogram shifting. Unlike Shamir’s secret sharing, the proposed scheme does not use a polynomial. In the secret image sharing procedure, a histogram is generated by the difference value between the original and copy images. And, the secret image is embedded into original and copy images by using histogram shifting. Lastly, generated shadow images are distributed to each participant. In the experimental results, we measure embedding capacity of secret image and a distortion ratio between original and shadow images. The experimental results show that the embedding capacity and image distortion ratio of the proposed scheme are superior to the previous schemes.