10 search results - page 1 / 2 » Strong (n, t, n) verifiable secret sharing scheme |
ISCI
2010
13 years 3 months ago
2010
FCS
2006
13 years 6 months ago
2006
Secret sharing schemes are methods for distributing a secret among n participants in such a way that any qualified subsets of participants can recover the secret, and unqualified ...
CRYPTO
2009
Springer
13 years 9 months ago
2009
Springer
The round complexity of interactive protocols is one of their most important complexity measures. In this work we prove that existing lower bounds for the round complexity of VSS c...
ICMCS
2007
IEEE
13 years 11 months ago
2007
IEEE
Some (k, n)-threshold image secret sharing schemes encrypt the secret image into n noise-like shadow images with size 1/k times that of the original secret image. The small size o...
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...