Bit commitment using pseudorandomness
Bit commitment using pseudorandomness
复制标题
DOI：
10.1007/bf00196774
复制
发表时间：
1989-08
影响因子：
3
通讯作者：
M. Naor
中科院分区：
文献类型：
--
作者：
M. Naor
我们将展示伪随机生成器如何提供位承诺协议。我们还分析了当各方同时提交多个比特时通信的比特数，并表明存在伪随机生成器的假设足以确保每个比特提交的通信平摊(1)比特。
We show how a pseudorandom generator can provide a bit-commitment protocol. We also analyze the number of bits communicated when parties commit to many bits simultaneously, and show that the assumption of the existence of pseudorandom generators suffices to assure amortizedO(1) bits of communication per bit commitment.