SECRET SHARING SCHEMES BASED ON COMBINATORIAL DESIGNS

Authors
SONG YJ KUROSAWA S SATOH T TSUJII S
Citation
Yj. Song et al., SECRET SHARING SCHEMES BASED ON COMBINATORIAL DESIGNS, Electronics and communications in Japan. Part 3, Fundamental electronic science, 78(10), 1995, pp. 20-26
Citations number
24
Categorie Soggetti
Engineering, Eletrical & Electronic
Journal title
Electronics and communications in Japan. Part 3, Fundamental electronic science → ACNP
ISSN journal
10420967
Volume
78
Issue
10
Year of publication
1995
Pages
20 - 26
Database
ISI
SICI code
1042-0967(1995)78:10<20:SSSBOC>2.0.ZU;2-U
Abstract
In secret-sharing schemes, a secret s is encoded as v(1), ..., v(n) an d v(i) is distributed to member P-i. By the access sets, we mean exact ly those subsets of {P-i} which can recover the secret s. Previous sec ret-sharing schemes have utilized the methods of polynomial interpolat ion [20] and projective geometry [6], among others. In this paper we s how how to obtain secret-sharing schemes from combinatorial designs, i ncluding orthogonal arrays (OAs) and t - (v, k, 1) designs.