Non-interactive zero-knowledge proof (Q7048932)
Jump to navigation
Jump to search
common random string shared between the prover and the verifier is enough to achieve computational zero-knowledge without requiring interaction
- NIZK
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-interactive zero-knowledge proof |
common random string shared between the prover and the verifier is enough to achieve computational zero-knowledge without requiring interaction |
|