A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion
AbstractVisual 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 n ≥ k ≥ 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
Share & Cite This Article
Chen, Y.-Y.; Huang, B.-Y.; Juan, J.S.-T. A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion. Cryptography 2018, 2, 28.
Chen Y-Y, Huang B-Y, Juan JS-T. A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion. Cryptography. 2018; 2(4):28.Chicago/Turabian Style
Chen, Ying-Yu; Huang, Bo-Yuan; Juan, Justie S.-T. 2018. "A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion." Cryptography 2, no. 4: 28.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.