caa a22 4500 477063640 CHVBK 20180405111406.0 cr unu---uuuuu 170330e19960601xx s 000 0 eng 10.1007/BF00208001 doi (NATIONALLICENCE)springer-10.1007/BF00208001 How to construct constant-round zero-knowledge proof systems for NP [Elektronische Daten] [Oded Goldreich, Ariel Kahan] Constant-round zero-knowledge proof systems for every language in $$\mathcal{N}\mathcal{P}$$ 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. International Association for Cryptologic Research, 1996 Zero-knowledge proofs nationallicence NP nationallicence Claw-free functions nationallicence Commitment schemes nationallicence Coin flipping protocols nationallicence Parallel composition of proof systems nationallicence Goldreich Oded Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel aut Kahan Ariel BRM Technologies, P.O.Box 45065, Jerusalem, Israel aut Journal of Cryptology Springer-Verlag 9/3(1996-06-01), 167-189 0933-2790 9:3<167 1996 9 145 https://doi.org/10.1007/BF00208001 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF00208001 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Goldreich Oded Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel aut NATIONALLICENCE 700 1- Kahan Ariel BRM Technologies, P.O.Box 45065, Jerusalem, Israel aut NATIONALLICENCE 773 0- Journal of Cryptology Springer-Verlag 9/3(1996-06-01), 167-189 0933-2790 9:3<167 1996 9 145 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer