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

层次群中的秘密共享与份额主动更新

Secret Sharing and Proactive Renewal of Shares in Hierarchical Groups

Ruchira Naskar, Indranil Sengupta

摘要:

用户层次中的秘密共享是一个具有挑战性的研究领域。虽然在这方面已经做了大量的工作,本文提出了一种新的方法来共享一个秘密之间的层次结构的用户,同时克服了现有的机制的局限性。我们的工作是基于传统的(k +1; n)阈值秘密共享,这是安全的,只要对手可以妥协不超过k秘密份额。但在现实生活中,对手在很长一段时间内获得k个以上的份额往往是可行的。因此,在我们的工作中,我们也提出了一种方法来克服这个漏洞,同时实现我们的分层秘密共享方案。椭圆曲线密码体制的使用使得我们的计算更加简单和快速。

英文摘要:

Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direc- tion, this paper presents a novel approach to share a secret among a hierarchy of users while overcoming the limitations of the already exist- ing mechanisms. Our work is based on traditional (k +1; n)-threshold secret sharing, which is secure as long as an adversary can compromise not more than k secret shares. But in real life it is often feasible for an adversary to obtain more than k shares over a long period of time. So, in our work we also present a way to overcome this vulnerability, while implementing our hierarchical secret sharing scheme. The use of Elliptic Curve Cryptography makes the computations easier and faster in our work.

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

↑