Pages that link to "Item:Q1690269"
From MaRDI portal
The following pages link to Zero knowledge protocols from succinct constraint detection (Q1690269):
Displaying 15 items.
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Zero-knowledge elementary databases with more expressive queries (Q2289211) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- Theory of Cryptography (Q5901767) (← links)
- Proof-carrying data from arithmetized random oracles (Q6061366) (← links)
- Sherlock Holmes zero-knowledge protocols (Q6111601) (← links)
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) (← links)
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II (Q6169368) (← links)
- Distilling Constraints in Zero-Knowledge Protocols (Q6487324) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Zero-knowledge IOPs approaching witness length (Q6660294) (← links)
