Multi-layer Progressive Secret Image Sharing
نویسنده
چکیده
This paper proposes a special type secret image sharing method. Based on the theories of secret image sharing and frequency domain transform, a multi-threshold secret image sharing is achieved. The method contains more properties compared with conventional secret image sharing which just has only one threshold. The properties of the proposed method include fault tolerance, small size of shares, secure, multi-threshold and progressive transmission. The method not only has the advantages of conventional secret image sharing, but also is more flexible. Users can set several thresholds in the method. When the number of shares is less than the smallest threshold, no secret will be revealed. While the numbers of shares collected are more than smallest threshold, a low quality secret image will be revealed. The quality of recovered secret image will be better after collecting more shares. When the amount of shares is over the maximum threshold, the recovered secret image is the same as the original secret image. Key-Words: Secret sharing, Progressive, Share, Fault-tolerance, Threshold, Transmission
منابع مشابه
Computationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملSharing several secrets based on Lagrange's interpolation formula and Cipher feedback mode
In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcip...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملA Visual Cryptography based system for sharing multiple secret images
A Visual Cryptography (VC)-based system for sharing multiple secret images is proposed. Several weighted transparencies are generated so that people can reveal multiple secret images by stacking qualified subsets of some transparencies together. The transparency with relatively larger weight decides which secret image will be revealed. The proposed method has the following characteristics: deco...
متن کامل