Pages that link to "Item:Q3455561"
From MaRDI portal
The following pages link to A complete problem for statistical zero knowledge (Q3455561):
Displaying 29 items.
- AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- On best-possible obfuscation (Q744349) (← links)
- Statistical zero knowledge and quantum one-way functions (Q884454) (← links)
- How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs (Q1688404) (← 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)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Statistical difference beyond the polarizing regime (Q2175943) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge (Q2516524) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- Robust characterizations of <i>k</i> -wise independence over product spaces and related testing results (Q2856576) (← links)
- Complete Problem for Perfect Zero-Knowledge Quantum Proof (Q2891386) (← links)
- A Surprisingly Simple Way of Reversing Trace Distance via Entanglement (Q2898038) (← links)
- Quantum computing and hidden variables (Q3102441) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- Новые оценки расстояния по вариации между двумя распределениями выборки (Q3382030) (← links)
- Оценки расстояния по вариации между распределениями двух наборов независимых случайных величин (Q3383120) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283) (← links)
- Communication Complexity of Statistical Distance (Q5002655) (← links)
- (Q5002789) (← links)
- (Q5089146) (← links)
- (Q5090374) (← links)
- (Q5140844) (← links)
- The final nail in the coffin of statistically-secure obfuscator (Q6161431) (← links)
