A visual secret sharing scheme permits a secret to be shared among participants using transparencies. In this paper, we consider an extended scheme for visual secret sharing. We propose an improved method of constructing the visual secret sharing scheme that can conceal some images in a series of t
New visual secret sharing schemes using probabilistic method
β Scribed by Ching-Nung Yang
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 498 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In a key predistribution scheme a trusted authority distributes pieces of information among a set of users in such a way that speci ed privileged subsets of users can compute a secret key individually. In such a scheme, a family of forbidden subsets of users cannot obtain any information about the v
This paper introduces three new types of combinatorial designs, which we call external difference families (EDF), external BIBDs (EBIBD) and splitting BIBDs. An EDF is a special type of EBIBD, so existence of an EDF implies existence of an EBIBD. We construct optimal splitting A-codes by using EDF.
In this work, a renewable, multi-use, multi-secret sharing scheme for general access structure based on the one-way collision resistant hash function is presented in which each participant has to carry only one share. As it applies the collision resistant oneway hash function, the proposed scheme is
This paper discusses a method in which a wave source is visualized by electromagnetic wave holography by scanning the receiver antenna on a plane. The method presented in this paper does not use the Fresnel approximation or the Fraunhofer approximation, and there is no constraint on the distance bet