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 …

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 …

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 …

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 …

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 …

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 …

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 …

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 …

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 …

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 …