Further results on strongbox secured secret sharing schemes

Gamble, G, Maenhaut, BM, Seberry, J and Street, AP (2004) Further results on strongbox secured secret sharing schemes. Utilitas Mathematica, 66 165-193.

Author Gamble, G
Maenhaut, BM
Seberry, J
Street, AP
Title Further results on strongbox secured secret sharing schemes
Journal name Utilitas Mathematica   Check publisher's open access policy
ISSN 0315-3681
Publication date 2004-01-01
Sub-type Article (original research)
Volume 66
Start page 165
End page 193
Total pages 29
Editor R.G. Stanton
J.L. Allston
Place of publication Canada
Publisher Utilitas Mathematica Publishing Inc.
Language eng
Subject C1
230101 Mathematical Logic, Set Theory, Lattices And Combinatorics
780101 Mathematical sciences
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 or 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.
Keyword Statistics & Probability
Combinatorial Designs
Defining Sets
Information Content
Influence
Power
Nest
Strongbox
Secret Sharing
Access Schemes
Designs
Mathematics, Applied
Q-Index Code C1

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 3 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Wed, 15 Aug 2007, 13:26:25 EST