The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
We consider a visual secret sharing scheme with cyclic access structure for n secret images and n shares, where two consecutive shares decode one secret image. This secret sharing ...
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...
—We suggest a method of controlling the access to a secure database via quorum systems. A quorum system is a collection of sets (quorums) every two of which have a nonempty inter...
The search of efficient constructions of ideal secret sharing schemes for families of nonthreshold access structures that may have useful applications has attracted a lot of atten...