The following pages link to (Q3826476):
Displayed 10 items.
- A language-dependent cryptographic primitive (Q676829) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- One-Time Programs (Q3600212) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model (Q5323057) (← links)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500) (← links)
- An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)