Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. | 0 | 0.34 | 2022 |
Lower Bound on SNARGs in the Random Oracle Model. | 0 | 0.34 | 2022 |
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs | 0 | 0.34 | 2022 |
A Toolbox for Barriers on Interactive Oracle Proofs. | 0 | 0.34 | 2022 |
Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS. | 0 | 0.34 | 2022 |
SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost. | 0 | 0.34 | 2022 |
Tight Security Bounds for Micali's SNARGs | 0 | 0.34 | 2021 |
Adversarial laws of large numbers and optimal regret in online classification | 0 | 0.34 | 2021 |
Subquadratic Snargs In The Random Oracle Model | 0 | 0.34 | 2021 |
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. | 0 | 0.34 | 2019 |
The Deep Journey from Content to Collaborative Filtering. | 1 | 0.35 | 2016 |