摘要: 信息安全协议中使用的随机数通常由协议参与者任意选取,其他参与方无法验证,从而影响协议的公平性。针对上述问题,提出一个基于插值多项式的可验证随机数生成方案。该方案无需可信任的第三方,计算中心只承担计算职责,不承担可信任第三方的验证职责,并且方案中任意参与者都能验证随机数的随机性,保证了协议的公平性。
关键词:
随机数,
可验证随机数,
插值多项式
Abstract: Random number is always chosen by the participant in information security protocol, which can not be verified by other participants, so that the fairness of protocol is affected. Aiming at the problem, this paper proposes a scheme for generating verifiable random number. It does not need Trusted Third Party(TTP). The task of calculation center is only to perform calculation, not to play a role as TTP. The scheme allows every participant to verify the Randomness of the random number, which ensures the fairness of the protocol.
Key words:
random number,
verifiable random number,
interpolating polynomial
中图分类号:
刘忆宁;曹建宇. 基于插值多项式的可验证随机数[J]. 计算机工程, 2010, 36(10): 179-180.
LIU Yi-ning; CAO Jian-yu. Verifiable Random Number Based on Interpolating Polynomial[J]. Computer Engineering, 2010, 36(10): 179-180.