Sciweavers

35 search results - page 1 / 7
» Strongly secure ramp secret sharing schemes for general acce...
Sort
View
IPL
2006
87views more  IPL 2006»
13 years 5 months ago
Strongly secure ramp secret sharing schemes for general access structures
Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly...
Mitsugu Iwamoto, Hirosuke Yamamoto
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
13 years 10 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 ...
TIT
2008
147views more  TIT 2008»
13 years 5 months ago
On Codes, Matroids, and Secure Multiparty 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, the connections between codes, matroids, and a special cla...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
INDOCRYPT
2003
Springer
13 years 10 months ago
On Multiplicative Linear Secret Sharing Schemes
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 ...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
EUROCRYPT
2000
Springer
13 years 8 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) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer