Pages that link to "Item:Q2490264"
From MaRDI portal
The following pages link to Lower bounds for non-black-box zero knowledge (Q2490264):
Displaying 23 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)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- A note on perfect correctness by derandomization (Q2146431) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
- Fiat–Shamir for Highly Sound Protocols Is Instantiable (Q2827720) (← links)
- On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs (Q2827722) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Strong Proofs of Knowledge (Q3088175) (← links)
- Standard Security Does Not Imply Indistinguishability Under Selective Opening (Q3181024) (← links)
- Composition of Zero-Knowledge Proofs with Efficient Provers (Q3408217) (← links)
- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge (Q3454578) (← links)
- One-Time Programs (Q3600212) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- The Journey from NP to TFNP Hardness (Q4638115) (← links)
