arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.1877cs.CR
收藏

如何不分享一组秘密

How not to share a set of secrets

K. R. Sahasranand, Nithin Nagaraj, S. Rajan

摘要:

本文分析了现有的一个空间有效的秘密共享方案,并指出其设计中的漏洞。我们观察到,所述算法失败的秘密集的某些选择,并没有理由更喜欢这个特定的方案比替代方案。本文还阐述了通过Hugo Krawczyk提出的一个方案作为沙米尔方案的扩展,一组秘密。这样的实现是空间最优的,并且适用于所有秘密选择。我们还提出了两种新的攻击方法,在某些假设下是有效的,并观察到,这是消除随机值,促进这些类型的攻击。

英文摘要:

This note analyses one of the existing space efficient secret sharing schemes and suggests vulnerabilities in its design. We observe that the said algorithm fails for certain choices of the set of secrets and there is no reason for preferring this particular scheme over alternative schemes. The paper also elaborates the adoption of a scheme proposed by Hugo Krawczyk as an extension of Shamir's scheme, for a set of secrets. Such an implementation is space optimal and works for all choices of secrets. We also propose two new methods of attack which are valid under certain assumptions and observe that it is the elimination of random values that facilitates these kinds of attacks.

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

↑