The following pages link to (Q4527017):
Displaying 17 items.
- Zero knowledge protocols from succinct constraint detection (Q1690269) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- ZK-PCPs from leakage-resilient secret sharing (Q2159466) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits (Q2799088) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- A General, Flexible and Efficient Proof of Inclusion and Exclusion (Q3073693) (← links)
- Provably Hard Zero-Way Functions (Q4784455) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- On the concrete efficiency of probabilistically-checkable proofs (Q5495829) (← links)
- (Q5750398) (← links)
- Zero-knowledge IOPs approaching witness length (Q6660294) (← links)
