Pages that link to "Item:Q4318695"
From MaRDI portal
The following pages link to Low communication 2-prover zero-knowledge proofs for NP (Q4318695):
Displaying 11 items.
- Zero knowledge and the chromatic number (Q1276168) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions (Q2912785) (← links)
- Two-Prover Protocols---Low Error at Affordable Rates (Q4507353) (← links)
- Probabilistic proof systems — A survey (Q5048957) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)