Pages that link to "Item:Q1975967"

The following pages link to On relationships between statistical zero-knowledge proofs (Q1975967):

Displaying 22 items.

• A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
• On best-possible obfuscation (Q744349) (← links)
• Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
• Proofs of Work from worst-case assumptions (Q1673424) (← links)
• Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
• On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
• Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs (Q2407103) (← links)
• The minimum oracle circuit size problem (Q2410683) (← links)
• Knottedness is in NP, modulo GRH (Q2445896) (← links)
• How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524) (← links)
• On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
• A Surprisingly Simple Way of Reversing Trace Distance via Entanglement (Q2898038) (← links)
• New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
• (Q4542558) (← links)
• The Untold Story of $$\mathsf {SBP}$$ (Q5042261) (← links)
• (Q5121911) (← 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)
• An Equivalence Between Zero Knowledge and Commitments (Q5445522) (← links)
• The Complexity of Zero Knowledge (Q5458822) (← links)
• Advances in Cryptology - ASIACRYPT 2003 (Q5902396) (← links)
• On the complexity of compressing obfuscation (Q5918748) (← links)