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

秘密共享和共享信息

Secret Sharing and Shared Information

Johannes Rauh

摘要:

秘密共享是一种密码学学科,其目标是在一组参与者中分发关于秘密的信息,使得只有特定的授权参与者组合才能重建秘密。因此,秘密共享方案是变量系统,其中非常清楚地指定哪些子集具有关于秘密的信息。因此,它们为信息分解提供了完美的模型系统。然而,遵循这种直觉太远会导致信息分解与负的部分信息项,这是难以解释的。一个可能的解释是,威廉姆斯和比尔提出的部分信息格是不完整的,必须扩展到包含对应于高阶冗余项。这些结果提出了信息分解,遵循部分信息框架的界限,他们暗示的部分信息格需要改进。

英文摘要:

Secret sharing is a cryptographic discipline in which the goal is to distribute information about a secret over a set of participants in such a way that only specific authorized combinations of participants together can reconstruct the secret. Thus, secret sharing schemes are systems of variables in which it is very clearly specified which subsets have information about the secret. As such, they provide perfect model systems for information decompositions. However, following this intuition too far leads to an information decomposition with negative partial information terms, which are difficult to interpret. One possible explanation is that the partial information lattice proposed by Williams and Beer is incomplete and has to be extended to incorporate terms corresponding to higher order redundancy. These results put bounds on information decompositions that follow the partial information framework, and they hint at where the partial information lattice needs to be improved.

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

↑