Pages that link to "Item:Q2829956"
From MaRDI portal
The following pages link to On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956):
Displaying 9 items.
- Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
- Statistical zero knowledge and quantum one-way functions (Q884454) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Quantum advantage from one-way functions (Q6652974) (← links)
