scholarly journals Personalized Shares in Visual Cryptography

2018 ◽  
Vol 4 (11) ◽  
pp. 126
Author(s):  
Karim Hammoudi ◽  
Mahmoud Melkemi
Keyword(s):  
Visual Cryptography ◽  
Experimental Results ◽  
Human Vision ◽  
Secret Message ◽  
Pictorial Information

This article deals with visual cryptography. It consists of hiding a message in two key images (also called shares). The decryption of the message is obtained through human vision by superposition of the shares. In existing methods, the surface of key images is not visually pleasant and is not exploited for communicating textual or pictorial information. Presently, we propose a pictogram-based visual cryptography technique, which generates shares textured with customizable and aesthetic rendering. Moreover, robustness characteristics of this technique to the automated decoding of the secret message are presented. Experimental results show concrete personalized shares and their applicative potentials for security and creative domains.

Image and audio steganography based on indirect LSB

2021 ◽  
Vol 48 (4) ◽  
Author(s):  
Zainab N. Sultani ◽  
◽  
Ban N. Dhannoon ◽  
Keyword(s):  
Information Hiding ◽  
Experimental Results ◽  
Secret Message ◽  
Text File ◽  
Least Significant Bit ◽  
Audio Steganography

Hiding the presence of data during communication has become a pressing concern in this overly digitalized world as a consequence of illegitimate access. These concerns have led to cryptography and steganography techniques as methods for securing data. This paper presents a modified information hiding technique based on an indirect least significant bit. Instead of saving each bit of the secret message in the least significant bit (LSB) of the cover media, each bit of the secret message is compared to a mask bit in the cover media. The result is saved in the cover media’s LSB. In this paper, two steganography schemas are designed in which the cover media are image and audio, while the secret message is a text file. A simple encryption technique is used to transform the secret message into an unreadable format before the hiding process begins. The experimental results indicate that the proposed algorithm achieves promising performance

scholarly journals IMPLEMENTASI STEGANOGRAFI PADA TEKS TERENKRIPSI DENGAN ALGORITMA RSA MENGGUNAKAN METODE BPCS

2018 ◽  
Vol 7 (2) ◽  
pp. 260-265 ◽  
Author(s):  
Yulia Fatma ◽  
Harun Mukhtar ◽  
Muhammad Taufik
Keyword(s):  
Human Life ◽  
Human Vision ◽  
Encryption Algorithm ◽  
Secret Message ◽  
The Internet ◽  
Rsa Algorithm ◽  
Cryptographic Algorithm ◽  
Insertion Method ◽  
Bit Plane ◽  
Internet Network

The internet network is growing rapidly and has a great impact on human life. The development of the internet network has enabled many people to exchange information or messages,one of tham by using email media. Apparently the internet is a path that in ni not too safe because it is a common communication media that can be used by everyone so prone to tapping information or messages. Therefore, security and confidentiality are needed in data communications. One may to keep messages safe is to use steganography technique. The steganography method used is the method of message insertion using BPCS (Bit Plane Complexity Segmentation). Before the message is inserted, the message is first encrypted using cryptography techniques. The cryptographic algorithm used is RSA algorithm. RSA algorithm consists of encryption algorithm and decryption algorithm. The confidential message is encrypted using RSA encryption algorithm and inserted using the insertion method of BPCS. With the technique of steganography on the image media then the delivery of a secret message will have a good level of security because it can not be detected directly by the senses of human vision. Keywords: cryptography, steganography, RSA, method BPCS   Abstrak Jaringan internet berkembang dengan pesat dan memberikan pengaruh besar bagi kehidupan manusia. Perkembangan jaringan Internet telah memungkinkan banyak orang untuk saling bertukar informasi atau pesan salah satunya dengan media email. Ternyata, internet merupakan jalur yang tidak terlalu aman karna merupakan media komunikasi umum yang dapat digunakan semua orang sehingga rawan penyadapan informasi atau pesan. Oleh karena itu, keamanan dan kerahasiaan sangat dibutuhkan dalam komunikasi data. Salah satu cara untuk menjaga keamanan pesan adalah menggunakan teknik steganografi. Metode steganografi yang digunakan adalah metode penyisipan pesan, dengan menggunakan metode BPCS (Bit Plane Complexity Segmentation). Sebelum pesan disisipkan terlebih dahulu pesan tersebut dienkripsi dengan menggunakan teknik kriptografi. Algoritma kriptografi yang digunakan adalah algoritma RSA. Algoritma RSA terdiri dari algoritma enkripsi dan algoritma dekripsi. Pesan rahasia disandikan menggunakan algoritma enkripsi RSA dan disisipkan menggunakan metode penyisipan BPCS. Dengan adanya teknik steganografi pada media citra maka pengiriman suatu pesan yang bersifat rahasia akan memiliki tingkat keamanan yang baik karena tidak dapat dideteksi langsung oleh indera penglihatan manusia. Keywords: Kriptografi, Steganogari, RSA, Metode BPCS

