Abstract
In this paper we address the problem of constructing secret sharing schemes for general access structures. The construction is inspired by linear block codes. Already in the beginning of the eighties constructions of threshold schemes using linear block codes were presented in [6] and [7]. In this paper we generalize those results to construct secret sharing schemes for arbitrary access, structure. We also present a solution to the problem of retrieving the secret.
Cite
CITATION STYLE
Bertilsson, M., & Ingemarsson, I. (1993). A construction of practical secret sharing schemes using linear block codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 718 LNCS, pp. 67–79). Springer Verlag. https://doi.org/10.1007/3-540-57220-1_53
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
