35 search results - page 3 / 7 » On the bound for anonymous secret sharing schemes |
66
Voted
FFA
2010
14 years 8 months ago
2010
We develop new coset bounds for algebraic geometric codes. The bounds have a natural interpretation as an adversary threshold for algebraic geometric secret sharing schemes and le...
EUROCRYPT
2005
Springer
15 years 3 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
106
Voted
ICITS
2009
14 years 7 months ago
2009
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
74
Voted
ASIACRYPT
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...