24 search results - page 1 / 5 » On Codes, Matroids, and Secure Multiparty Computation From L... |
CRYPTO
2005
Springer
13 years 9 months 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...
TIT
2008
13 years 4 months ago
2008
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
STOC
2000
ACM
13 years 7 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...