THE POWER OF PREPROCESSING IN ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE

Authors
DESANTIS A PERSIANO G
Citation
A. Desantis et G. Persiano, THE POWER OF PREPROCESSING IN ZERO-KNOWLEDGE PROOFS OF KNOWLEDGE, Journal of cryptology, 9(3), 1996, pp. 129-148
Citations number
31
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Journal of cryptology → ACNP
ISSN journal
09332790
Volume
9
Issue
3
Year of publication
1996
Pages
129 - 148
Database
ISI
SICI code
0933-2790(1996)9:3<129:TPOPIZ>2.0.ZU;2-M
Abstract
We show that, after a constant-round preprocessing stage, it is possib le for a prover to prove knowledge of a witness for any polynomial-tim e 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 m embership exist.