arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.04183cs.ITmath.IT
收藏

$GF(4)$上基于加性码的秘密共享方案

Secret sharing schemes based on additive codes over $GF(4)$

Jon-Lark Kim, Nari Lee

摘要:

Shamir在1979年利用多项式插值提出了一种秘密共享方案。后来证明它相当于基于Reed-Solomon码的SSS。基于线性码的扩频系统已经被许多研究者所研究。然而,目前对基于加性码的扩频系统的研究还很少。本文研究了基于$GF(4)$上的加性码的SSSS,证明了它们至少需要两步计算才能揭示秘密。我们还定义了由$GF(4)$上的加性码生成的SSS的最小访问结构,并描述了由$GF(4)$上的一些有趣的加性码生成的包含广义2-设计的SSS.

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