80 search results - page 1 / 16 » General Secure Multi-party Computation from any Linear Secre... |
55
Voted
EUROCRYPT
2000
Springer
14 years 2 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...
CRYPTO
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...
INDOCRYPT
2003
Springer
14 years 4 months 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 ...
ASIACRYPT
2008
Springer
14 years 1 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...
TIT
2008
13 years 11 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...