Institutional Repository
| Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions | |
| Uriel Feige; Dror Lapidot; Adi Shamir | |
| 2000 | |
| Source | SIAM Journal on Computing
 |
| Volume | 29Issue:1Pages:1-28 |
| English Abstract | In this paper we show how to construct noninteractive zero knowledge proofs for any NP statement under general (rather than number theoretic) assumptions, and how to enable polynomially many provers to give polynomially many such proofs based on a single random string. Our constructions can be used in cryptographic applications in which the prover is restricted to polynomial time. |
| Indexed Type | 其他 |
| Cooperation Status | 其它 |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/1297 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Uriel Feige,Dror Lapidot,Adi Shamir. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions[J]. SIAM Journal on Computing,2000,29(1):1-28. |
| APA | Uriel Feige,Dror Lapidot,&Adi Shamir.(2000).Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions.SIAM Journal on Computing,29(1),1-28. |
| MLA | Uriel Feige,et al."Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions".SIAM Journal on Computing 29.1(2000):1-28. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| bj01129458.pdf（415KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment