计算机工程 ›› 2009, Vol. 35 ›› Issue (12): 123-124.doi: 10.3969/j.issn.1000-3428.2009.12.043

• 安全技术 • 上一篇    下一篇

整体检测门限秘密共享欺诈者方案

张 毅,陈文星   

  1. (重庆邮电大学通信与信息工程学院,重庆 400065)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-06-20 发布日期:2009-06-20

Scheme of Whole Detecting Cheaters in Threshold Secret Sharing

ZHANG Yi, CHEN Wen-xing   

  1. (Institute of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-06-20 Published:2009-06-20

摘要: 对门限秘密共享欺诈者的检测,目前很少有整体检测法。利用线性方程组解的性质,在能获得比门限个数多一个参与者的条件下,不需其他任何信息,只需执行一次运算,就可整体判断有无欺诈者。该方案是一个完备的秘密共享方案,信息率为1,1个欺诈者欺诈成功的概率为0,2个及多个欺诈者欺诈成功的概率不超过1/p(p为大素数)。

关键词: 门限秘密共享, 欺诈, 整体检测, 秘密影子, 多方安全

Abstract: So far, methods of whole detecting cheaters in threshold secret sharing are few. If another participant can join in the t participants, t+1 participants in total, according to the scheme proposed in this paper, the existence of cheaters can be checked out only calculating equations once, requiring no other information. This scheme is a perfect sharing scheme. Its information rate is 1. The probability of one cheater’s success is 0 and it is less than 1/p (where p is a large prime) for two or three cheaters in probability of success.

Key words: threshold secret sharing, cheat, whole detecting, shadow of secret, multi-party security

中图分类号: