Distributive weighted threshold secret sharing schemes

详细信息    查看全文

• 作者：Constantin Cătălin Drăgan ^{constantin.dragan@info.uaic.ro" class="auth_mail" title="E-mail the corresponding author} ; Ferucio Laurenţiu Ţiplea ; ^{fltiplea@info.uaic.ro" class="auth_mail" title="E-mail the corresponding author} ; ^{fltiplea@gmail.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Access structure ; Secret sharing scheme ; Chinese remainder theorem ; Entropy
• 刊名：Information Sciences
• 出版年：2016
• 出版时间：20 April 2016
• 年：2016
• 卷：339
• 期：Complete
• 页码：85-97
• 全文大小：377 K

文摘

The concept of distributive weighted threshold access structure is introduced, which is an weighted threshold access structure where the participants are distributed on levels, the participants on the same level are assigned the same weight, and the threshold of the access structure is 1. The weight of the participants on the ith level is of the form 1/k_i and, therefore, the ith level induces a standard threshold access structure with threshold k_i.

We propose a CRT-based realization of distributive weighted threshold access structures, which is asymptotically perfect and perfect zero-knowledge. We also show that distributive weighted threshold access structures do not generally have ideal realizations. In case of just one level, our scheme can be viewed as an asymptotically perfect and perfect zero-knowledge variation of the Asmuth–Bloom secret sharing scheme.