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
Facts
1 property- Subclass of
- zero-knowledge proof[1]
🏷️ Also known as
en NIZK
en Non-interactive zero-knowledge proof
fr Preuve à divulgation nulle de connaissance
it Conoscenza nulla non-interattiva
ja 非対話型ゼロ知識証明
zh 非交互式零知識證明
zh 非交互零知識證明
🔖 Identifiers · 2
- Freebase ID
- /m/02rkk3k
- Microsoft Academic ID (discontinued)
- 112293400
Press Enter · cited answer in seconds