论文部分内容阅读
零知识交互式证明是一个协议,用这一协议爱莉斯(Alice)不用给予鲍勃(Bob)关于如何进行证明的任何暗示就能使一多项式有界的Bob相信某一定理的真实性,在密码假设下,为达此目的,对于NP中的每个问题,我们给出一般技术,这扩展到可能的一大类,它们兼有非决定性及随机性的能力。我们的协议是强有力的,它足以供Alice使Bob相信一些她还未曾证明过的定理之用。也许由于Alice懂得一些陷门信息,该协议也足以使Alice自己从概率上去相信一定理,这样Alice也能使Bob相信而不以任何方式泄露陷门。
The zero-knowledge interactive proof is an agreement by which Alice can convince a polynomial bounded Bob to the truth of a theorem without giving Bob any hint as to how to prove it, Under the cryptographic assumptions, for this purpose we give general techniques for each of the problems in the NP, which extends to a large class of possibilities, both non-deterministic and random. Our agreement is strong enough for Alice to convince Bob of some theorems she has not yet proven. Perhaps because Alice knows some trap information, the agreement is enough to convince Alice of his own probability, so Alice can convince Bob without revealing the trapdoor in any way.