| On the security of the BCTV Pinocchio zk-SNARK variant. | 0 | 0.34 | 2019 |
| On the efficiency of pairing-based proofs under the d-PKE. | 0 | 0.34 | 2019 |
| A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK. | 5 | 0.40 | 2018 |
| Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model. | 3 | 0.40 | 2017 |
| Twenty (simple) questions. | 0 | 0.34 | 2017 |
| Interactive Oracle Proofs with Constant Rate and Query Complexity. | 3 | 0.36 | 2017 |
| Zero Knowledge Protocols from Succinct Constraint Detection. | 1 | 0.35 | 2017 |
| The k-distinct language: Parameterized automata constructions. | 0 | 0.34 | 2016 |
| Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. | 6 | 0.39 | 2016 |
| Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. | 0 | 0.34 | 2016 |
| On Probabilistic Checking in Perfect Zero Knowledge. | 3 | 0.39 | 2016 |
| Almost Optimal Cover-Free Families | 7 | 0.48 | 2015 |
| Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. | 4 | 0.42 | 2015 |
| The K-Distinct Language: Parameterized Automata Constructions | 0 | 0.34 | 2014 |
| Relations between automata and the simple k-path problem. | 0 | 0.34 | 2014 |
| On r-Simple k-Path. | 3 | 0.41 | 2014 |
| Subspace Polynomials and Cyclic Subspace Codes. | 4 | 0.47 | 2014 |
| Improved Extractors for Affine Lines. | 0 | 0.34 | 2013 |
| On $r$-Simple $k$-Path. | 4 | 0.45 | 2013 |
| Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic. | 4 | 0.39 | 2013 |
| Increasing the Output Length of Zero-Error Dispersers | 8 | 0.52 | 2012 |
| Invertible Zero-Error Dispersers and Defective Memory with Stuck-At Errors. | 7 | 0.54 | 2012 |
| A new family of locally correctable codes based on degree-lifted algebraic geometry codes | 3 | 0.48 | 2012 |
| Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic. | 3 | 0.41 | 2012 |
| Derandomizing Algorithms on Product Distributions and Other Applications of Order-Based Extraction | 0 | 0.34 | 2010 |
| Extractors and Rank Extractors for Polynomial Sources | 20 | 0.80 | 2007 |
| Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed | 35 | 1.94 | 2005 |
| Deterministic Extractors for Affine Sources over Large Fields | 33 | 1.32 | 2005 |
