论文部分内容阅读
本文提出:任何零知识证明中的交互作用都可以通过共享一个公用的短随机串来代替。我们用这一结果构造了能防止选择性密文攻击的一流的公开密钥密码体制。
This paper proposes that any interaction in zero-knowledge proofs can be replaced by the sharing of a common short random string. We use this result to construct a first-class public-key cryptosystem that prevents selective ciphertext attacks.