Pages that link to "Item:Q2490264"
From MaRDI portal
The following pages link to Lower bounds for non-black-box zero knowledge (Q2490264):
Displaying 6 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Round-optimal zero-knowledge proofs of knowledge for NP (Q362163) (← 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)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