scholarly journals Data-Hiding Scheme Using Multidirectional Pixel-Value Differencing on Colour Images

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Pyung-Han Kim ◽  
Eun-Jun Yoon ◽  
Kwan-Woo Ryu ◽  
Ki-Hyun Jung
Keyword(s):  
Data Hiding ◽  
Vision System ◽  
Experimental Results ◽  
Human Vision ◽  
Embedding Capacity ◽  
Secret Data ◽  
Colour Image ◽  
Pixel Value ◽  
The Difference ◽  
Pixel Value Differencing

Data hiding is a technique that hides the existence of secret data from malicious attackers. In this paper, we propose a new data-hiding scheme using multidirectional pixel-value differencing, which can embed secret data in two directions or three directions on colour images. The cover colour image is divided into nonoverlapping blocks, and the pixels of each block are decomposed into R, G, and B channels. The pixels of each block perform regrouping, and then the minimum pixel value within each block is selected. The secret data can be embedded into two directions or three directions based on the minimum pixel value by using the difference value for the block. The pixel pairs with the embedded secret data are put separately into two stego images for secret data extraction on receiver sides. In the extraction process, the secret data can be extracted using the difference value of the two stego images. Experimental results show that the proposed scheme has the highest embedding capacity when the secret data are embedded into three directions. Experimental results also show that the proposed scheme has a high embedding capacity while maintaining the degree of distortion that cannot be perceived by human vision system for two directions.

A Multi-Criteria Image Quality Evaluation Scheme

2013 ◽  
Vol 284-287 ◽  
pp. 2975-2979
Author(s):  
Yen Ching Chang ◽  
Chun Ming Chang ◽  
Liang Hwa Chen ◽  
Tung Jung Chan
Keyword(s):  
Image Quality ◽  
Contrast Enhancement ◽  
Quality Evaluation ◽  
Experimental Results ◽  
Human Vision ◽  
Effective Mechanism ◽  
Image Quality Evaluation ◽  
Evaluation Scheme ◽  
Grey Relational Grade ◽  
Grey Relational

It is difficult to objectively and quantitatively judge image quality by a single criterion, such as contrast. In general, excessive contrast enhancement easily leads to a loss of image quality. Thus, it easily gives a wrong evaluation to rank image quality according to contrast values. In order to achieve a consistent result with human vision perception, balancing multi-criteria will be a feasible approach. Therefore, we propose a multi-criteria image quality evaluation scheme for ranking seven existing contrast enhancement methods. The scheme applies four criteria to a newly proposed way of computing a grey relational grade (GRGd), called the consistent grey relational grade (CGRGd). Experimental results show that our proposed CGRGd do provides a very effective mechanism to choose the best method for a specific purpose.

scholarly journals Pixel-sieve cryptographic primitives with LSB steganography

