Pages that link to "Item:Q1261016"
From MaRDI portal
The following pages link to On the communication complexity of zero-knowledge proofs (Q1261016):
Displaying 10 items.
- On the complexity of interactive proofs with bounded communication (Q293359) (← links)
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- A language-dependent cryptographic primitive (Q676829) (← links)
- Tight bounds for the multiplicative complexity of symmetric functions (Q924152) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions (Q2912785) (← links)
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions (Q3000564) (← links)
- Zero knowledge proofs of knowledge in two rounds (Q3210166) (← links)
- (Q3987506) (← links)
- Low communication 2-prover zero-knowledge proofs for NP (Q4318695) (← links)