The following pages link to (Q4542558):
Displaying 23 items.
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs (Q2481774) (← links)
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524) (← links)
- High entropy random selection protocols (Q2659776) (← links)
- On the Complexity of Computational Problems Regarding Distributions (Q3088193) (← links)
- Rationality in the Full-Information Model (Q3408207) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Zero-Knowledge Interactive Proof Systems for New Lattice Problems (Q3460104) (← links)
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (Q3519535) (← links)
- New Constructions and Applications of Trapdoor DDH Groups (Q4916024) (← links)
- Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
- (Q5002789) (← links)
- (Q5089146) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge (Q5445500) (← links)
- General Properties of Quantum Zero-Knowledge Proofs (Q5445501) (← links)
- The Complexity of Zero Knowledge (Q5458822) (← links)
- An identification system based on the explicit isomorphism problem (Q6080426) (← links)
- Strong batching for non-interactive statistical zero-knowledge (Q6637570) (← links)
