Pages that link to "Item:Q362163"
From MaRDI portal
The following pages link to Round-optimal zero-knowledge proofs of knowledge for NP (Q362163):
Displaying 21 items.
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP (Q893613) (← links)
- Efficient 4-round zero-knowledge proof system for NP (Q1425336) (← links)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- On the existence of three round zero-knowledge proofs (Q1653072) (← links)
- Promise zero knowledge and its applications to round optimal MPC (Q1784103) (← links)
- How to construct constant-round zero-knowledge proof systems for NP (Q1924196) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- (Q2754163) (← links)
- Zero knowledge proofs of knowledge in two rounds (Q3210166) (← links)
- Polynomial-Space Approximation of No-Signaling Provers (Q3587375) (← links)
- (Q4414289) (← links)
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings (Q5097051) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311538) (← links)
- Theory of Cryptography (Q5901772) (← links)
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view (Q6112013) (← links)
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) (← links)
