The following pages link to (Q4228522):
Displaying 11 items.
- Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- On the Complexity of Computational Problems Regarding Distributions (Q3088193) (← links)
- (Q4542558) (← links)
- (Q5002789) (← links)
- On the Power of Statistical Zero Knowledge (Q5117376) (← links)
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
- Advances in Cryptology - ASIACRYPT 2003 (Q5902396) (← links)
