论文部分内容阅读
本文给出了两种可行的比特承诺方案:一种适应于承诺若干个比特,一种适应于承诺任意长度的消息。该方案的安全性是基于伪随机合成器的存在性,承诺者可以拥有无限的计算资源。其优点是对安全参数的要求较小。
This article presents two possible schemes for bit commitment: one adapted to commit a number of bits and one adapted to commit messages of any length. The security of the scheme is based on the existence of pseudo-random synthesizers, promised by the unlimited computational resources. The advantage is less demanding on safety parameters.