Zero knowledge protocols from succinct constraint detection
From MaRDI portal
Recommendations
Cited in
(16)- Distilling Constraints in Zero-Knowledge Protocols
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Linear-size constant-query IOPs for delegating computation
- Sherlock Holmes zero-knowledge protocols
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Proof-carrying data from arithmetized random oracles
- Zero-knowledge proofs of proximity
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Theory of Cryptography
- Quasi-linear size zero knowledge from linear-algebraic PCPs
- Zero-knowledge elementary databases with more expressive queries
- Zero-knowledge IOPs approaching witness length
- On succinct non-interactive arguments in relativized worlds
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
This page was built for publication: Zero knowledge protocols from succinct constraint detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690269)