Sciweavers

118 search results - page 2 / 24
» Ideal Secret Sharing Schemes from Permutations
Sort
View
TCC
2005
Springer
141views Cryptology» more  TCC 2005»
14 years 25 days 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
COCOON
2005
Springer
14 years 27 days ago
Error-Set Codes and Related Objects
By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the errorcorrecting codes in the sense that the minimum dis...
An Braeken, Ventzislav Nikov, Svetla Nikova
DAM
2006
102views more  DAM 2006»
13 years 7 months ago
Secret sharing schemes on access structures with intersection number equal to one
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 ...
Jaume Martí-Farré, Carles Padr&oacut...
TCC
2004
Springer
164views Cryptology» more  TCC 2004»
14 years 21 days ago
Hierarchical Threshold Secret Sharing
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 ...
Tamir Tassa
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
14 years 1 months ago
On Secret Sharing Schemes, Matroids and Polymatroids
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...
Jaume Martí-Farré, Carles Padr&oacut...