Statistical difference beyond the polarizing regime
From MaRDI portal
Publication:2175943
DOI10.1007/978-3-030-36033-7_12zbMath1455.94124OpenAlexW2990837129MaRDI QIDQ2175943
Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan, Itay Berman
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_12
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistical zero-knowledge languages can be recognized in two rounds
- A note on computational indistinguishability
- Asymptotic methods in statistical decision theory
- Does co-NP have short interactive proofs ?
- Trading help for interaction in statistical zero-knowledge proofs
- On interactive proofs with a laconic prover
- Multi-collision resistant hash functions and their applications
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Structure vs. hardness through the obfuscation lens
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- On the impossibility of entropy reversal, and its application to zero-knowledge proofs
- On distributional collision resistant hashing
- On Statistically Secure Obfuscation with Approximate Correctness
- Limits of Provable Security for Homomorphic Encryption
- On basing one-way functions on NP-hardness
- The Computational Complexity of Estimating MCMC Convergence Time
- On the Complexity of Computational Problems Regarding Distributions
- A complete problem for statistical zero knowledge
- Some inequalities for information divergence and related measures of discrimination
- On the Power of Statistical Zero Knowledge
- White-Box vs. Black-Box Complexity of Search Problems
- Multi-collision resistance: a paradigm for keyless hash functions
- On Basing Size-Verifiable One-Way Functions on NP-Hardness
- Advances in Cryptology - EUROCRYPT 2004
- Introduction to Property Testing
- An Equivalence Between Zero Knowledge and Commitments
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption
