Secret sharing schemes based on combinatorial designs
โ Scribed by Youjin Song; Kaoru Kurosawa; Takashi Satoh; Shigeo Tsujii
- Book ID
- 112079845
- Publisher
- John Wiley and Sons
- Year
- 1995
- Tongue
- English
- Weight
- 420 KB
- Volume
- 78
- Category
- Article
- ISSN
- 1042-0967
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In a perfect secret sharing scheme, it holds that log, I%[ > H(S), where S denotes the secret and G denotes the set of the share of user i. On the other hand, it is well known that log213 > H(S) if S is not uniformly distributed, where ? denotes the set of secrets. In this case, log, @I > H(S) < log
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.