Next Article in Journal
Pairing Free Identity-Based Blind Signature Scheme with Message Recovery
Previous Article in Journal
Improving Performance and Mitigating Fault Attacks Using Value Prediction
Previous Article in Special Issue
A New Visual Multi-Secrets Sharing Scheme by Random Grids
Article Menu

Export Article

Open AccessFeature PaperArticle
Cryptography 2018, 2(4), 28; https://doi.org/10.3390/cryptography2040028

A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion

Department of Computer Science and Information Engineering, National Chi Nan University, Nantou 54561, Taiwan
*
Author to whom correspondence should be addressed.
Received: 31 August 2018 / Revised: 22 September 2018 / Accepted: 25 September 2018 / Published: 27 September 2018
(This article belongs to the Special Issue Visual Cryptography)
Full-Text   |   PDF [6275 KB, uploaded 29 September 2018]   |  

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 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. View Full-Text
Keywords: visual cryptography; (k, n)-threshold; secret sharing; progressive; information security visual cryptography; (k, n)-threshold; secret sharing; progressive; information security
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Chen, Y.-Y.; Huang, B.-Y.; Juan, J.S.-T. A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion. Cryptography 2018, 2, 28.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Cryptography EISSN 2410-387X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top