Non-Interactive¶
Description¶
Tags proof systems that are non-interactive (single message from prover to verifier), typically achieved via the Fiat-Shamir heuristic in the random oracle model.
Entries tagged¶
- Designated-Verifier Dynamic zk-SNARKs
- Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index (Wang et al. 2026)
- Fiat-Shamir Transformation
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems (Fiat-Shamir)
- Non-Interactive Zero-Knowledge and Its Applications
- Non-Interactive Zero-Knowledge and Its Applications (BFM88)
- ZKProof Sigma Protocol Proposal (Workshop 4)