Pages that link to "Item:Q5117376"
From MaRDI portal
The following pages link to On the Power of Statistical Zero Knowledge (Q5117376):
Displaying 21 items.
- Statistical zero-knowledge languages can be recognized in two rounds (Q808692) (← links)
- Statistical zero knowledge and quantum one-way functions (Q884454) (← links)
- On the impossibility of entropy reversal, and its application to zero-knowledge proofs (Q1690186) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- On statistical security in two-party computation (Q2119059) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- Zero knowledge and circuit minimization (Q2407082) (← links)
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List (Q2794500) (← links)
- Secret Sharing and Statistical Zero Knowledge (Q2811150) (← links)
- (Q4542558) (← links)
- The Untold Story of $$\mathsf {SBP}$$ (Q5042261) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials (Q5140844) (← links)
- (Q5158501) (← links)
- (Q5158502) (← links)
- (Q5875514) (← links)
- Advances in Cryptology - ASIACRYPT 2003 (Q5902396) (← links)
