计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (29): 8-10.

• 博士论坛 • 上一篇    下一篇

参与者权重不同的防欺诈的动态秘密共享方案

张艳硕1,2,刘卓军2,柴凤娟2   

  1. 1.北京电子科技学院,北京 100070
    2.中国科学院 数学机械化重点实验室,北京 100080
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-10-11 发布日期:2007-10-11
  • 通讯作者: 张艳硕

Dynamic secure secret sharing scheme among weighted participants to prevent cheating

ZHANG Yan-shuo1,2,LIU Zhuo-jun2,CHAI Feng-juan2   

  1. 1.Beijing Electronic Science and Technology Institute,Beijing 100070,China
    2.Key Lab of MMRC,CAS,Beijing 100080,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-10-11 Published:2007-10-11
  • Contact: ZHANG Yan-shuo

摘要: 在秘密共享方案的研究中,一般都进行Shamir门限秘密共享方案的研究,该方案基于多项式插值。论文基于中国剩余定理的参与者权重不同的秘密共享方案,提出了一个基于离散对数问题的困难性的参与者权重不同的防欺诈的动态秘密共享方案。方案中每个参与者的子秘密可多次使用,秘密更新时,无需更新参与者的子秘密,并且可以灵活地增加或删除。

关键词: 秘密共享, 权重不同, 中国剩余定理, 离散对数, 欺诈

Abstract: Generally,people just research on Shamir threshold secret sharing scheme,which is based on polynomial interpolation.We have researched on secret sharing scheme among weighted participants,and showed a dynamic secret sharing scheme based on discrete logarithms which can detect cheaters.The shadow of every participant can be used by many times,and the secrets can be renewed without renewing the shadow of the participants,and a participant can be freely accepted or fired.

Key words: secret sharing, weighted, Chinese Remainder Theorem, discrete logarithms, cheating