arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.13663cs.ITmath.COmath.IT
收藏

秘密共享和二元性

Secret sharing and duality

Laszlo Csirmaz

摘要:

秘密共享是密码学中的一个重要组成部分。所有已知精确复杂度界的显式定义的秘密共享方案都是多线性的,因此与线性码密切相关。这种线性方案的对偶,在线性码的对偶意义上,给出了双重访问结构的另一种方案。这些方案具有相同的复杂度,即相对于秘密大小的最大份额大小是相同的。这是一个长期存在的开放问题,是否这一事实是真的一般:任何访问结构的复杂性是相同的,其对偶的复杂性。我们对这个问题给出了一个近似的答案。一个几乎完美的计划允许可以忽略的错误,无论是在恢复和独立性。存在一个关于174个参与者的几乎完美的理想方案,其复杂性严格小于其对偶方案的复杂性。

英文摘要:

Secret sharing is an important building block in cryptography. All explicitly defined secret sharing schemes with known exact complexity bounds are multi-linear, thus are closely related to linear codes. The dual of such a linear scheme, in the sense of duality of linear codes, gives another scheme for the dual access structure. These schemes have the same complexity, namely the largest share size relative to the secret size is the same. It is a long-standing open problem whether this fact is true in general: the complexity of any access structure is the same as the complexity of its dual. We give an almost answer to this question. An almost perfect scheme allows negligible errors, both in the recovery and in the independence. There exists an almost perfect ideal scheme on 174 participants whose complexity is strictly smaller than that of its dual.

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

↑