Visual Cryptography

A special issue of Cryptography (ISSN 2410-387X).

Deadline for manuscript submissions: closed (31 August 2018) | Viewed by 13747

Special Issue Editor


E-Mail Website
Guest Editor
Department of Computer Science and Information Engineering, National Chiayi University, No.300 Syuefu Rd., Chiayi City 60004, Taiwan
Interests: information security; information hiding; multimedia security; digital rights management; security for wireless and mobile networks

Special Issue Information

Dear Colleagues,

Visual Cryptography (VC), one of the secret communication technologies, has drawn more and more attention from academia in the past two decades. VC, also called Visual Secret Sharing (VSS), aims to share a meaningful secret image with several participants by sharing noise-like sharing images and reconstructs the original secret by superimposing the pre-defined number of the qualified shared images. There are several main trends of improving VC techniques, to name a few: (1) visual quality; (2) pixel expansion; (3) friendliness; (4) cheating prevention; (5) multi-secret; (6) weight-based; and (7) general access structure. Furthermore, polynomial-based or Boolean-operation-based secret image sharing (SIS) schemes reconstruct lossless secret images by the Lagrange interpolation technique or light-weighted Boolean operations. The research of VC applications has also rapidly grown, such as (1) image encryption, (2) visual authentication, (3) image hiding, (4) digital watermarking, etc. This Special Issue will serve as an international forum for researchers of industries and academic institutions to share their experiences and most state-of-the-art research in the relevant fields.

Prof. Dr. Tzung-Her Chen
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Cryptography is an international peer-reviewed open access quarterly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Visual cryptography
  • Visual secret sharing
  • Secret sharing
  • Secret image sharing

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

19 pages, 6275 KiB  
Article
A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion
by Ying-Yu Chen, Bo-Yuan Huang and Justie Su-Tzu Juan
Cryptography 2018, 2(4), 28; https://doi.org/10.3390/cryptography2040028 - 27 Sep 2018
Cited by 4 | Viewed by 6443
Abstract
Visual cryptography (VC) encrypts a secret image into n shares (transparency). As such, we cannot see any information from any one share, and the original image is decrypted by stacking all of the shares. The general (k, n)-threshold secret sharing [...] Read more.
Visual cryptography (VC) encrypts a secret image into n shares (transparency). As such, we cannot see any information from any one share, and the original image is decrypted by stacking all of the shares. The general (k, n)-threshold secret sharing scheme (SSS) can similarly encrypt and decrypt the original image by stacking at least k (≤ n) shares. If one stack is fewer than k shares, the secret image is unrecognizable. Another subject is progressive visual secret sharing, which means that when more shares are progressively stacked, the combined share becomes clearer. In this study, we constructed an advanced scheme for (k, n)-threshold SSS that can be encrypted in VC for any positive integers nk ≥ 2 through the method of combination, and the size of each share is the same as that of the original image. That is, no pixel expansion is required. Our scheme is novel, and the results from the theoretical analysis and simulation reveal that our scheme exhibits favorable contrast to that of other related schemes. Full article
(This article belongs to the Special Issue Visual Cryptography)
Show Figures

Figure 1

11 pages, 3793 KiB  
Article
A New Visual Multi-Secrets Sharing Scheme by Random Grids
by Joy Jo-Yi Chang, Bo-Yuan Huang and Justie Su-Tzu Juan
Cryptography 2018, 2(3), 24; https://doi.org/10.3390/cryptography2030024 - 17 Sep 2018
Cited by 10 | Viewed by 6701
Abstract
In (2, 2)-visual secret sharing (VSS) schemes, a common type of (k, n)-threshold VSS schemes, secret information can be decoded directly through only two shares by using a human vision system. Several studies have analyzed methods of simplifying the decoding [...] Read more.
In (2, 2)-visual secret sharing (VSS) schemes, a common type of (k, n)-threshold VSS schemes, secret information can be decoded directly through only two shares by using a human vision system. Several studies have analyzed methods of simplifying the decoding process and refining encoding to pass more secret images through two identical shares. However, limited secret images are retrieved, and the quality of the recovered images is low. This paper proposes an advanced (2, 2)-VSS scheme that can embed N secret images into two rectangular shares. Compared with other related VSS schemes, more secret images can be encrypted and the distortion is adjustable in the proposed scheme, yielding more flexibility in theory and practice. Full article
(This article belongs to the Special Issue Visual Cryptography)
Show Figures

Figure 1

Back to TopTop