摘要
（ｔ，ｎ）阈方案中的欺诈识别是一个很重要的问题．文中提出了一种有效的基于平方剩余的欺诈识别方案，攻击时的难度相当于分解两个大素数的乘积的难度．它无须使用单向哈希函数，并且对公共参数的完整性给予保证，可以阻止阴谋者起诉陷害某个特殊的成员．它很容易扩展到分享多个秘密的情况．它所需的通信量较Ｃｈａｎｇ－Ｈｗａｎｇ方案小．
Cheating detection is a very important issue for ( t,n ) threshold schemes. An efficient cheater detection scheme based on quadratic residues is proposed in this paper. The attack is as difficult as factoring the product of two large prime numbers. The scheme doesn't need any one way hash function. The integrity guarantee is given to the public parameters, which can prevent a conspirator from falsely accusing any specific members. It can be easily expanded to the multi secret sharing scheme. The quantity of communication is smaller than that in Chang Hwang scheme.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1999年第7期853-858,共6页
Journal of Computer Research and Development
关键词
欺诈识别
阈方案
平方剩余
信息安全
cheater identification, threshold scheme, quadratic residues, secret shares