2017 ◽  
Vol 7 (1) ◽  
pp. 14-22
Author(s):  
Arpad Incze
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Message ◽  
Cryptographic Primitives ◽  
New Approach ◽  
Alternative Method ◽  
Original Message ◽  
Carrier Image ◽  
Least Significant Bits

AbstractThis paper contains a brief description of new approach regarding LSB steganography. The novelty of the method resides in the combination of LSB (Least Significant Bits) steganography with some primitives of the pixel-sieve/bit-sieve cryptographic method. In short, we propose to use two or more carrier images and the sieving algorithm, borrowed from the pixel sieve primitive, to determine which carrier image will receive the next set of bits of the secret message. While in classic LSB steganography the secret message must be encrypted prior to embed the information into the carrier image, in our proposal the message is scrambled between the shares in a pseudo random way. An attacker will need all the carrier images and the sieving key in order to reconstruct the original message. Also we recommend an alternative method in which instead of simply replacing the last bit/bits we use them as XOR keys to further enhance the security. Keywords: steganography, cryptography, secret sharing; visual cryptography, LSB.

scholarly journals Embedding information into JPEG images with distortion masking in frequency domain

2020 ◽  
Vol 23 (4) ◽  
pp. 45-50
Author(s):  
A. S. Melman ◽  
◽  
P. O. Petrov ◽  
A. A. Shelupanov ◽  
A. V. Aristov ◽  
...  
Keyword(s):  
Frequency Domain ◽  
Data Transmission ◽  
Experimental Results ◽  
Cover Image ◽  
Secret Message ◽  
Security Level ◽  
Information Protection ◽  
Quantization Step ◽  
Jpeg Images ◽  
Statistical Steganalysis

Steganography allows to ensure the confidentiality of information by organizing covert data transmission channels. However, the effectiveness of steganographic information protection directly depends on the invisibility of a secret message, both for the human eye and for steganalysis methods. The paper proposes an approach that allows solving the problem of vulnerability of the popular QIM embedding method to statistical steganalysis. For this, it is proposed to use a variable quantization step, which is adaptively selected for each block of the JPEG cover image. The experimental results demonstrate an increase in the security level of steganographic embedding due to the application of the proposed approach.

scholarly journals Visual Cryptography Using Binary Amplitude-Only Holograms [Invited]

2022 ◽  
Vol 2 ◽  
Author(s):  
Lina Zhou ◽  
Yin Xiao ◽  
Zilan Pan ◽  
Yonggui Cao ◽  
Wen Chen
Keyword(s):  
Visual Cryptography ◽  
Human Vision ◽  
Pixel Expansion ◽  
Secret Image ◽  
Secret Information

Visual cryptography (VC) is developed to be a promising approach to encoding secret information using pixel expansion rules. The useful information can be directly rendered based on human vision without the usage of decryption algorithms. However, many VC schemes cannot withstand occlusion attacks. In this paper, a new VC scheme is proposed using binary amplitude-only holograms (AOHs) generated by a modified Gerchberg-Saxton algorithm (MGSA). During the encryption, a secret image is divided into a group of unrecognizable and mutually-unrelated shares, and then the generated shares are further converted to binary AOHs using the MGSA. During image extraction, binary AOHs are logically superimposed to form a stacked hologram, and then the secret image can be extracted from the stacked hologram. Different from conventional VC schemes, the proposed VC scheme converts a secret image into binary AOHs. Due to the redundancy of the generated binary AOHs, the proposed method is numerically and experimentally verified to be feasible and effective, and possesses high robustness against occlusion attacks.

scholarly journals Embedding with Pca Based Svd Framelet Transform with Visual Cryptography In Video

2019 ◽  
Vol 8 (11) ◽  
pp. 1752-1757
Keyword(s):  
Digital Watermarking ◽  
Visual Cryptography ◽  
Principal Component ◽  
Computational Time ◽  
Video Frame ◽  
Secret Message ◽  
Main Task ◽  
Wavelet Coefficients ◽  
Stego Image ◽  
Secret Information

