caa a22 4500 477063632 CHVBK 20180405111406.0 cr unu---uuuuu 170330e19960601xx s 000 0 eng 10.1007/BF00207999 doi (NATIONALLICENCE)springer-10.1007/BF00207999 The power of preprocessing in zero-knowledge proofs of knowledge [Elektronische Daten] [Alfredo De Santis, Giuseppe Persiano] We show that, after a constant-round preprocessing stage, it is possible for a prover to prove knowledge of a witness for any polynomial-time relation without any further interaction. The number of proofs that can be given is not bounded by any fixed polynomial in the size of the preprocessing. Our construction is based on the sole assumption that one-way functions and noninteractive zero-knowledge proof systems of membership exist. International Association for Cryptologic Research, 1996 Zero knowledge nationallicence Noninteractive proof systems nationallicence Proofs of knowledge nationallicence De Santis Alfredo Dipartimento di Informatica ed App., Università di Salerno, 84081, Baronissi, Salerno, Italy aut Persiano Giuseppe Dipartimento di Informatica ed App., Università di Salerno, 84081, Baronissi, Salerno, Italy aut Journal of Cryptology Springer-Verlag 9/3(1996-06-01), 129-148 0933-2790 9:3<129 1996 9 145 https://doi.org/10.1007/BF00207999 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF00207999 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- De Santis Alfredo Dipartimento di Informatica ed App., Università di Salerno, 84081, Baronissi, Salerno, Italy aut NATIONALLICENCE 700 1- Persiano Giuseppe Dipartimento di Informatica ed App., Università di Salerno, 84081, Baronissi, Salerno, Italy aut NATIONALLICENCE 773 0- Journal of Cryptology Springer-Verlag 9/3(1996-06-01), 129-148 0933-2790 9:3<129 1996 9 145 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer