Sciweavers

10 search results - page 1 / 2
» Characterizing Ideal Weighted Threshold Secret Sharing
Sort
View
TCC
2005
Springer
141views Cryptology» more  TCC 2005»
13 years 10 months ago
Characterizing Ideal Weighted Threshold Secret Sharing
Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret sharing. In such settings, there is a set of users where each user is assigned a positive w...
Amos Beimel, Tamir Tassa, Enav Weinreb
TCC
2010
Springer
176views Cryptology» more  TCC 2010»
14 years 1 months ago
Ideal Hierarchical Secret Sharing Schemes
The search of efficient constructions of ideal secret sharing schemes for families of nonthreshold access structures that may have useful applications has attracted a lot of atten...
Oriol Farràs, Carles Padró
SPW
1997
Springer
13 years 8 months ago
On Ideal Non-perfect Secret Sharing Schemes
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...
Pascal Paillier
COCO
2005
Springer
92views Algorithms» more  COCO 2005»
13 years 10 months ago
Monotone Circuits for Weighted Threshold Functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
Amos Beimel, Enav Weinreb
IPL
2006
86views more  IPL 2006»
13 years 4 months ago
Monotone circuits for monotone weighted threshold functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
Amos Beimel, Enav Weinreb