The following pages link to (Q3210166):
Displayed 10 items.
- A language-dependent cryptographic primitive (Q676829) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- Adaptively secure distributed public-key systems. (Q1853497) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← 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)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (Q5445504) (← links)