Name
Abstract | ||
|---|---|---|
We generalize secret sharing to a symmetric multilevel imperfect secret sharing (SMISS) problem. To measure the secrecy of the system, we introduce a security level for each set of encoded messages, which is measured by the equivocation of the source message given the encoded messages in this set. The security levels of all the subsets with the same cardinality are assumed to be identical. This problem in its general case is complicated. In this paper, we explicitly characterize the rate regions of the general two-level and three-level SMISS problems. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ITW.2018.8613450 | 2018 IEEE Information Theory Workshop (ITW) |
Keywords | Field | DocType |
symmetric multilevel imperfect secret sharing problem,three-level SMISS problems,source message,encoded messages,security level | Imperfect,Secret sharing,Security level,Computer science,Secrecy,Cardinality,Theoretical computer science,Mutual information,Equivocation,Encoding (memory) | Conference |
ISSN | ISBN | Citations |
2475-420X | 978-1-5386-3600-8 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tao Guo | 1 | 386 | 45.64 |
| Xuan Guang | 2 | 7 | 4.22 |
| Kenneth W. Shum | 3 | 544 | 56.37 |