Name
Abstract | ||
|---|---|---|
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here unconditionally secure schemes
with multithreshold access structures. Namely, for every subset P of k users there is a secret key that can only be computed when at least t of them put together their secret information. Coalitions with at most w users with less than t of them in P cannot obtain any information about the secret associated to P. The main parameters to optimize are the length of the shares and the amount of random bits that are needed to set up the
distribution of shares, both in relation to the length of the secret. In this paper, we provide lower bounds on this parameters.
Moreover, we present an optimal construction for t = 2 and k = 3, and a construction that is valid for all w, t, k and n. The models presented use linear algebraic techniques.
|
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ipl.2012.05.008 | International Conference on Information Theoretic Security |
Keywords | DocType | Volume |
linear threshold multisecret,subset p,secret information,main parameter,information-theoretic secure scheme,k user,secret key,multithreshold access structure,secret value,different associated access structure,lower bound | Journal | 112 |
Issue | ISSN | ISBN |
17-18 | 0020-0190 | 3-642-14495-0 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oriol FarríS | 1 | 13 | 0.90 |
| Ignacio Gracia | 2 | 49 | 4.29 |
| Sebastià Martín Molleví | 3 | 0 | 0.34 |
| Carles Padró | 4 | 490 | 32.23 |