Strongbox secured secret sharing schemes

Seberry, J. and Street, A. P. (2000) Strongbox secured secret sharing schemes. Utilitas Mathematica, 57 147-163.

Author Seberry, J.
Street, A. P.
Title Strongbox secured secret sharing schemes
Journal name Utilitas Mathematica   Check publisher's open access policy
ISSN 0315-3681
Publication date 2000-01-01
Sub-type Article (original research)
Volume 57
Start page 147
End page 163
Total pages 17
Editor H. C. Swart
J. L. Allston
D. J. Street
M. A. Henning
Place of publication Durban, South Africa
Publisher University of Natal (Dept. of Maths & Appl. Maths)
Language eng
Subject C1
280405 Discrete Mathematics
230101 Mathematical Logic, Set Theory, Lattices And Combinatorics
780101 Mathematical sciences
Abstract We present one way in which combinatorial designs can be used to give conditionally perfect secret sharing schemes. Schemes formed in this way have the advantage over classical secret sharing schemes of being easily adapted for use as compartmentalized or hierarchical access structures. We study the problem of completion of structures, given partial information, to obtain measures of how closely the behaviour of the secret sharing schemes approaches to ideal behaviour in practice. It may happen that part of a combinatorial design can never be reconstructed from a subset of a minimal defining set. That is, to find the blocks of what is called the strongbox of a given minimal defining set of a design, we must have the whole of the minimal defining set and be able to complete the whole design. The strongbox is that part of the design which may most safely be used to hold secret information. We study the size of the strongbox.
Keyword Mathematics, Applied
Statistics & Probability
Combinatorial Designs
Minimal Defining Sets
Influence
Power
Nest
Strongbox
Secret Sharing
Access Schemes
Steiner Triple-systems
Smallest Defining Sets
Disjoint
Designs
Q-Index Code C1

Document type: Journal Article
Sub-type: Article (original research)
Collection: School of Physical Sciences Publications
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 7 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Tue, 10 Jun 2008, 20:30:51 EST