|
|||||
|
|
How to construct constant-round zero-knowledge proof systems for NP |
|
| Authors: | Oded Goldreich Ariel Kahan |
| Affiliation: | (1) Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel;(2) BRM Technologies, P.O.Box 45065, Jerusalem, Israel |
| Abstract: | Constant-round zero-knowledge proof systems for every language in
are presented, assuming the existence of a collection of claw-free functions. In particular, it follows that such proof systems exist assuming the intractability of either the Discrete Logarithm Problem or the Factoring Problem for Blum integers. |
| Keywords: | Zero-knowledge proofs NP Claw-free functions Commitment schemes Coin flipping protocols Parallel composition of proof systems |
| 本文献已被 SpringerLink 等数据库收录！ | |