Sciweavers

Share
EUROCRYPT
2000
Springer

General Secure Multi-party Computation from any Linear Secret-Sharing Scheme

10 years 6 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
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) for the players, provided that the access structure of the LSSS allows MPC or VSS at all. Because an LSSS neither guarantees reconstructability when some shares are false, nor verifiability of a shared value, nor allows for the multiplication of shared values, an LSSS is an apparently much weaker primitive than VSS or MPC. Our approach to secure MPC is generic and applies to both the information-theoretic and the cryptographic setting. The construction is based on 1) a formalization of the special multiplicative property of an LSSS that is needed to perform a multiplication on shared values, 2) an efficient generic construction to obtain from any LSSS a multiplicative LSSS for the same access structure, and 3) an efficient generic construction to build verifiability into every LSSS (always assuming that the ad...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where EUROCRYPT
Authors Ronald Cramer, Ivan Damgård, Ueli M. Maurer
Comments (0)
books