A generic transform from multi-round interactive proof to NIZK
From MaRDI portal
Recommendations
- Non-interactive zero knowledge \textit{proofs} in the random oracle model
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Non-interactive zero-knowledge proofs in the quantum random oracle model
Cites work
- 1-out-of-n Signatures from a Variety of Keys
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- Blind Signature System
- Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
- Does Fiat-Shamir require a cryptographic hash function?
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Fiat-Shamir: from practice to theory
- How to Break MD5 and Other Hash Functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4053065 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Hybrid commitments and their applications to zero-knowledge proof systems
- More efficient amortization of exact zero-knowledge proofs for LWE
- Multi-theorem preprocessing NIZKs from lattices
- New constructions of reusable designated-verifier NIZKs
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Signatures from sequential-OR proofs
- SOFIA: \(\mathcal{MQ}\)-based signatures in the QROM
- The first collision for full SHA-1
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Theory of Cryptography
- Zero-knowledge proofs of identity
Cited in
(4)
This page was built for publication: A generic transform from multi-round interactive proof to NIZK
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6088992)
