A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion
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...
Main Authors: | Ying-Yu Chen, Bo-Yuan Huang, Justie Su-Tzu Juan |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-09-01
|
Series: | Cryptography |
Subjects: | |
Online Access: | http://www.mdpi.com/2410-387X/2/4/28 |
Similar Items
-
Fault-Tolerant Visual Secret Sharing Schemes without Pixel Expansion
by: Justie Su-Tzu Juan, et al.
Published: (2016-01-01) -
A Linear Algebraic Threshold Essential Secret Image Sharing Scheme
by: Alazemi, A., et al.
Published: (2022) -
Weighted Secret Image Sharing for a <inline-formula> <tex-math notation="LaTeX">$(k,n)$ </tex-math></inline-formula> Threshold Based on the Chinese Remainder Theorem
by: Longdan Tan, et al.
Published: (2019-01-01) -
Threshold Visual Cryptography Schemes With Tagged Shares
by: Pei-Ling Chiu, et al.
Published: (2020-01-01) -
Secret Image Sharing Based on Encrypted Pixels
by: Zhili Zhou, et al.
Published: (2018-01-01)