Further Results on Strongbox Secured Secret Sharing Schemes

G. Gamble, Curtin University of Technology
B. M. Maenhaut, University of Queensland
J. Seberry, University of Wollongong
A. Penfold Street, University of Queensland

Article comments

This article was originally published as Gamble, G, Maenhaut, B, Seberry, J and Penfold Street, A, Further Results on Strongbox Secured Secret Sharing Schemes, Utilitas Mathematica, 66, 2004, 187-215.

Abstract

We extend our earlier work on ways in which defining sets of combinatorial designs can be used to create secret sharing schemes. We give an algorithm for classifying defining sets of designs according to their security properties and summarise the results of this algorithm for many small designs. Finally, we discuss briefly how defining sets can be applied to variations of the basic secret sharing scheme.