The goal of watermarking or steganography is not to restrict access to the original image, to ensure that embedded data remain recoverable. Digital watermarking is a technique providing embedded secure information in images, digital watermarking is the process of inserting data into an image in a way that it can be used to make an assertion about the image. But the proposed system studies a comprehensive approach of embedding secret information inside the video. A hybrid video steganographic scheme based on Framelet transform (FT) with Principal Component Analysis (PCA) is introduced. The main purpose of using PCA is to reduce correlation among wavelet coefficients from wavelet decomposition of each video frame. Using this decomposition, the secret message can be dispersed into the uncorrelated coefficients. Framelet transform helps to decompose video file into several frames. The secret message is embedded inside the principal components of low frequency wavelet coefficients. Achieving high bit rate data embedding is the main task. The proposed system is robust against numerous attacks like geometric attack, filtering, contrast adjustment. After embedding the secret information , (2,2_VSSS) as Visual cryptographic encryption is implemented to maintain the secrecy of this information against hackers.The main aim of this study is to obtain impercibility which is the human eye may not be able to detect differences between the original video and reconstructed image. Even after embedding, the quality of the stego image is good, which is proved by achieving better a PSNR value, and the stego image does not give much variation irrespective of different imaging conditions in the proposed VDWT mechanism. The proposed method achieves high PSNR than the existing methods, and nominal computational time is achieved for retrieving the secret information

scholarly journals (3, 3) Visual Cryptography for Online Certificate Authentication

2020 ◽  
Vol 9 (6) ◽  
pp. 152-156
Keyword(s):  
Academic Achievement ◽  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Message ◽  
Secret Sharing Scheme ◽  
Visual Secret Sharing ◽  
Job Interview ◽  
Sharing Scheme ◽  
Visual Cryptography Scheme ◽  
Full Proof

Today organizations face a challenge while recruiting candidates, who provide forged mark sheets in order to get a job. To prevent wrong hiring a detailed and thorough approach is needed to verify the authentication of both the candidate and the marks obtained by him/her. There are so many modern cryptographic protocols available which can be used for authenticating individual’s academic achievement certificates. Visual Cryptography is a simple and secure way to allow the secret sharing of images without any cryptographic computations or the use of encryption or decryption keys. The novelty of the visual secret sharing scheme is in its decryption process where human visual system (HVS) is employed for decryption of secret shares. In this paper we have discussed (3, 3) visual cryptography scheme which can be used to generate shares and distributes them among three parties, i.e. the Job Seeker, Certificate Issuance Authority and the Organization conducting Job interview. Secret message can be decrypted only if all the three shares are available. Every certificate carries a unique number which is encrypted using visual cryptography and without handshaking of all the parties it is impossible to decrypt, thus ensuring full proof authentication.

An Improved Size Invariant (n, n) Extended Visual Cryptography Scheme

2016 ◽  
Vol 12 (2) ◽  
pp. 80-88 ◽  
Author(s):  
Rahul Sharma ◽  
Nitesh Kumar Agrawal ◽  
Ayush Khare ◽  
Arup Kumar Pal
Keyword(s):  
Visual Cryptography ◽  
Visual Quality ◽  
Binary Image ◽  
Secret Message ◽  
Grayscale Image ◽  
Secret Image ◽  
Meaningful Shares ◽  
Connectivity Property ◽  
Visual Cryptography Scheme

In this paper, the authors have presented a (n, n) extended visual cryptography scheme where n numbers of meaningful shares furnish a visually secret message. Initially they have converted a grayscale image into binary image using dithering method. Afterwards, they have incorporated pixel's eight neighboring connectivity property of secret image during formation of meaningful shares. The scheme is able to generate the shares without extending its size. This approach has enhanced the visual quality of the recovered secret image from n numbers of shares. The scheme has been tested with some images and satisfactory results are achieved. The scheme has improved the contrast of the recovered secret image than a related (n, n) extended visual cryptography scheme.

Sign in / Sign up

Export Citation Format

Share Document