@inproceedings{c80d4eca84984c3fa3473f3460b749b4,
title = "A linear construction of perfect secret sharing schemes",
abstract = "In this paper, we generalize the vector space construction due to Brickell [5]. This generalization, introduced by Bertilsson [1], leads to perfect secret sharing schemes with rational information rates in which the secret can be computed efficiently by each qualified group. A one to one correspondence between the generalized construction and linear block codes is stated. It turns out that the approach of minimal codewords by Massey [15] is a special case of this construction. For general access structures we present an outline of an algorithm for determining whether a rational number can be realized as information rate by means of the generalized vector space construction. If so, the algorithm produces a perfect secret sharing scheme with this information rate. As a side-result we show a correspondence between the duality of access structures and the duality of codes.",
author = "{Dijk, van}, M.",
year = "1995",
doi = "10.1007/BFb0053421",
language = "English",
isbn = "3-540-60176-7",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "23--34",
editor = "{Santis, De}, A.",
booktitle = "Advances in Cryptology - EUROCRYPT'94 (Proceedings Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994)",
address = "Germany",
}