in a proxy multi-signature, the proxy signer can sign a message on behalf of more than one original signer. However, in some cases, the proxy or the original signers do not want to leak the proxy signer's identity. In addition, when something is wrong with the signed message, the identity of the proxy signer has to be revealed. So the problem of anonymous but accountable has been proposed. Usin...

The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing. The restriction of regular mappings to permutations gives a convenient tool for investigation of the relation between permutations and ideal secret sharing generated by them.

In this paper we introduce the class of composite access structures for secret sharing. We also provide secret sharing schemes realizing these structures and study their information rates. As a particular case of this construction, we present the subclass of iterated threshold schemes, a large class of ideal secret sharing schemes.

Ignacio Cascudo Secret sharing schemes with algebraic properties and...

In this paper, we describe secret sharing schemes. We discuss Room squares and their critical sets. We propose a model of secret sharing based on critical sets of Room squares.

In this paper, we propose a new (t, n) threshold scheme. The scheme allows a user to divide portions of a secret among the designated group. Any t or more participants from a designated group of n members can cooperate to reconstruct the secret while (t−1) or less participants can not. Furthermore, the scheme provides an efficient mechanism to detect and identify cheaters. From the security ana...

A secret sharing scheme is a protocol by means of which a dealer distributes a secret s among a set of participants P in such a way that only qualiied subsets of P can reconstruct the value of s whereas any other subset of P; non-qualiied to know s; cannot determine anything about the value of the secret. In this paper we provide a general technique to prove upper bounds on the information rate...

Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention ...

When a shadow of a threshold scheme is publicized, new shadows have to be reconstructed and redistributed in order to maintain the same level of security. In this paper we consider threshold schemes with disenrollment capabilities where the new shadows can be created by broadcasts through a public channel. We establish a lower bound on the size of each shadow in a scheme that allows L disenroll...