Name
Abstract | ||
|---|---|---|
. A secret sharing scheme permits a secret to be shared among participants of an n-element group in such a way that only qualified subsets of participants can recover the secret. If any nonqualified subset
has absolutely no information on the secret, then the scheme is called perfect. The share in a scheme is the information that a participant must remember.
In [3] it was proved that for a certain access structure any perfect secret sharing scheme must give some participant a
share which is at least 50\percent larger than the secret size. We prove that for each n there exists an access structure on n participants so that any perfect sharing scheme must give some participant a share which is at least about times the secret size.^1 We also show that the best possible result achievable by the information-theoretic method used here is n times the secret size.
^1 All logarithms in this paper are of base 2. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/s001459900029 | J. Cryptology |
Keywords | Field | DocType |
Key words. Secret sharing,Ideal secret sharing schemes,Polymatroid structures,Perfect security. | Binary logarithm,Secure multi-party computation,Secret sharing,A share,Existential quantification,Computer science,Theoretical computer science,Verifiable secret sharing,Homomorphic secret sharing,Access structure | Conference |
Volume | Issue | ISSN |
10 | 4 | 0933-2790 |
Citations | PageRank | References |
108 | 3.94 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| László Csirmaz | 1 | 163 | 15.86 |