๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Constructions for Anonymous Secret Sharing Schemes Using Combinatorial Designs

โœ Scribed by Ying-pu Deng; Li-feng Guo; Mu-lan Liu

Book ID
106301197
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2007
Tongue
English
Weight
183 KB
Volume
23
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Recursive constructions for perfect secr
Recursive constructions for perfect secret sharing schemes
โœ Hung-Min Sun; Shiuh-Pyng Shieh ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 595 KB

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

Combinatorial lower bounds for secret sh
Combinatorial lower bounds for secret sharing schemes
โœ Kaoru Kurosawa; Koji Okada ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB

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

New combinatorial designs and their appl
New combinatorial designs and their applications to authentication codes and secret sharing schemes
โœ Wakaha Ogata; Kaoru Kurosawa; Douglas R. Stinson; Hajime Saido ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

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.