Skip to main content
placeholder image

Further results on strongbox secured secret sharing schemes

Journal Article


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.

Publication Date


  • 2004

Citation


  • Gamble, G., Maenhaut, B. M., Seberry, J., & Street, A. P. (2004). Further results on strongbox secured secret sharing schemes. Utilitas Mathematica, 66, 165-193.

Scopus Eid


  • 2-s2.0-13244260838

Web Of Science Accession Number


Start Page


  • 165

End Page


  • 193

Volume


  • 66

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.

Publication Date


  • 2004

Citation


  • Gamble, G., Maenhaut, B. M., Seberry, J., & Street, A. P. (2004). Further results on strongbox secured secret sharing schemes. Utilitas Mathematica, 66, 165-193.

Scopus Eid


  • 2-s2.0-13244260838

Web Of Science Accession Number


Start Page


  • 165

End Page


  • 193

Volume


  • 66