| Public-Key Encryption from Continuous LWE. | 0 | 0.34 | 2022 |
| Unconditionally Secure Computation Against Low-Complexity Leakage | 0 | 0.34 | 2021 |
| Threshold Secret Sharing Requires a Linear-Size Alphabet | 0 | 0.34 | 2020 |
| Approximate degree, secret sharing, and concentration phenomena. | 0 | 0.34 | 2019 |
| XOR Codes and Sparse Learning Parity with Noise. | 0 | 0.34 | 2019 |
| Unconditionally Secure Computation Against Low-Complexity Leakage. | 0 | 0.34 | 2019 |
| Small bias requires large formulas. | 0 | 0.34 | 2018 |
| Approximate degree of AND via Fourier analysis. | 0 | 0.34 | 2018 |
| Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources. | 0 | 0.34 | 2018 |
| XOR Codes and Sparse Random Linear Equations with Noise. | 0 | 0.34 | 2018 |
| Complete Classi fication of Generalized Santha-Vazirani Sources. | 0 | 0.34 | 2017 |
| Approximate Bounded Indistinguishability. | 0 | 0.34 | 2017 |
| Complete Classification of Generalized Santha-Vazirani Sources. | 0 | 0.34 | 2017 |
| Pseudorandom Functions: Three Decades Later. | 7 | 0.50 | 2017 |
| Threshold Secret Sharing Requires a Linear Size Alphabet. | 6 | 0.47 | 2016 |
| Bounded Indistinguishability and the Complexity of Recovering Secrets. | 7 | 0.45 | 2016 |
| On the Hardness of Learning with Rounding over Small Modulus. | 22 | 0.70 | 2016 |
| Homomorphic Evaluation Requires Depth. | 2 | 0.37 | 2016 |
| Candidate weak pseudorandom functions in AC0 ○ MOD2 | 1 | 0.35 | 2014 |
| Limits of provable security for homomorphic encryption. | 6 | 0.43 | 2013 |
| Hard Functions For Low-Degree Polynomials Over Prime Fields | 0 | 0.34 | 2013 |
| Pseudorandomness for Width-2 Branching Programs. | 14 | 0.57 | 2013 |
| Pseudorandomness for Linear Length Branching Programs and Stack Machines. | 2 | 0.45 | 2012 |
| On the security of Goldreich’s one-way function | 19 | 0.77 | 2012 |
| On the depth complexity of homomorphic encryption schemes. | 1 | 0.36 | 2012 |
| Sparse extractor families for all the entropy | 4 | 0.43 | 2012 |
| Hard functions for low-degree polynomials over prime fields | 1 | 0.41 | 2011 |
| Homomorphic encryption from codes. | 7 | 0.54 | 2011 |
| On Extracting Common Random Bits From Correlated Sources | 9 | 0.89 | 2011 |
| Pseudorandomness for Read-Once Formulas | 14 | 0.68 | 2011 |
| A dichotomy for local small-bias generators | 14 | 0.50 | 2011 |
| The computational complexity of estimating MCMC convergence time | 4 | 0.44 | 2011 |
| The Computational Complexity of Estimating Convergence Time | 1 | 0.36 | 2010 |
| Hard Instances for Satisfiability and Quasi-one-way Functions | 2 | 0.41 | 2010 |
| Pseudorandom Bits for Polynomials | 35 | 1.70 | 2010 |
| A better tester for bipartiteness? | 0 | 0.34 | 2010 |
| Pseudorandomness for Width 2 Branching Programs. | 0 | 0.34 | 2009 |
| The Complexity of Distinguishing Markov Random Fields | 12 | 0.64 | 2008 |
| Hardness Amplification for Errorless Heuristics | 3 | 0.39 | 2007 |
| Average-case complexity | 35 | 1.43 | 2006 |
| More on Noncommutative Polynomial Identity Testing | 15 | 0.81 | 2005 |
| Pseudorandom generators for low degree polynomials | 22 | 1.19 | 2005 |
| On Worst-Case to Average-Case Reductions for NP Problems | 53 | 2.15 | 2005 |
| Lower bounds for testing bipartiteness in dense graphs | 9 | 0.62 | 2004 |
| A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes | 8 | 0.58 | 2004 |
| Power-aware base station positioning for sensor networks | 72 | 3.91 | 2004 |
| A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs | 47 | 2.16 | 2002 |
| Mechanical Translation of I/O Automaton Specifications into First-Order Logic | 4 | 0.46 | 2002 |
