Abstract: This document provides the basic concept of Secret Sharing technique in practice. Main overview of some current secret sharing schemes are discussed according to the papers, provided during the course. Future scope and possibilities of secret sharing schemes are also introduced. 1

. A secret sharing scheme allows to share a secret among several participants such that only certain groups of them can recover it. Verifiable secret sharing has been proposed to achieve security against cheating participants. Its first realization had the special property that everybody, not only

Secret Sharing from the perspective of threshold schemes has been well-studied over the past decade. Threshold schemes, however, can only handle a small fraction of the secret sharing functions which we may wish to form. For example, if it is desirable to divide a secret among four participants A

Secret sharing • Method for dividing a secret S into n pieces of information (shares or shadows) s1, s2,..., sn, where each si does not reveal anything about S. • The shares can be distributed among a group of participants or kept by a single person (depending on the purpose of the computation

In this paper we study anonymous secret sharing schemes. Informally, in an anonymous secret sharing scheme the secret can be reconstructed without knowledge of which participants hold which shares. In such schemes the computation of the secret can be carried out by giving the shares to a black box

time for all neighbors m of j and hence Zj will become (S + 1). Since j has no nodes at hop-distance (S + l), (7) will hold and this completes the proof of the lemma. Lemma MH-1 a) and Lemma MH-2 a), b) are exactly Theorem MH-1 and this completes the proof of the theo-rem. REFERENCES [ 1] R. G. Gallager, “A shortest path routing algorithm with automatic resynch, ” unpublished note, March 1976. [2] A. Segall, P. M. Merlin, and R. G. Gallager, “A recoverable protocol for loop-free distributed routing, ” Proc. ICC, June 1978. [3] S. G. Finn, “Resynch procedures and a failsafe network protocol

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

A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any non-qualified subset has absolutely no information on the secret. The set of all qualified subsets defines the access structure

Abstract. A well-known fact in the theory of secret sharing schemes is that shares must be of length at least as the secret itself. However, the proof of this lower bound uses the notion of information theoretic secrecy. A natural (and very practical) question is whether one can do better

We consider the problem of secret sharing among n rational players. This problem was introduced by Halpern and Teague (STOC 2004), who claim that a solution is impossible for n = 2 but show a solution for the case n >= 3. Contrary to their claim, we show a protocol for rational secret sharing