一种随机元及其概率的生成协议
A Protocol for Generating Random Elements with their Probabilities
摘要:
我们给出了一个AM协议,允许验证者从概率分布P中采样元素x,该概率分布P由证明者持有。如果证明者是诚实的,则验证者以接近P(x)的概率输出(x,P(x))。如果证明者是不诚实的,人们可以希望得到以下保证:如果验证者输出(x,p),那么验证者输出x的概率接近p。相反,我们证明了以下较弱的条件平均成立(在定义明确的意义上):如果(x,p)是输出,则p是x是输出的概率的上界。我们的协议产生了一个新的转换,将验证者使用私人随机硬币的交互式证明转换为使用公共硬币的证明。与著名的Goldwasser-Sipser变换(STOC,1986)相比,验证器具有更好的运行时间。对于常数轮协议,我们只在可靠性和完整性方面损失一个任意小的常数,而我们的公共硬币验证器只调用私有硬币验证器一次。
英文摘要:
We give an AM protocol that allows the verifier to sample elements x from a probability distribution P, which is held by the prover. If the prover is honest, the verifier outputs (x, P(x)) with probability close to P(x). In case the prover is dishonest, one may hope for the following guarantee: if the verifier outputs (x, p), then the probability that the verifier outputs x is close to p. Simple examples show that this cannot be achieved. Instead, we show that the following weaker condition holds (in a well defined sense) on average: If (x, p) is output, then p is an upper bound on the probability that x is output. Our protocol yields a new transformation to turn interactive proofs where the verifier uses private random coins into proofs with public coins. The verifier has better running time compared to the well-known Goldwasser-Sipser transformation (STOC, 1986). For constant-round protocols, we only lose an arbitrarily small constant in soundness and completeness, while our public-coin verifier calls the private-coin verifier only once.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。