225 search results - page 3 / 45 » Weakly-Private Secret Sharing Schemes |
ASIACRYPT
1992
Springer
13 years 9 months ago
1992
Springer
: Nonperfect secret sharing schemes NSSs have an advantage such that the size of shares can be shorter than that of perfect secret sharing schemes. This paper shows some basic prop...
DAM
2002
13 years 5 months ago
2002
In anonymous secret sharing schemes, the secret can be reconstructed without knowledge of which participants hold which shares. In this paper, we derive a tighter lower bound on t...
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...
CANS
2008
Springer
13 years 7 months ago
2008
Springer
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direction, this paper presents a novel approach t...