Further results on strongbox secured secret sharing schemes

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 arid 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. Combinatorial designs, defining sets, information content, influence, power, nest, strongbox, secret, sharing, access schemes.