Sciweavers

92 search results - page 2 / 19
» Efficient Secret Sharing with Access Structures in a Hierarc...
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 9 months ago
On the complexity of verifiable secret sharing and multiparty computation
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...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
TCC
2009
Springer
151views Cryptology» more  TCC 2009»
14 years 5 months ago
Secret Sharing and Non-Shannon Information Inequalities
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...
Amos Beimel, Ilan Orlov
EUROCRYPT
2000
Springer
13 years 9 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
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
JCM
2007
82views more  JCM 2007»
13 years 5 months ago
Secret Sharing Schemes With General Access Structure Based On MSPs
— In this paper we introduce two operations of access structure to build large monotone span programs MSPs from small MSPs. Furthermore, we point out a new method of constructing...
Jun Xu, Xiaomin Zha