Sciweavers

21 search results - page 3 / 5
» Ideal Hierarchical Secret Sharing Schemes
Sort
View
AINA
2004
IEEE
13 years 11 months ago
Secret Sharing with Access Structures in a Hierarchy
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
Chin-Chen Chang, Chu-Hsing Lin, Wei Lee, Pai-Cheng...
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
COCOON
2005
Springer
14 years 1 months 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
ESORICS
2008
Springer
13 years 9 months ago
Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs
Key agreement is a fundamental security functionality by which pairs of nodes agree on shared keys to be used for protecting their pairwise communications. In this work we study k...
Rosario Gennaro, Shai Halevi, Hugo Krawczyk, Tal R...
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 11 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...