An explication of secret sharing schemes
DR Stinson - Designs, Codes and Cryptography, 1992 - Springer
This paper is an explication of secret sharing schemes, emphasizing combinatorial
construction methods. The main problem we consider is the construction of perfect secret …
construction methods. The main problem we consider is the construction of perfect secret …
Decomposition constructions for secret-sharing schemes
DR Stinson - IEEE Transactions on Information Theory, 1994 - ieeexplore.ieee.org
The paper describes a very powerful decomposition construction for perfect secret-sharing
schemes. The author gives several applications of the construction and improves previous …
schemes. The author gives several applications of the construction and improves previous …
On the information rate of perfect secret sharing schemes
M Van Dijk - Designs, codes and cryptography, 1995 - Springer
In this paper, information rates of perfect secret sharing schemes are studied, in particular
schemes based on connected graphs on six vertices. We discuss a method to derive …
schemes based on connected graphs on six vertices. We discuss a method to derive …
Graph decompositions and secret sharing schemes
In this paper we continue a study of secret sharing schemes for-access structures based on
graphs. Given a graph G, we require that a subset of participants can compute a secret key if …
graphs. Given a graph G, we require that a subset of participants can compute a secret key if …
[图书][B] Applications of combinatorial designs to communications, cryptography, and networking
CJ Colbourn, JH Dinitz, DR Stinson - 1999 - Citeseer
Combinatorial designs have long had substantial application in the statistical design of
experiments, and in the theory of error-correcting codes. Applications in experimental and …
experiments, and in the theory of error-correcting codes. Applications in experimental and …
A construction of practical secret sharing schemes using linear block codes
M Bertilsson, I Ingemarsson - … in Cryptology—AUSCRYPT'92: Workshop on …, 1993 - Springer
In this paper we address the problem of constructing secret sharing schemes for general
access structures. The construction is inspired by linear block codes. Already in the …
access structures. The construction is inspired by linear block codes. Already in the …
Characterizing ideal weighted threshold secret sharing
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret
sharing. In such settings, there is a set of users where each user is assigned a positive …
sharing. In such settings, there is a set of users where each user is assigned a positive …
A unified approach to combinatorial key predistribution schemes for sensor networks
MB Paterson, DR Stinson - Designs, codes and cryptography, 2014 - Springer
There have been numerous recent proposals for key predistribution schemes for wireless
sensor networks based on various types of combinatorial structures such as designs and …
sensor networks based on various types of combinatorial structures such as designs and …
[PDF][PDF] Secret sharing schemes with applications in security protocols.
S Iftene - Sci. Ann. Cuza Univ., 2006 - Citeseer
A secret sharing scheme starts with a secret and then derives from it certain shares (or
shadows) which are distributed to users. The secret may be recovered only by certain …
shadows) which are distributed to users. The secret may be recovered only by certain …
Fully dynamic secret sharing schemes
We consider secret sharing schemes in which the dealer has the feature of being able (after
a preprocessing stage) to activate a particular access structure out of a given set and/or to …
a preprocessing stage) to activate a particular access structure out of a given set and/or to …