The following pages link to On Efficient Zero-Knowledge PCPs (Q2891481):
Displaying 20 items.
- Precise zero-knowledge arguments with poly-logarithmic efficiency (Q615245) (← links)
- Are PCPs inherent in efficient arguments? (Q626678) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Promise zero knowledge and its applications to round optimal MPC (Q1784103) (← links)
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
- Perfect zero knowledge: new upperbounds and relativized separations (Q2055744) (← 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)
- Zero-knowledge elementary databases with more expressive queries (Q2289211) (← 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)
- Interactive Oracle Proofs (Q3181021) (← links)
- (Q4414289) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting (Q5402970) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
