Results 11  20
of
3,488
Secret Sharing and Secure . . .
, 2007
"... This thesis explores the different secret sharing schemes from the 1970s until today. We present the schemes and provide descriptions and examples on how they work. More time is devoted to exploring monotone span programs, a generalisation of secret sharing schemes, as these are the building blocks ..."
Abstract
 Add to MetaCart
This thesis explores the different secret sharing schemes from the 1970s until today. We present the schemes and provide descriptions and examples on how they work. More time is devoted to exploring monotone span programs, a generalisation of secret sharing schemes, as these are the building blocks
Mobile Proactive Secret Sharing
, 2007
"... This thesis describes mobile proactive secret sharing (MPSS), an extension of proactive secret sharing. Mobile proactive secret sharing is much more flexible than proactive secret sharing in terms of group membership: instead of the group of shareholders being exactly the same from one epoch to the ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
This thesis describes mobile proactive secret sharing (MPSS), an extension of proactive secret sharing. Mobile proactive secret sharing is much more flexible than proactive secret sharing in terms of group membership: instead of the group of shareholders being exactly the same from one epoch
Online Secret Sharing
 In Proc. of the 5th IMA Conf. on Cryptography and Coding
, 1995
"... . We propose a new construction for computationally secure secret sharing schemes with general access structures where all shares are as short as the secret. Our scheme provides the capability to share multiple secrets and to dynamically add participants online, without having to redistribute new ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
. We propose a new construction for computationally secure secret sharing schemes with general access structures where all shares are as short as the secret. Our scheme provides the capability to share multiple secrets and to dynamically add participants online, without having to redistribute new
Minimal Codewords and Secret Sharing
 Proceedings of the 6th Joint SwedishRussian International Workshop on Information Theory
, 1993
"... : The use of a linear code to "split" secrets into equalsize shares is considered. The determination of which sets of shares can be used to obtain the secret leads to the apparently new notion of minimal codewords in a linear code. It is shown that the minimal codewords in the dual code c ..."
Abstract

Cited by 51 (1 self)
 Add to MetaCart
: The use of a linear code to "split" secrets into equalsize shares is considered. The determination of which sets of shares can be used to obtain the secret leads to the apparently new notion of minimal codewords in a linear code. It is shown that the minimal codewords in the dual code
On secret sharing for graphs
"... In the paper we discuss how to share the secrets, that are graphs. So, far secret sharing schemes were designed to work with numbers. As the first step, we propose conditions for “graph to number ” conversion methods. Hence, the existing schemes can be used, without weakening their properties. Next, ..."
Abstract
 Add to MetaCart
In the paper we discuss how to share the secrets, that are graphs. So, far secret sharing schemes were designed to work with numbers. As the first step, we propose conditions for “graph to number ” conversion methods. Hence, the existing schemes can be used, without weakening their properties. Next
Visual Secret Sharing
, 2000
"... Secret sharing schemes are briey discussed to introduce the topic of secrect sharing. Visual secret sharing is examined, including Naor and Shamir's basic twocolor visual secret sharing schemes. Several extensions to the basic model are observed, including proposals by Naor and Shamir for gray ..."
Abstract
 Add to MetaCart
Secret sharing schemes are briey discussed to introduce the topic of secrect sharing. Visual secret sharing is examined, including Naor and Shamir's basic twocolor visual secret sharing schemes. Several extensions to the basic model are observed, including proposals by Naor and Shamir
Cheating Immune Secret Sharing
, 2001
"... We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., = 1 n 2 n P n c=1 P 2Vn ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., = 1 n 2 n P n c=1 P 2Vn
ARCHIVES Rational Secret Sharing
, 2008
"... Recent work has attempted to bridge the fields of Cryptography and Game Theory in order to create more robust protocols that allow for a variety of player types. A keystone functionality used in cryptography is Secret Sharing. While there are several well known, efficient protocols that implement Se ..."
Abstract
 Add to MetaCart
Recent work has attempted to bridge the fields of Cryptography and Game Theory in order to create more robust protocols that allow for a variety of player types. A keystone functionality used in cryptography is Secret Sharing. While there are several well known, efficient protocols that implement
Hierarchical threshold secret sharing
 J. Cryptol
, 2007
"... We consider the problem of threshold secret sharing in groups with hierarchical structure. In such settings, the secret is shared among a group of participants that is partitioned into levels. The access structure is then determined by a sequence of threshold requirements: a subset of participants i ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
We consider the problem of threshold secret sharing in groups with hierarchical structure. In such settings, the secret is shared among a group of participants that is partitioned into levels. The access structure is then determined by a sequence of threshold requirements: a subset of participants
Quantum secret sharing,
 Physical Review A,
, 1999
"... Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using GreenbergerHorneZeilinger ͑GHZ͒ states. In the quantum case the presence of an eavesdrop ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using GreenbergerHorneZeilinger ͑GHZ͒ states. In the quantum case the presence
Results 11  20
of
3,488