Institutional Repository
| Noninteractive Zero-Knowledge | |
| Manuel Blum; Alfredo De Santis; Silvio Micali; Giuseppe Persiano | |
| 1991 | |
| Source | SIAM Journal on Computing
 |
| Volume | 20Issue:6Pages:1084-1118 |
| English Abstract | 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. |
| Indexed Type | 其他 |
| Cooperation Status | 其它 |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/1313 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| bj01132981.pdf（2456KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment