Combinatorial designs: constructions and analysis
DR Stinson - ACM SIGACT News, 2008 - dl.acm.org
The origins of combinatorial design theory lie within recreational mathematics. With the work
of Fisher and Yates in the 1930s it began to take on the character of a serious academic …
of Fisher and Yates in the 1930s it began to take on the character of a serious academic …
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 …
The access structure of some secret-sharing schemes
A Renvall, C Ding - Information Security and Privacy: First Australasian …, 1996 - Springer
In this paper, we determine the access structure of a number of secret-sharing schemes that
are based on error-correcting linear codes with respect to two approaches. Some secret …
are based on error-correcting linear codes with respect to two approaches. Some secret …
On unconditionally secure distributed oblivious transfer
This paper is about the oblivious transfer in the distributed model proposed by Naor and
Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one of them …
Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one of them …
Bounds for the minimum distance and covering radius of orthogonal arrays via their distance distributions
S Boumova, P Boyvalenkov… - 2022 10th International …, 2022 - ieeexplore.ieee.org
We study the packing and covering properties of orthogonal arrays (OAs) as we propose
new approaches for obtaining estimations on the minimum distance and covering radius of …
new approaches for obtaining estimations on the minimum distance and covering radius of …
[PS][PS] Bibliography on secret sharing schemes
DR Stinson, R Wei - 1998 - cacr.uwaterloo.ca
In the late 1980's, Gus Simmons compiled a bibliography of papers on secret sharing
schemes. As far as we know, the most recent version of his bibliography was published in …
schemes. As far as we know, the most recent version of his bibliography was published in …
[PDF][PDF] Combinatorial models for perfect secret sharing schemes
WA Jackson, KM Martin - Journal of Combinatorial Mathematics …, 1998 - esat.kuleuven.be
In this paper we review combinatorial models for secret sharing schemes. A detailed
comparison of several existing combinatorial models for secret sharing sharing schemes is …
comparison of several existing combinatorial models for secret sharing sharing schemes is …
[HTML][HTML] Ideal ramp schemes and related combinatorial objects
DR Stinson - Discrete Mathematics, 2018 - Elsevier
Abstract In 1996, Jackson and Martin (Jackson and Martin, 1996) proved that a strong ideal
ramp scheme is equivalent to an orthogonal array. However, there was no good …
ramp scheme is equivalent to an orthogonal array. However, there was no good …
[PDF][PDF] Applications of orthogonal arrays to computer science
K Gopalakrishnan, DR Stinson, D Cheriton - Proc. of ICDM, 2006 - cs.uwaterloo.ca
Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisticians
motivated by their applications to design of experiments. In recent years, they have found …
motivated by their applications to design of experiments. In recent years, they have found …
A simple combinatorial treatment of constructions and threshold gaps of ramp schemes
MB Paterson, DR Stinson - Cryptography and Communications, 2013 - Springer
We give easy proofs of some recent results concerning threshold gaps in ramp schemes. We
then generalise a construction method for ramp schemes employing error-correcting codes …
then generalise a construction method for ramp schemes employing error-correcting codes …