Non-interactive zero-knowledge and its applications
发表信息
作者
- Manuel Blum
- Paul Feldman
- Silvio Micali
笔记
Abstract We show that interaction in any zero-knowledge proof can be replaced by sharing a common, short, random string. We use this result to construct the first public-key cryptosystem secure against chosen ciphertext attack.
我们证明了在任何零知识证明中的交互过程，都可以通过共享一个简短且随机的公共字符串来替代。基于这一发现，我们构建了首个能够抵御选择密文攻击的公钥加密系统。
首次提出CRS:公共参考串模型 (common reference string model)