A secret sharing scheme is a method which allows a secret to be shared among a set of participants in such a way that only qualified subsets of participants can recover the secret. A secret sharing scheme is called perfect if unqualified subsets of participants obtain no information regarding the se
โฆ LIBER โฆ
Weighted decomposition construction for perfect secret sharing schemes
โ Scribed by Hung-Min Sun; Bor-Liang Chen
- Book ID
- 108458372
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 839 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Recursive constructions for perfect secr
โ
Hung-Min Sun; Shiuh-Pyng Shieh
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 595 KB
A General Decomposition Construction for
โ
Marten van Dijk; Wen-Ai Jackson; Keith M. Martin
๐
Article
๐
1998
๐
Springer
๐
English
โ 164 KB
New construction of perfect secret shari
โ
Hung-Min Sun
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 167 KB
An efficient construction of perfect sec
โ
Hung-Min Sun; Shiuh-Pyng Shieh
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 448 KB
A Linear Construction of Secret Sharing
โ
Marten van Dijk
๐
Article
๐
1997
๐
Springer
๐
English
โ 418 KB
An extended construction method for visu
โ
Taku Katoh; Hideki Imai
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 348 KB
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