论文部分内容阅读
（ｔ，ｎ）阈方案中的欺诈识别是一个很重要的问题．文中提出了一种有效的基于平方剩余的欺诈识别方案，攻击时的难度相当于分解两个大素数的乘积的难度．它无须使用单向哈希函数，并且对公共参数的完整性给予保证，可以阻止阴谋者起诉陷害某个特殊的成员．它很容易扩展到分享多个秘密的情况．它所需的通信量较Ｃｈａｎｇ－Ｈｗａｎｇ方案小．
Fraud identification in the (t, n) thresholding scheme is a very important issue. In this paper, we propose an effective fraud detection scheme based on squared residuals. The difficulty of attack is equivalent to the difficulty of decomposing the product of two large prime numbers. It eliminates the need for one-way hash functions and guarantees the integrity of public parameters to prevent conspirators from suing for a particular member. It easily scales to sharing multiple secrets. It requires less traffic than the Chang-Hwang solution.