DECOMPOSITION CONSTRUCTIONS FOR SECRET-SHARING SCHEMES

Authors
STINSON DR
Citation
Dr. Stinson, DECOMPOSITION CONSTRUCTIONS FOR SECRET-SHARING SCHEMES, IEEE transactions on information theory, 40(1), 1994, pp. 118-125
Citations number
18
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
40
Issue
1
Year of publication
1994
Pages
118 - 125
Database
ISI
SICI code
0018-9448(1994)40:1<118:DCFSS>2.0.ZU;2-B
Abstract
The purpose of this paper is to describe a very powerful decomposition construction for perfect secret-sharing schemes. We give several appl ications of the construction and improve previous results by showing t hat for any graph G of maximum degree d, there is a perfect secret-sha ring scheme for G with information rate 2/(d + 1). As a corollary, the maximum information rate of secret-sharing schemes for paths on more than three vertices and for cycles on more than four vertices is shown to be 2/3.