摘要
为了拓展门限结构的秘密共享体制,提出了一个更为广泛的防欺诈的矢量空间秘密共享方案.以防欺诈的门限方案作为雏形,对所共享的秘密进行封装,公开其承诺量,在分发者分发秘密份额时检测共享秘密的正确性,从而防止了恶意分发者散发虚假的份额.利用计算二次剩余的困难性,在恢复秘密时验证各参与者提供份额的有效性,同时杜绝了恶意参与者欺诈的可能性.与同类方案相比,该方案不仅具有最优的信息率,而且花费很小的计算和通信代价.
A vector space secret sharing scheme against cheating was proposed for extending the normal threshold structure. In this scheme, the secret was encapsulated, and its commitment was publicized. Then everyone can verify the correctness of the distribution of secret shares, and any malicious dealer can be detected efficiently. In the process of secret recovery, each shareholder who pooled share was authenticated by means of the intractability of quadratic residue over finite field of large prime order, which prevented the adversaries from getting the secret or shares and the shareholders from cheating each other. Thus any unfaithful shareholders was traced and determined. Compared with the similar schemes, the proposed scheme not only has maximum information rate, but also has far lower computation and communication cost.
出处
《浙江大学学报(工学版)》
EI
CAS
CSCD
北大核心
2004年第11期1408-1411,1421,共5页
Journal of Zhejiang University:Engineering Science
基金
浙江省自然科学基金资助项目(001101352).
关键词
秘密共享
欺诈
二次剩余
信息率
Algorithms
Computational complexity
Information management
Theorem proving