In modern cryptography, the secret sharing scheme is an important cryptographic primitive and it is used in various situations. In this paper, a timed-release secret sharing scheme (TR-SS) with information-theoretic security is first studied. TRSS is a secret sharing scheme with the property that participants more than a threshold number can reconstruct a secret by using their shares only when ...

We present a new robust proactive (and threshold) RSA signature scheme secure with the optimal threshold of t < n/2 corruptions. The new scheme offers a simpler alternative to the best previously known (static) proactive RSA scheme given by Tal Rabin [36], itself a simplification over the previous schemes given by Frankel et al. [18, 17]. The new scheme is conceptually simple because all the sh...

Since 1979 when threshold schemes were introduced by Blakley (Bla79) and Shamir (Sha79), many papers in this area have been published. These papers are mostly about particular designs and applications of threshold schemes. In this work, we are interested in characterisations of ideal threshold schemes rather than particular constructions. Of course, these characteristic properties do not depend...

While classically cryptography is concerned with the problem of private communication among two entities, say players, in modern cryptography multi-player protocols play an important role. And among these, it is probably fair to say that secret sharing, and its stronger version verifiable secret sharing (VSS), as well as multi-party computation (MPC) belong to the most appealing and/or useful o...

In this paper we study the amount of secret information that must be given to participants in any secret sharing scheme that is secure against coalitions of dishonest participants in the model of Tompa and Woll 20]. We show that any (k; n) threshold secret sharing algorithm in which any coalition of less than k participants has probability of successful cheating less than some > 0 it must give ...