𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New combinatorial designs and their applications to authentication codes and secret sharing schemes

✍ Scribed by Wakaha Ogata; Kaoru Kurosawa; Douglas R. Stinson; Hajime Saido

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
306 KB
Volume
279
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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. Then we give a new bound on the number of shares required in robust secret sharing schemes (i.e., schemes secure against cheaters). EDF can be used to construct robust secret sharing schemes that are optimal with respect to the new bound. We also prove a weak converse, showing that if there exists an optimal secret sharing scheme, then there exists an EBIBD. Finally, we derive a Fisher-type inequality for splitting BIBDs. We also prove a weak equivalence between splitting BIBDs and splitting A-codes. Further, it is shown that an EDF implies a splitting BIBD.

πŸ“œ SIMILAR VOLUMES

A problem of combinatorial designs relat
A problem of combinatorial designs related to authentication codes
✍ Dingyi Pei πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 433 KB πŸ‘ 2 views

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially

Pseudo quasi-3 designs and their applica
Pseudo quasi-3 designs and their applications to coding theory
✍ Carl Bracken πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 94 KB

## Abstract We define a pseudo quasi‐3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi‐symmetric. Quasi‐symmetric designs can be used to construct optimal self complementary codes. In this article we give a constructi