40 search results - page 4 / 8 » Secret Sharing with Access Structures in a Hierarchy |
STOC
2000
ACM
13 years 10 months ago
2000
ACM
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...
INDOCRYPT
2003
Springer
14 years 3 days ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
TCC
2009
Springer
14 years 7 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...
CRYPTO
2005
Springer
14 years 13 days ago
2005
Springer
A black-box secret sharing scheme (BBSSS) for a given access structure works in exactly the same way over any finite Abelian group, as it only requires black-box access to group o...
CRYPTO
2005
Springer
14 years 13 days ago
2005
Springer
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...