A general (k, n) scalable secret image sharing scheme with the smooth scalability

Authors:
Ching-Nung Yang;Yu-Ying Chu
Affiliations:
Department of Computer Science and Information Engineering, National Dong Hwa University, # 1, Sec. 2, Da Hsueh Rd., Hualien, Taiwan;Department of Computer Science and Information Engineering, National Dong Hwa University, # 1, Sec. 2, Da Hsueh Rd., Hualien, Taiwan
Venue:
Journal of Systems and Software
Year:
2011

Citing 12
Cited 2

Security of ramp schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Nonperfect secret sharing schemes and matroids

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
How to share a secret

Communications of the ACM
Secret image sharing with steganography and authentication

Journal of Systems and Software
Secret image sharing with smaller shadow images

Pattern Recognition Letters
Scalable secret image sharing

Image Communication
Improvements of image sharing with steganography and authentication

Journal of Systems and Software
User-friendly image sharing using polynomials with different primes

International Journal of Imaging Systems and Technology
Sharing secrets in stego images with authentication

Pattern Recognition
Enhance the Image Sharing with Steganography and Authentication

IIH-MSP '08 Proceedings of the 2008 International Conference on Intelligent Information Hiding and Multimedia Signal Processing
Secret image sharing based on cellular automata and steganography

Pattern Recognition
An image-sharing method with user-friendly shadow images

IEEE Transactions on Circuits and Systems for Video Technology

Essential secret image sharing scheme with different importance of shadows

Journal of Visual Communication and Image Representation
Sharing more information in gray visual cryptography scheme

Journal of Visual Communication and Image Representation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel (k, n) scalable secret image sharing (SSIS) scheme was proposed to encrypt a secret image into n shadow images. One can gradually reconstruct a secret image by stacking k or more shadows, but he/she cannot conjecture any information from fewer than k shadows. The advantage of a (k, n)-SSIS scheme is that it provides the threshold property (i.e., k is a threshold value necessary to start in to reveal the secret) as well as the scalability (i.e., the information amount of a reconstructed secret is proportional to the number of shadows used in decryption). All previous (k, n)-SSIS schemes did not have the smooth scalability so that the information amount can be ''smoothly'' proportional to the number of shadows. In this paper, we consider the smooth scalability in (k, n)-SSIS scheme.