| Noninteractive Zero-Knowledge | |
| Manuel Blum; Alfredo De Santis; Silvio Micali; Giuseppe Persiano | |
| 1991 | |
| 发表期刊 | SIAM Journal on Computing
 |
| 卷号 | 20期号:6页码:1084-1118 |
| 摘要 | This paper investigates the possibility of disposing of interaction between prover and verifier in a zero-knowledge proof if they share beforehand a short random string.Without any assumption, it is proven that noninteractive zero-knowledge proofs exist for some number-theoretic languages for which no efficient algorithm is known.If deciding quadratic residuosity (modulo composite integers whose factorization is not known) is computationally hard, it is shown that the NP-complete language of satisfiability also possesses noninteractive zero-knowledge proofs. |
| 收录类别 | 其他 |
| 合作性质 | 其它 |
| 语种 | 英语 |
| 内容类型 | 期刊论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/1313 |
| 专题 | 中国科学院软件研究所 |
| 推荐引用方式 GB/T 7714 | Manuel Blum,Alfredo De Santis,Silvio Micali,et al. Noninteractive Zero-Knowledge[J]. SIAM Journal on Computing,1991,20(6):1084-1118. |
| APA | Manuel Blum,Alfredo De Santis,Silvio Micali,&Giuseppe Persiano.(1991).Noninteractive Zero-Knowledge.SIAM Journal on Computing,20(6),1084-1118. |
| MLA | Manuel Blum,et al."Noninteractive Zero-Knowledge".SIAM Journal on Computing 20.6(1991):1084-1118. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| bj01132981.pdf（2456KB） | 开放获取 | 使用许可 | 请求全文 | |||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论