Name
Abstract | ||
|---|---|---|
A secret sharing scheme (SSS) was introduced by Shamir in 1979 using polynomial interpolation. Later it turned out that it is equivalent to an SSS based on a Reed---Solomon code. SSSs based on linear codes have been studied by many researchers. However there is little research on SSSs based on additive codes. In this paper, we study SSSs based on additive codes over GF(4) and show that they require at least two steps of calculations to reveal the secret. We also define minimal access structures of SSSs from additive codes over GF(4) and describe SSSs using some interesting additive codes over GF(4) which contain generalized 2-designs.
|
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s00200-016-0296-5 | Appl. Algebra Eng. Commun. Comput. |
Keywords | DocType | Volume |
11T71, 94A62, Access structure, Additive codes, Generalized t-design, Minimal access structure, Secret sharing scheme | Journal | abs/1701.04183 |
Issue | ISSN | Citations |
1 | 0938-1279 | 0 |
PageRank | References | Authors |
0.34 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jon-Lark Kim | 1 | 312 | 34.62 |
| Nari Lee | 2 | 8 | 1.98 |