35 search results - page 2 / 7 » On the bound for anonymous secret sharing schemes |
SPW
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. This paper first extends the result of Blakley and Kabatianski [3] to general non-perfect SSS using information-theoretic arguments. Furthermore, we refine Okada and Ku...
CRYPTO
2012
Springer
11 years 7 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
DAM
2006
13 years 5 months ago
2006
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
TCC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secr...