Anonymous NIZK proofs of knowledge with preprocessing
From MaRDI portal
In this extended abstract we present a non-interactive zero-knowledge proof system of knowledge with preprocessing, whose main property is that, after executing two preprocessing phases and given a transcript of a proof phase, the verifier is not able to relate the transcript to any of the two preprocessing phases significantly better than random guessing. For the entire collection see [Zbl 0866.00067].
Recommendations
- The power of preprocessing in zero-knowledge proofs of knowledge
- Removing Interaction from Zero-Knowledge Proofs
- scientific article; zbMATH DE number 503349
- Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
- On concurrent zero-knowledge with pre-processing. (Extended abstract)
This page was built for publication: Anonymous NIZK proofs of knowledge with preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757268)